• Bulletin of the Korean Chemical Society
• /
• v.30 no.8
• /
• pp.1845-1850
• /
• 2009

We have performed replica-exchange molecular dynamics (REMD) simulations on the dimer formation of fibrilforming segments of $\alpha$-Synuclein (residues 71 - 82) using implicit solvation models with two kinds of force fields- AMBER parm99SB and parm96. We observed spontaneous formation of dimers from the extensive simulations, demonstrating the self-aggregating and fibril forming properties of the peptides. Secondary structure profile and clustering analysis showed that dimers with antiparallel $\beta$-sheet conformations, stabilized by well-defined hydrogen boding, are major species corresponding to global free energy minimum. Parallel dimers with partial $\beta$-sheets are found to be off-pathway intermediates. The relative instability of the parallel arrangements is due to the repulsive interactions between bulky and polar side chains as well as weaker backbone hydrogen bonds.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.1284-1286
• /
• 2003

There is a growing demand on remotely sensed and GIS data services in modern society. However, conventional WEB applications based on client/server pattern can not meet the criteria in the future . Grid computing provides a promising resolution for establishing spatial information system toward future applications. Here, a new architecture of the distributed environment for remotely sensed data processing based on the middleware technology was proposed. In addition, in order to utilize the new environment, a problem had to be algorithmically expressed as comprising a set of concurrently executing sub-problems or tasks. Experiment of the algorithm was implemented, and the results show that the new environmental can achieve high speedups for applications compared with conventional implementation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.874-876
• /
• 2001

클러스터링(clustering)은 병렬 처리를 위한 기술로 비교적 값이 싼 컴퓨터들을 네트웍으로 연결하여 전체가 하나의 고성능 수퍼 컴퓨터처럼 동작하게 하는 기술이다. 이 클러스터 시스템의 성능을 최대한 활용하기 위해서는 디스크 입출력에 생기는 병목현상을 해결하여야 하는데, 그 해결책의 하나로 병렬파일시스템을 들 수 있다. 기존의 병렬파일시스템은 TCP/IP기반의 소켓으로 메시지를 주고받았다 그러나 TCP/IP는 프로토콜 오버헤드가 크고 처리 속도가 느리다. 본 논문에서는 이런 오버헤드를 줄이기 위해 도입된 Lightweight 메시징 기법인 VIA(Virtual Interface Architecture)를 이용하여 병렬파일시스템을 구현하기 위한 구체적인 방안을 제시하고 있다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.2
• /
• pp.113-121
• /
• 2000

This paper presents a parallel-structure fuzzy system(PSFS) for prediction of time series data. The PSFS consists of a multiple number of fuzzy systems connected in parallel. Each component fuzzy system in the PSFS predicts the same future data independently based on its past time series data with different embedding dimension and time delay. The component fuzzy systems are characterized by multiple-input singleoutput( MIS0) Sugeno-type fuzzy rules modeled by clustering input-output product space data. The optimal embedding dimension for each component fuzzy system is chosen to have superior prediction performance for a given value of time delay. The PSFS determines the final prediction result by averaging the outputs of all the component fuzzy systems excluding the predicted data with the minimum and the maximum values in order to reduce error accumulation effect.

• Journal of Internet Computing and Services
• /
• v.2 no.3
• /
• pp.81-92
• /
• 2001

The clustering environment with heterogeneous workstations provides the cost effectiveness and usability for executing applications in parallel. The load balancing is considered as a necessary feature for the clustering of heterogeneous workstations to minimize the turnaround time. Since each workstation may have different users, groups. requests for different tasks, and different processing power, the capability of each processing unit is relative to the others' unit in the clustering environment Previous works is a static approach which assign a predetermined weight for the processing capability of each workstation or a dynamic approach which executes a benchmark program to get relative processing capability of each workstation. The execution of the benchmark program, which has nothing to do with the application being executed, consumes the computation time and the overall turnaround time is delayed. In this paper, we present an efficient task distribution method and implementation of load balancing system for the clustering environment with heterogeneous workstations. Turnaround time of the methods presented in this paper is compared with the method without load balancing as well as with the method load balancing with performance evaluation program. The experimental results show that our methods outperform all the other methods that we compared.

• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.10
• /
• pp.487-492
• /
• 2017

Clustering is a technique which is used to measure similarities between data in big data analysis and data mining field. Among various clustering methods, k-Modes algorithm is representatively used for categorical data. To increase the performance of iterative-centric tasks such as k-Modes, a distributed and concurrent framework Spark has been received great attention recently because it overcomes the limitation of Hadoop. Spark provides an environment that can process large amount of data in main memory using the concept of abstract objects called RDD. Spark provides Mllib, a dedicated library for machine learning, but Mllib only includes k-means that can process only continuous data, so there is a limitation that categorical data processing is impossible. In this paper, we design RDD for k-Modes algorithm for categorical data clustering in spark environment and implement an algorithm that can operate effectively. Experiments show that the proposed algorithm increases linearly in the spark environment.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.4
• /
• pp.373-382
• /
• 2000

This paper is concerned with development of a communication module of POFS(Parallel Operating File System), which is the parallel file system to be operated on SPAX computer. SPAX is multiprocessor computer with clustering SMP architecture and being developed by ETRI. The operating system for SPAX is MISIX based on the Chorus microkernel. POFS has client/server architecture basically so that it is important to design a communication module. The communication module is so easily affected by network environment that bad design is the major reason that decreases the portability and performance of the parallel file system. This paper describes the structure and performance of the communication of the POFS. the theme is issued in the course of designing and developing POFS. The communication module of POFS was designed to support the portability and the architecture of parallel file system.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.1_2
• /
• pp.1-14
• /
• 2006

Sort-last parallel rendering using a cluster of GPUs has been widely used as an efficient method for visualizing large- scale volume datasets. The performance of this method is constrained by load balancing when data parallelism is included. In previous works static partitioning could lead to self-balance when only task level parallelism is included. In this paper, we present a load balancing scheme that adapts to the characteristic of volume dataset when data parallelism is also employed. We effectively combine the hierarchical data structures (octree and BSP tree) in order to skip empty regions and distribute workload to corresponding rendering nodes. Moreover, we also exploit a 3D clustering method to determine visibility order and save the AGP bandwidths on each rendering node. Experimental results show that our scheme can achieve significant performance gains compared with traditional static load distribution schemes.

• Proceedings of the KIEE Conference
• /
• 2004.11b
• /
• pp.190-193
• /
• 2004

Optimal Power Flow (OPF) is becoming more and more important in the deregulation environment of power pool and there is an urgent need of faster solution technique for on-line application. So this paper presents parallel genetic algorithm-tap search for the solution of the OPF. The control variables modeled unit active power outputs, generator-bus voltage magnitudes and transformer-tap settings. A number of functional operating constraints, such as branch flow limits, load bus boltage magnitude limits and generator reactive capabilities are included as penalties in the fitness function. In parallel GA-TS, GA operators are executed for each process. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper three populations to enhance the local searching capabilities. With migration operation, best string of each node is transferred to the neighboring node after predetermined iterations are executed. For parallel computing, we developed a PC-cluster system consisting of 8 PCs. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through ethernet switch based fast ethernet. To show the usefulness of the proposed method, developed algorithm has been tested and compared on an IEEE 30-bus system in the reference paper. From the simulation results, we can find that the proposed algorithm is efficient for the OPF.

• KIISE Transactions on Computing Practices
• /
• v.24 no.3
• /
• pp.105-112
• /
• 2018

As data size increase, a single database is not enough to serve current volume of tasks. Since data is partitioned and stored into multiple databases, analysis should also support parallelism in order to increase efficiency. However, traditional analysis requires data to be transferred out of database into nodes where analytic service is performed and user is required to know both database and analytic framework. In this paper, we propose an efficient way to perform K-means clustering algorithm inside the distributed column-based database and relational database. We also suggest an efficient way to optimize K-means algorithm within relational database.