• 천문학회보
• /
• 제35권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.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2007년도 추계 종합학술대회 논문집
• /
• pp.535-538
• /
• 2007

클러스터 시스템을 관리하기 위하여 모니터링 툴(S/W)이 필요하지만, 소규모 클러스터 시스템에 적합하고 관리자가 필요로 하는 기능을 갖춘 모니터링 툴을 결정하는 것은 쉽지가 않다. 본 문서는 인피니밴드 네트워크 스위치를 사용한 소규모 SMP 클러스터 시스템을 위하여 개발한 모니터링 툴의 설계와 구현 내용을 기술하였다. 모니터링 툴의 기능은 계산노드, 인피니밴드 스위치 그리고 작업관리 스케쥴러(PBS)의 작업을 모니터링한다.

• 한국멀티미디어학회논문지
• /
• 제8권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년도 추계 학술대회논문집
• /
• 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
• /
• 제10권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.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2016년도 추계학술대회
• /
• pp.435-437
• /
• 2016

하둡 분산 파일시스템(HDFS)는 빅데이터의 병렬 분산 처리를 위해 다수의 노드에 데이터를 중복 저장하는 파일시스템이다. HDFS의 분산 노드 클러스터는 수천 개 이상의 규모 확장성을 갖추고 있으나 빅데이터 처리를 위한 전용 하드웨어를 가정하고 있으며, 기존의 기업 및 병원에서 사용하고 있는 다양한 유휴 전산 자원을 고려하지는 못하는 문제가 있다. 본 논문에서는 기관 내 존재하는 다양한 유휴 전산 자원을 필요에 따라 동적으로 HDFS에 추가함으로써 빅데이터 저장 및 분석 성능을 향상시킬 수 있는 동적 클러스터 관리 기법을 제시한다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2001년도 추계학술발표논문집 (상)
• /
• 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.

• 한국시스템다이내믹스연구
• /
• 제7권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
• /
• 제5권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.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제10권6호
• /
• pp.507-513
• /
• 2004

본 논문에서는 웹 클러스터 시스템의 효율적인 자원사용 방법에 관하여 연구하고자 한다. 시스템 자원, 즉 메모리 사용을 균형적으로 하는 엘 클러스터 시스템을 구현하기 위한 부하 분산 알고리즘을 제안하여 검토하고자 한다. 다양한 클러스터링 모델에서 반응시간을 성능 측정의 지수로 제시하였다. 또한 웹 클러스터 시스템의 동시사용자수를 기반으로 반응시간은 사용자 수론 증가시키면서 실험을 실시하였다. 제안된 알고리즘에 대한 모의실험 결과는 기존의 상용화된 알고리즘보다 좋은 결과를 보여주고 있다. 제안된 부하분산 알고리즘은 동시 사용자 수가 많은 시스템의 경우, 더 좋은 결과를 보여주고 있다. 제안된 알고리즘은 이기종으로 구성된 웹 서버 시스템에 유용할 것으로 사료된다.