• Proceeding of EDISON Challenge
• /
• 2013.04a
• /
• pp.205-209
• /
• 2013

본 실험에서는 탄소 cluster 중에서 fullerene 구조를 가질 수 있는 가장 작은 cluster인 $C_{20}$ cluster에 대해, 기존 연구에서 가장 안정한 것으로 제시된 cage(fullerene), bowl, ring의 3가지 구조와 $Si_{20}$ cluster를 모방한 구조 하나의 안정성을 확인하였다. ab-initio calculation을 지원하는 Edison nanophysics의 LCAODFLab을 이용하여 LDA-CA, GGA-PBE 두 가지 방법으로 계산하였다. 계산 값을 바탕으로 각 구조의 원자화에너지를 비교한 결과 LDA와 GGA 모두 cage, bowl, ring의 순서로 안정하였다. 최적화한 구조에 대하여 구조분석을 진행하였다. 최적화 결과 Bowl은 $C_{5v}$, ring은 $D_{10h}$, cage는 $C_{2h}$ 대칭성을 가지는 구조였으며, LDA, GGA 계산 모두 $C_{20}$ 구조의 spin polarization에는 영향을 받지 않았다.

• Journal of Advanced Navigation Technology
• /
• v.15 no.2
• /
• pp.204-212
• /
• 2011

Mobile P2P(Peer-to-Peer) protocols in MANET(mobile ad-hoc networks) have gained much attention recently. Existing P2P protocols can be categorized into structured and unstructured ones. In MANET, structured P2P protocols show large control traffic because they does not consider the locality of P2P data and unstructured P2P protocols have a scalability problem with respect to the number of nodes. Hybrid P2P protocols combine advantages of the structured and unstructured P2P protocols. Cluster-based P2P protocol is one of the hybrid P2P protocols. Our study makes an analysis of the cluster-based P2P protocol and derives the optimal cluster formation in MANET. In the derived optimal cluster formation, the cluster-based P2P protocol shows better performance than Gnutella protocol with respect to control traffic.

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.62-69
• /
• 2004

The cluster structure reduces the number of retransmission messages, when a broadcast to all hosts in ad hoc network is needed. A cluster maintenance scheme is employed to preserve this advantage from time to time. However, most of the cluster maintenance schemes require additional control messages for cluster reformation as well as control messages for acquiring neighbor information. This mitigates the advantages of employing cluster structure in ad hoc network. In this paper, a cluster maintenance scheme which forces only clusterheads to broadcast control messages during hello time is proposed. When the cluster reformation is needed, the proposed scheme employs a strategy to reduce the control messages to a minimum. In these processes, the proposed scheme doesn't violate the definition of 2-cluster and produces the clusters in fully distributed method. The simulation results prove that our scheme is better than LCC(1).

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2011.04a
• /
• pp.660-663
• /
• 2011

폭발하중은 매우 짧은 시간 내에 순간적인 높은 압력으로 발생된다. 따라서 폭발하중을 받는 구조물은 매우 복잡한 순간 동역학적 손상 거동을 나타낸다. 이러한 외부 하중에 대한 실험적 연구는 큰 비용, 시설, 그리고 군사적 보안 문제가 요구되기 때문에, 고성능 컴퓨팅 기술을 이용한 수치적 기법을 통해 구조물의 동적 비선형 해석을 수행하였다. 수치해석의 정확성을 높이기 위해 폭풍파와 같은 대기전파의 경우 Euler 기법, 콘크리트 재료의 경우 Lagrange 기법을 적용한 복합적 수치해석 (multi-solver coupling) 기법이 적용되었다. 제안된 수치해석 기법은 explicit 유한요소해석 프로그램인 AUTODYN을 이용하여 수행되었다. 그리고 클러스터 (cluster) 내 병렬 알고리즘 (parallel algorithm)을 이용하여 수치해석의 효율성을 높였다. RC 구조물의 수치해석 결과, 기존 실험 결과와 비교하여 잘 일치되었다. 또한 영역분할 개수가 증가할수록 수행시간은 감소되었고 Speed-up과 효율성은 높아졌다.

• Journal of the Korean Chemical Society
• /
• v.52 no.3
• /
• pp.322-327
• /
• 2008

The geometrical structure, binding energy and vibrational frequencies of HOOCl-H2O cluster were investigated with MP2/6-311G(d,p) and MP2/6-311G(2d,2p) methods. The most stable conformer is skew HOOCl-H2O cluster and the binding energy was 46~48kJ/mol. The trans HOOCl-H2O cluster is less stable than skew form, but the binding energy is big enough to stablize the complex. The vibrational frequencies of skew and trans HOOCl-H2O cluster were calculated and compared with the spectrum of HOOCl.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.7
• /
• pp.1282-1295
• /
• 1994

