• Journal of Industrial Technology
• /
• v.21 no.A
• /
• pp.129-134
• /
• 2001

Linux cluster Server makes a high performance PC cluster system, and provides scalablity and availability as compared with an expensive single server. In this paper, we design and implement a VOD streaming service system to serve video and audio streaming services on the Linux cluster server. Our Streaming server supports the MS Window Media Format based on the RTSP streaming protocol.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.9 no.3
• /
• pp.20-24
• /
• 2006

In this paper, our research efforts and activities for displaying flight simulation graphics on multi-monitors connected to a Linux cluster is introduced. In this pilot system graphics rendering as well as view calculation including LOD implementation for each monitor is peformed on each sub-node computer connected to the monitor rather than using an expensive main server. The Linux cluster is constructed by combining general-purpose desktop computers, and MPI library Is used for communication between sub-nodes. It could be concluded from our experience that it is possible to construct a massive multi-monitor display system by adding to the cluster as many sub-node computers and monitors as possible with economic efficiency.

• 한국전산유체공학회:학술대회논문집
• /
• 2001.10a
• /
• pp.58-62
• /
• 2001

Aparallel computing environment was constructed based on Windows 2000 operating system. This cluster was configured using Fast-Ethernet system to hold up together the clients within a network domain. For the parallel computation, MPI implements for Windows such as MPICH.NT.1.2.2 and MP-MPICHNT.1.2 were used with Compaq Visual Fortran compiler which produce a well optimized executives for x86 systems. The evaluation of this cluster performance was carried out using a preconditioned Navier-Stokes code for the 2D analysis of a compressible and viscous flow around a compressor blade. The parallel performance was examined in comparison with those of Linux clusters studied previously by changing a number of processors, problem size and MPI libraries. The result from the test problems presents that parallel performance of the low cost Fast-Ethernet Windows cluster is superior to that of a Linux cluster of similar configuration and is comparable to that of a Myrinet cluster.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.04a
• /
• pp.381-384
• /
• 2002

This paper describes the motivation, design and performance of bi-active Load balancer in Linux Virtual Server. The goal of bi-active Load balancer is to provide a framework to build highly scalable, fault-tolerant services using a large cluster of commodity servers. The TCP/IP stack of Linux Kernel is extended to support three IP load balancing techniques, which can make parallel services of different kinds of server clusters to appear as a service on a single IP address. Scalability is achieved by transparently adding or removing a node in the cluster. and high availability is provided by detecting node or daemon failures and reconfiguring the system appropriately. Extensive simulation reveals that the proposed approach improves the reply rate about 20% compared to earlier design.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.31 no.5
• /
• pp.37-43
• /
• 2003

Parallel computing method is widely used in the computational fluid dynamics for efficient numerical analysis. Nowadays, low cost Linux cluster computers substitute for traditional supercomputers with parallel computing shcemes. The performance of nemerical solvers on an Linux cluster computer is highly dependent not on the performance of processors but on the performance of network devices in the cluster system. In this paper, we investigated the effects of the network devices such as Myrinet2000, gigabit ethernet, and fast ethernet on the performance of the cluster system by using some benchmark programs such as Netpipe, LINPACK, NAS NPB, and MPINS2D Navier-Stokes solvers. Finally, upon this investigation, we will suggest the method for building high performance low cost Linux cluster system in the computational fluid dynamics analysis.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.359-366
• /
• 2001

This paper overviews the design of SANique$^{TM}$ -a shred file system for Linux cluster based on SAN environment. SANique$^{TM}$ has the capability of transferring user data from network-attached SAN disks to client applcations directly without the control of centralized file server system. The paper also presents the characteristics of each SANique$^{TM}$ subsystem: CFM(Cluster File Manager), CVM(Cluster Volume Manager), CLM(Cluster Lock Manager), CBM(Cluster Buffer Manager) and CRM(Cluster Recovery Manager). Under the SANique$^{TM}$ design layout, then, the syndrome of '||'&'||'quot;split-brain'||'&'||'quot; in shared file system environments is described and defined. The work first generalizes and illustrates possible situations in each of which a shared file system environment may split into two or more pieces of separate brain. Finally, the work describes the SANique$^{TM}$ approach to the given "split-brain"problem using SAN disk named "split-brain" and develops the overall recovery procedure of shared file systems.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.10
• /
• pp.533-543
• /
• 2003

With the increase of interests in cluster, there have been a number of research efforts to address the high availability issues on cluster. However, there are no kernel-level group communication systems to support the development of kernel-level application programs and it is not easy to use traditional user-level group communication systems for the kernel-level applications. This paper presents the design and implementation issues of KCGCS(Kernel-level Cluster Group Communication System), which is a kernel-level group communication module for linux cluster. Unlike traditional user-level group communication systems, the KCGCS uses light-weight heartbeat messages and a ring-based heartbeat mechanism, which allows users to implement scalable failure detection mechanisms. Moreover, the KCGCS improves the reliability by using distributed coordinators to maintain membership information.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.14 no.3
• /
• pp.287-298
• /
• 2001

Analysis of nonlinear behavior of prestressed concrete frame structures on PC is a time-consuming computing job if the problem size increase to a certain degree. Cluster system has emerged as one of promising computing environments due to its good extendibility, portability, and cost-effectiveness, comparing it with high-end work-stations or servers. In this paper, a parallel nonlinear analysis procedure of prestressed concrete frame structure is presented using cluster computing. Cluster system is configured with readily available pentium III class PCs under Win98 or Linux and fast ethernet. Parallel computing algorithms on element-wise processing parts including the calculation of stiffness matrix, element stresses and determination of material states, check of material failure and calculation of unbalanced loads are developed using MPL. Validity of the method is discussed through typical numerical examples. For the case of 4 node system, maximum speedup is 3.15 and 3.74 for Win98 and Linux, respectively. Important issues for the efficient use of cluster computing system based un PCs and ethernet are addressed.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.68-79
• /
• 2005

The popularity of Web service is ever increasing. As the number of services and clients continue to increase, the problem of providing a system that scales with this increase is becoming more difficult. A costly and ineffective method is to buy a new system that is more powerful every time the load becomes unbearable. h more cost effective solution is to expand the system as the need arises. This is the approach taken in Web cluster systems. However, providing effective scalability in a Web cluster system is stil1 an open issue. In this study, we implement a Web cluster system based on Layer 7 switching technique on Linux. The implementation is based on a design proposed and implemented by Aron et al., but on the FreeBSD. Though the design li the same, due to the vast difference between the FreeBSD and Linux, the implementation presented in this paper is totally new. We also propose the Dual Scheduling (DS) load distribution algorithm that distributes the requests to the system resources by observing the variations in the request rate. We show through measurement on our implementation that the DS alorithm performs considerably bettor than previous algorithms.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.3
• /
• pp.289-300
• /
• 2003

Traditional kernel-level communication systems for clusters are dependent upon computing platforms. Futhermore, they are not easy to use and do not provide various functions for clusters. This paper presents an architecture and various implementation issues of a kernel-level communication system, KCCM(Kernel level Cluster Communication Module), for linux cluster. The KCCM provides asynchronous communication services as well as standard synchronous communication services using send and receive. The KCCM also automatically detects and recovers connection failures at runtime. This allows programmers to use KCCM when they build mission critical applications over TCP-based connection-oriented communication environments. Having developed using standard socket interfaces, it can be easily ported to various platforms. The experimental results show that the KCCM provides good performance for asynchronous communication patterns.