• The Bulletin of The Korean Astronomical Society
• /
• v.35 no.1
• /
• pp.56.2-56.2
• /
• 2010

M87, a cD galaxy in the Virgo cluster, has 3-10 times larger enclosed mass than the Milky Way at any given galactocentric radius. Thus the globular cluster (GC) system in M87 is expected to have undergone a more significant dynamical evolution than that of the Milky Way if it had started from the same initial mass function (MF) and radial distribution (RD) as the Milky Way. The evolution of MF and RD of the M87 GC system has been calculated using an advanced, realistic Fokker-Planck (FP) model that considers dynamical friction, disk/bulge shocks, and eccentric cluster orbits. We perform hundreds of FP calculations with different initial cluster conditions, and then search a wide parameter space for the best-fit initial GC MF and RD that evolves into the observed present-day GC MF and RD. We also find best-fit initial MFs and RDs for blue and red GC groups, separately.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.535-538
• /
• 2007

System manager needs monitoring tool(S/W) to manage cluster system. But, it is difficult to decide suitable monitoring tool for small SMP cluster system. This document described design of monitoring tool(mon) and development. Mon is monitoring tool for small SMP cluster system using InfiniBand network switch. Function of this tool is monitoring such as computing node(7 node), Infiniband network switch and monitoring of PBS job.

• Journal of Korea Multimedia Society
• /
• v.8 no.12
• /
• pp.1623-1630
• /
• 2005

Adaptive modulation and coding (AMC), which has a number of variation levels in accordance with the fading channel variation, is a promising technique for communication systems. In this paper, we present an AMC method using the cluster in OFDM system for bandwidth efficiency and performance improvement. The AMC schemes applied into each cluster or some clusters are determined by the minimum or the average SNR value among all the sub carriers within the corresponding cluster. It is important to find the optimal information on cluster because AMC performance can be varied according to the number and position of cluster. It is shown by computer simulation that the AMC method outperforms the fixed modulation in terms of bandwidth efficiency and its performance can be determined by the position and number of clusters.

• 한국전산유체공학회:학술대회논문집
• /
• 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.

• Journal of Information Processing Systems
• /
• v.10 no.1
• /
• pp.36-54
• /
• 2014

Resource sharing is a major advantage of distributed computing. However, a distributed computing system may have some physical or virtual resource that may be accessible by a single process at a time. The mutual exclusion issue is to ensure that no more than one process at a time is allowed to access some shared resource. The article proposes a token-based mutual exclusion algorithm for the clustered mobile ad hoc networks (MANETs). The mechanism that is adapted to handle token passing at the inter-cluster level is different from that at the intra-cluster level. It makes our algorithm message efficient and thus suitable for MANETs. In the interest of efficiency, we implemented a centralized token passing scheme at the intra-cluster level. The centralized schemes are inherently failure prone. Thus, we have presented an intra-cluster token passing scheme that is able to tolerate a failure. In order to enhance reliability, we applied a distributed token circulation scheme at the inter-cluster level. More importantly, the message complexity of the proposed algorithm is independent of N, which is the total number of nodes in the system. Also, under a heavy load, it turns out to be inversely proportional to n, which is the (average) number of nodes per each cluster. We substantiated our claim with the correctness proof, complexity analysis, and simulation results. In the end, we present a simple approach to make our protocol fault tolerant.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.435-437
• /
• 2016

Hadoop Distributed File System(HDFS) is a file system for distributed processing of big data by replicating data to distributed data nodes. HDFS cluster shows a great scalability up to thousands of nodes, but it assumes a exclusive node cluster with numerous nodes for the big data processing. Various operational-purpose worker systems used by office are hardly considered as a part of cluster. This paper discusses this problem and proposes a dynamic cluster management technique to increase storage capability and analytic performance of hadoop cluster. The propsed technique can add legacy systems to the cluster and can remove them from the cluster dynamically depending on their availability.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10a
• /
• pp.313-316
• /
• 2001

At the end of 1999, the TeraCluster project in the KISTI Supercomputing Center was initiated to explore the possibility of PC clusters as a scientific computing platform to replace the Cray T3E system in KISTI by the year 2002. In order to understand whether an application is scalable to tera-flops sized cluster system, running test is inevitable. Extensive performance tests using well-known benchmarking codes with real applications' characteristics in them were carried out with different combinations of CPUs, system boards, network devices. The lessen learned shows the relationships between system performances and varied applications' different needs resulting in promises of How-Tos in building large scale cluster system. The 64/16 node clusters with Alpha EV6(466MHz), Pentium III(667 MHz) i inter-node network of Fast Ethernet. SCI[1] and Myrinet[2] were evaluated. More detailed specifications of the Linux clusters are described in Table 1.

• Korean System Dynamics Review
• /
• v.7 no.2
• /
• pp.133-148
• /
• 2006

This study suggests a Causal Loop Diagram(CLD) of causality mechanism which are integrating matters of localization, networking, embeddedness & institutional thickness and collective learning. These five factors(localization, networking, embeddedness & institutional thickness, collective learning, innovative synergy) have been studied and proofed Also this study suggest a model of industry cluster based on holistic and global system thinking rather than local and linear thinking.

• Structural Engineering and Mechanics
• /
• v.5 no.2
• /
• pp.209-220
• /
• 1997

The dynamic equations for an arbitrary cluster comprising rigid spheres or assemblies of spheres (subclusters) encountered in granular-type systems are considered. The system is treated within the framework of multibody dynamics. It is shown that for an arbitrary cluster topology the governing equations can be given in an explicit scalar from. The derivation is based on the D'Alembert principle, on inertial coordinate system for each body and direct utilization of the path matrix describing the topology. The scalar form of the equations is important in computer simulations of flow of granular-type materials. An illustrative example of a three-body system is given.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.6
• /
• pp.507-513
• /
• 2004

In this paper, we consider the methodology of efficient resource usage, specially web clustering system. We develope an algorithm that distributes the load on the web cluster system to use the system resources, such as system memory equally. The response time is chosen as a performance measure on the various clustering models. And based on the concurrent user to the web cluster system, the response time is also examined as the number of users increases. Simulation experience with this algorithm shows that the response time seems to have a good results compare to those with the other algorithm. And, also the effectiveness of clustered system becomes better as long as the number of concurrent user increases. The usage of developed algorithm is more useful when the system consists of many different sub-systems, a heterogeneous clustering system.