In this paper, a hierarchical cluster multiprocessor system based on a hierarchical bus system is proposed and its cache coherency protocol is designed and implemented. The hierarchical cluster architecture aims at elimination the system bottleneck of the existing single bus system by adding a hierarchy of buses as the number of clusters is increased. Therefore the system is easy to scale up to a large number of processors. The proposed cache protocol is designed to be adapted to the general N-level (N>2) hierarchical cluster architecture. The original pended protocol is extended to implement the cache protocol on the system bus and cache coherency operations for this protocol are explained.

• Annual Conference of KIPS
• /
• 2002.11c
• /
• pp.1701-1704
• /
• 2002

iBASE/Cluster-MiDAS 는 기 개발된 바다-IV를 공유 디스크 기반 클러스터 환경에서 동작하도록 확장한 iBASE/Cluster의 하부 구조로써 다중 사용자용 자료 저장시스템이다. iBASE/Cluster-MiDAS에서는 하나의 노드에서 동시에 수행되는 여러 트랜잭션들 사이에의 영향뿐 아니라 여러 노드에서 동시에 수행되는 여러 트랜잭션들 사이의 영향으로부터 데이터의 일과성을 유지해야 한다. 본 논문에서는 여러 노드에서 동시에 수행되는 여러 트랜잭션들 간의 동시성 제어를 위해 바다-IV/MiDAS 의 잠금 관리 모듈을 확장한 iBASE/Cluster-MiDAS 잠금 관리 모듈의 내부 구조와 구현시 사용된 기법을 설명한다. iBASE/Cluster-MiDAS 의 잠금 관리 모듈은 잠금 캐싱을 사용하는 중앙 집중 잠금 관리 기법에 기반하고 있으며, 잠금 관리 모듈 수준에서 오류에 유연하게 대처한다.

• Journal of the Korean Society for information Management
• /
• v.29 no.2
• /
• pp.45-70
• /
• 2012

There have been many methods and algorithms proposed for multidimensional scaling to mapping the relationships between data objects into low dimensional space. But traditional techniques, such as PROXSCAL or ALSCAL, were found not effective for visualizing the proximities between objects and the structure of clusters of large data sets have more than 50 objects. The CLUSCAL(CLUster-oriented SCALing) technique introduced in this paper differs from them especially in that it uses cluster structure of input data set. The CLUSCAL procedure was tested and evaluated on two data sets, one is 50 authors co-citation data and the other is 85 words co-occurrence data. The results can be regarded as promising the usefulness of CLUSCAL method especially in identifying clusters on MDS maps.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.26 no.4
• /
• pp.275-281
• /
• 2013

In this paper, determination of the scalability of the cluster composed common personal computer was performed when optimization of reinforced concrete structure using genetic algorithm. The goal of this research is watching the potential of multi-core-PC cluster for optimization of seismic design of reinforced-concrete structures. By increasing the number of core-processer of cluster, decreasing of computation time per each generation of genetic algorithm was observed. After classifying the components in singular personal computer, the estimation of the expected bottle-neck phenomenon and comparison with wall-clock time and Amdahl's law equation was performed. So we could obseved the scalability of the cluster appear complex tendency. For separating the bottle-neck phenomenon of physical and algorithm, the different size of population was selected for genetic algorithm cases. When using 64 core-processor, the efficiency of cluster is low as 31.2% compared with Amdahl's law efficiency.

• Journal of Internet Computing and Services
• /
• v.5 no.5
• /
• pp.27-37
• /
• 2004

The existing ad hoc network protocols suffer the scalability problem due to the inherent characteristics of node mobility. Cluster-based routing protocols divide the member nodes into a set of clusters and perform a hierarchical routing between these clusters. This hierarchical feature help to improve the scalability of ad hoc network routing. However, previous k-hop cluster-based routing protocols face another problems, that is, control overhead of the cluster headers. This paper proposes a novel k-hop cluster-based routing scheme with delegation functions for mobile ad hoc networks. The scheme employs is based on tree topology to manage cluster members in effectively. The cluster headers do not manage the routing table for whole members, while the header keeps the routing table for its neighbor members and the member list for one hop over nodes within k-hop cluster. Then the in-between leveled nodes manage the nested nodes which is structured in the lower level. Therefore, the proposed mechanism can reduce some control overhead of the cluster leaders.