• Proceedings of the KSR Conference
• /
• 2008.06a
• /
• pp.1773-1780
• /
• 2008

When the fire occur in the deeply underground subway station, the difficulties of passenger evacuation are expected because of many stairs to the exit. In this study, SOONGSIL-University station (7 line, 47m depth) is the one of the deepest subway stations of the each line in the Seoul metro. The numerical computational-simulation was performed for the fire driven flow in the subway station. Hot and smoke flow was analyzed from the simulation results. The proper plan of evacuation against fire was considered through the results. The fire driven flow was simulated using FDS code in which LES method was applied. The Heat Release Rate was 10MW and the ultrafast model was applied for the growing model of the fire source. The proper mesh size was determined from the characteristic length of fire size. The parallel computational method was employed to compute the flow and heat eqn's in the meshes, which are about 10,000,000, with 6cpu of the linux clustering machine.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.2
• /
• pp.139-147
• /
• 2009

BLAST (Basic Local Alignment Search Tool) is a best well-known tool in a bioinformatics area. BLAST quickly compares input sequences with annotated huge sequence databases and predicts their functions. It helps biologists to make it easy to annotate newly found sequences with reduced experimental time, scope, and cost. However, as the amount of sequences is increasing remarkably with the advance of sequencing machines, performance of BLAST has been a critical issue and tried to solve it with several alternatives. In this paper, we propose a new PC-Based Cluster system (E-Cluster), a new physical data design methodology (logical partitioning technique) and a query routing technique (intra-query routing). To verify our system, we measure response time, speedup, and efficiency for various sizes of sequences in NR (Non-Redundancy) database. Experimental result shows that proposed system has better speedup and efficiency (maximum 600%) than those o( conventional approaches such as SMF machines, clusters, and grids.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.54 no.8
• /
• pp.375-387
• /
• 2005

This paper presents an application of parallel Genetic Algorithm-Tabu Search (GA-TS) algorithm to search an optimal solution of a service restoration in distribution systems. The main objective of service restoration of distribution systems is, when a fault or overload occurs, to restore as much load as possible by transferring the do-energized load in the out of service area via network reconfiguration to the appropriate adjacent feeders at minimum operational cost without violating operating constraints, which is a combinatorial optimization problem. This problem has many constraints with many local minima to solve the optimal switch position. This paper develops parallel GA-TS algorithm for service restoration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solutions of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper $10\%$ of the population 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 consists 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 validity of the proposed method, proposed algorithm has been tested with a practical distribution system in Korea. From the simulation results, we can find that the proposed algorithm is efficient for the distribution system service restoration in terms of the solution quality, speedup, efficiency and computation time.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.53 no.10
• /
• pp.556-564
• /
• 2004

This paper presents an application of parallel Genetic Algorithm-Tabu Search(GA-TS) algorithm to search an optimal solution of a reconfiguration in distribution system. The aim of the reconfiguration of distribution systems is to determine switch position to be opened for loss minimization in the radial distribution systems, which is a discrete optimization problem. This problem has many constraints and very difficult to solve the optimal switch position because it has many local minima. This paper develops parallel GA-TS algorithm for reconfiguration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solution of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper 10% of the population to enhance the local searching capabilities. With migration operation, best string of each node is transferred to the neighboring node aster predetermined iterations are executed. For parallel computing, we developed a PC-cluster system consisting of 8 PCs. Each PC employs the 2 GHz Pentium Ⅳ 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 a distribution systems in the reference paper. From the simulation results, we can find that the proposed algorithm is efficient and robust for the reconfiguration of distribution system in terms of the solution qualify. speedup. efficiency and computation time.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.79-82
• /
• 2012

기존의 서버 전원 모드 제어에는 서버를 Off할 때 정적 종료 방식을 사용하는 관계로 서버가 사용자 요청을 모두 처리하는 최적의 종료 시간을 찾는데 시간이 많이 걸리는 단점을 가진다. 이 시간이 짧게 되면 사용자 QoS를 보장할 수 없고, 반대로 이 시간이 길게 되면 전력 절감을 기대할 수 없다. 본 논문에서는 정적 종료 방식의 단점을 극복하는 동적 종료 방식을 제안한다. 제안된 방식은 최적의 종료 시간을 찾을 필요 없이 각 서버가 사용자의 요청을 모두 처리하였을 때 자동적으로 서버를 Off한다. 제안된 방법은 최적의 시간을 자동적으로 찾아내기 때문에 사용자 QoS를 보장하고, 전력을 절감한다. 실험은 30대의 PC 클러스터를 이용하여 수행되었고, 실험을 통하여 제안하는 동적 종료 방법이 기존의 정적 종료 방법에 비해 운영자의 수고 없이 자동적으로 전력 절감 및 사용자 QoS에 기여함을 확인하였다.

• Informatization Policy
• /
• v.23 no.2
• /
• pp.73-97
• /
• 2016

Social changes due to ICT like Big Data, IoT, Cloud and Mobile is progressing rapidly. Now, we get out of the old-fashioned frame was measured at the level of the information society through the introduction of PC, Internet speed and Internet subscribers etc and there is a need for a new type of diagnostic information society framework. This study is the study for the framework established to diagnose and measure post-information society. The framework and indicators were chosen in accordance with the technological society coevolution theory and information society-related indicators presented from authoritative international organizations. Empirical results utilizing the indicators and framework developed in this study were as follows: First, the three sectors, six clusters (items), 25 nodes (indicators) that make up the information society showed that all strongly connected. Second, it was diagnosed as information society development (50.34%), technology-based expansion (25.03%) and ICT effect (24.63%) through a network analysis (ANP) for the measurement of importance of the information society. Third, the result of calculating the relative importance of the cluster and nodes showed us (1)social development potential (26.04%), (2)competitiveness (15.9%), (3)ICT literacy (15.5%) (4) (social)capital (24.3 %), (5)ICT acceptance(9.54%), (6)quality of life(8.7%). Consequently, We should take into account the effect of the economy and quality of life beyond ICT infrastructure-centric when we measure the post-information society. By applying the weighting we should performs a comparison between countries and we should diagnose the level of Korea and provide policy implications for the preparation of post-information society.

• Spatial Information Research
• /
• v.20 no.4
• /
• pp.17-27
• /
• 2012

This study was performed to evaluate the spatial distribution of heavy metals using principal component analysis and Ordinary Kriging technique in the Gangwon Mine site. In the soils from the sub soil, the contents of Zn and Ni in the PC1 were gradually dispersed from south to north direction, while the components of Cd and Hg in the PC2 showed an increase significantly from middle-south area in the Gangwon Mine site. According to the cluster analysis, pollutant metals of As and Cu were presented a strong spatial autocorrelation structure in cluster D. The concentration of As was 0.83mg/kg and shown to increase from the south to north direction. The spatial distribution maps of the soil components using geostatistical method might be important in future soil remediation studies and help decision-makers assess the potential health risk affects of the abandoned mining sites.

• Spatial Information Research
• /
• v.11 no.3
• /
• pp.213-226
• /
• 2003

With the increasing demand of processing massive geographic data, conventional GISs based on the single processor architecture appear to be problematic. Especially, performing complex GIS operations on the massive geographic data is very time consuming and even impossible. This is due to the processor speed development does not keep up with the data volume to be processed. In the field of GIS, this PC clustering is one of the emerging technology for handling massive geographic data effectively. In this study, a MPI(Message Passing Interface)-based parallel processing approach was conducted to implement the existing raster GIS operations that typically requires massive geographic data sets in order to improve the processing capabilities and performance. Specially for this research, four types of raster CIS operations that Tomlin(1990) has introduced for systematic analysis of raster GIS operation. A data decomposition method was designed and implemented for selected raster GIS operations.

• Journal of Korea Multimedia Society
• /
• v.2 no.3
• /
• pp.265-276
• /
• 1999

Video on Demand (VOD) system is definitely one of main applications in upcoming multimedia era. In this research, we have designed and implemented a host-based scalable VOD system (SVOD) which is composed of low cost PC servers and runs on Linux kernel that is currently spotlighted in enterprise and research domains. Our contribution is as follows: first, the previous Ext2 file system was modified to efficiently support continuous media like MPEG stream. Second, the storage server features a host-based scalable architecture. Third, a software MPEG decoder was implemented using Microsoft's DirectShow$\circledR$COM. Finally, flow control between client and server is provided to suppress overflow and underflow of client circular buffer and supports FF VCR operation. We have known that it is possible to develop a thread-based and scalable VOD system on low cost PC servers and free Linux kernel.

• The KIPS Transactions:PartC
• /
• v.19C no.2
• /
• pp.135-144
• /
• 2012

All the servers in a traditional server cluster environment are kept On. If the request load reaches to the maximum, we exploit its maximum possible performance, otherwise, we exploit only some portion of maximum possible performance so that the efficiency of server power consumption becomes low. We can improve the efficiency of power consumption by controlling power mode of servers according to load situation, that is, by making On only minimum number of servers needed to handle current load while making Off the remaining servers. In the existing power mode control method, they used a static policy to decide server power mode at a fixed time interval so that it cannot adapt well to the dynamically changing load situation. In order to improve the existing method, we propose a dynamic server power control algorithm. In the proposed method, we keep the history of server power consumption and, based on it, predict whether power consumption increases in the near future. Based on this prediction, we dynamically change the time interval to decide server power mode. We performed experiments with a cluster of 30 PCs. Experimental results show that our proposed method keeps the same performance while reducing 29% of power consumption compared to the existing method. In addition, our proposed method allows to increase the average CPU utilization by 66%.