• KEPCO Journal on Electric Power and Energy
• /
• v.8 no.2
• /
• pp.159-179
• /
• 2022

Often a network becomes complex, and multiple entities would get in charge of managing part of the whole network. An example is a utility grid. While the entire grid would go under a single utility company's responsibility, the network is often split into multiple subsections. Subsequently, each subsection would be given as the responsibility area to the corresponding sub-organization in the utility company. The issue of how to make subsystems of adequate size and minimum number of interconnections between subsystems becomes more critical, especially in real-time simulations. Because the computation capability limit of a single computation unit, regardless of whether it is a high-speed conventional CPU core or an FPGA computational engine, it comes with a maximum limit that can be completed within a given amount of execution time. The issue becomes worsened in real time simulation, in which the computation needs to be in precise synchronization with the real-world clock. When the subject of the computation allows for a longer execution time, i.e., a larger time step size, a larger portion of the network can be put on a computation unit. This translates into a larger margin of the difference between the worst and the best. In other words, even though the worst (or the largest) computational burden is orders of magnitude larger than the best (or the smallest) computational burden, all the necessary computation can still be completed within the given amount of time. However, the requirement of real-time makes the margin much smaller. In other words, the difference between the worst and the best should be as small as possible in order to ensure the even distribution of the computational load. Besides, data exchange/communication is essential in parallel computation, affecting the overall performance. However, the exchange of data takes time. Therefore, the corresponding consideration needs to be with the computational load distribution among multiple calculation units. If it turns out in a satisfactory way, such distribution will raise the possibility of completing the necessary computation in a given amount of time, which might come down in the level of microsecond order. This paper presents an effective way to split a given electrical network, according to multiple criteria, for the purpose of distributing the entire computational load into a set of even (or close to even) sized computational loads. Based on the proposed system splitting method, heavy computation burdens of large-scale electrical networks can be distributed to multiple calculation units, such as an RTDS real time simulator, achieving either more efficient usage of the calculation units, a reduction of the necessary size of the simulation time step, or both.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.20 no.4
• /
• pp.381-389
• /
• 2009

Orthogonal frequency division multiplexing(OFDM) that is very useful for the high-speed communication system has serious problem of high peak-to-average power ratio(PAPR) in time domain. Because of this, the non-linear distortion can be produced and system performance gets worse. CI-OFDM system can get the peak power lowered. In this CI-OFDM system, each parallel data is distributed into N all sub-carriers and conveyed by the orthogonal phase factor. Also, CI-OFDM shows frequency diversity effect. Therefore, CI-OFDM system is better than ordinary OFDM system in terms of BER performance and the PAPR reduction. When it is implemented, however, there is a serious problem whether it can separate and compensate the phase factor in order in the receiver. Because all bits are transmitted simultaneously over all subcarriers and each other phase factors in transmitter. In this paper, we propose and evaluate a FD-CI-OFDM system that is a version of improved CI-OFDM. This is designed by use of the Walsh Hadamard sequence. The FD-CI-OFDM shows better performance than ordinary OFDM and CI-OFDM system.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.2
• /
• pp.40-46
• /
• 2010

Multi-user MIMO (Multiple-Input Multiple-Output) systems require collaborative PF schedulers to improve the performance of the log sum of average transmission rates. While the performance of single cell based conventional PF schedulers has been evaluated over various channel conditions, scheduling algorithms by multiple base stations which select multiple users over a given time frame and their performance require further investigations. In this paper, we apply a collaborative PF scheduler to the distributed multi-user MIMO system, which assigns radio resources to multiple users by exchanging user channel information from base stations located in three adjacent sectors. We further evaluate its performance in terms of the log sum of average transmission rates. The performance is compared to that of the full-search collaborative PF scheduler which searches over all possible combinations of user groups, and that of a parallel PF scheduler that determines users without channel information exchange among base stations. We show the log sum of average transmission rates of the collaborative PF scheduler outperforms that of the parallel PF scheduler in low percentile region. In addition, the collaborative PF scheduler exhibits a negligible performance degradation when compared to the full-search collaborative PF scheduler while a significant reduction of the computational complexity is achievable at the same time.

• The Journal of the Korea Contents Association
• /
• v.14 no.5
• /
• pp.8-17
• /
• 2014

Petascale systems(so called supercomputers) have been mainly used for supporting communication-intensive and tightly-coupled parallel computations based on message passing interfaces such as MPI(HPC: High-Performance Computing). On the other hand, computing paradigms such as High-Throughput Computing(HTC) mainly target compute-intensive (relatively low I/O requirements) applications consisting of many loosely-coupled tasks(there is no communication needed between them). In Korea, recently emerging applications from various scientific fields such as pharmaceutical domain, high-energy physics, and nuclear physics require a very large amount of computing power that cannot be supported by a single type of computing resources. In this paper, we present our HTCaaS(High-Throughput Computing as a Service) which can leverage national distributed computing resources in Korea to support these challenging HTC applications and describe the details of our system architecture, job execution scenario and case studies of various scientific applications.

• Journal of Broadcast Engineering
• /
• v.10 no.1 s.26
• /
• pp.83-102
• /
• 2005

The problem of video scheduling is analyzed in the framework of divisible load scheduling. A divisible load can be divided into any number of fractions (parts) and can be processed/computed independently on the processors in a distributed computing system/network, as there are no precedence relationships. In the video scheduling, a frame can be split into any number of fractions (tiles) and can be processed independently on the processors in the network, and then the results are collected to recompose the single processed frame. The divisible load arrives at one of the processors in the network (root processor) and the results of the computation are collected and stored in the same processor. In this problem communication delay plays an important role. Communication delay is the time to send/distribute the load fractions to other processors in the network. and the time to collect the results of computation from other processors by the root processors. The objective in this scheduling problem is that of obtaining the load fractions assigned to each processor in the network such that the processing time of the entire load is a minimum. We derive closed-form expression for the processing time by taking Into consideration the communication delay in the load distribution process and the communication delay In the result collection process. Using this closed-form expression, we also obtain the optimal number of processors that are required to solve this scheduling problem. This scheduling problem is formulated as a linear pro-gramming problem and its solution using neural network is also presented. Numerical examples are presented for ease of understanding.

• Smart Structures and Systems
• /
• v.14 no.5
• /
• pp.901-916
• /
• 2014

Magnetorheological (MR) fluid is one of the field-responsive fluids that is of interest to many researchers due to its high yield stress value, which depends on the magnetic field strength. Similar to electrorheological (ER) fluid, the combination of working modes is one of the techniques to increase the performance of the fluids with limited focus on MR fluids. In this paper, a novel MR testing cell incorporated with valve, shear and squeeze operational modes is designed and constructed in order to investigate the behaviour of MR fluid in combined mode. The magnetic field distribution in the design concept was analyzed using finite element method in order to verify the effective areas of each mode have the acceptable range of flux density. The annular gap of valve and shear were fixed at 1 mm, while the squeeze gap between the parallel circular surfaces was varied up to 20 mm. Three different coil configurations, which were made up from 23 SWG copper wires were set up in the MR cell. The simulation results indicated that the magnetic field distributed in the squeeze gap was the highest among the other gaps with all coils were subjected to a constant applied current of 1 A. Moreover, the magnetic flux densities in all gaps were in a good range of magnitude based on the simulations that validated the proposed design concept. Hence, the 3D model of the MR testing cell was designed using Solidworks for manufacturing processes.

• Smart Structures and Systems
• /
• v.15 no.4
• /
• pp.1121-1137
• /
• 2015

This study presents probabilistic-based damage identification technique for highlighting damage in metallic structures. This technique utilizes distributed piezoelectric transducers to generate and monitor the ultrasonic Lamb wave with narrowband frequency. Diagnostic signals were used to define the scatter signals of different paths. The energy of scatter signals till different times were calculated by taking root mean square of the scatter signals. For each pair of parallel paths an error function based on the energy of scatter signals is introduced. The resultant error function then is used to estimate the probability of the presence of damage in the monitoring area. The presented method with an autofocusing feature is applied to aluminum plates for method verification. The results identified using both simulation and experimental Lamb wave signals at different central frequencies agreed well with the actual situations, demonstrating the potential of the presented algorithm for identification of damage in metallic structures. An obvious merit of the presented technique is that in addition to damages located inside the region between transducers; those who are outside this region can also be monitored without any interpretation of signals. This novelty qualifies this method for online structural health monitoring.

• Journal of KIISE:Software and Applications
• /
• v.26 no.9
• /
• pp.1061-1072
• /
• 1999

한 개 이상의 사이트에 공간 데이타가 중복 저장된 분산 공간 DB에서, 동시에 수행될 수 있는 긴 트랜잭션의 변경은 일관성 제어를 위해 다른 사이트에 전파되어야 한다. 이때 같은 영역의 공간 데이타를 서로 다른 사이트에서 동시에 변경할 경우, 변경 상충 문제가 발생하거나 잠금 기법에 의한 오랜 대기 시간이 초래되는 문제가 있다. 또한 공간 객체는 잠금의 대상이 아닌 공간 관련성에 의한 종속성을 가진다.이 논문은 긴 트랜잭션으로 중복된 공간 데이타를 변경할 경우 중복 제어를 위한 변경 전파와 동시성 제어 문제를 다룬다. 중복된 공간 데이타의 변경 병렬성을 향상시키기 위해 영역 잠금 및 SR-bound WRITE 잠금 기법을 제시한다. 한 사이트에서 수정하는 객체들과 다른 사이트에서 수정하는 객체들 사이에 공간 관련성에 의한 종속성이 없을 경우 병렬 수정을 허용하도록 제어하며, 공간 관련성에 의한 종속성이 있을 경우 SR-based 2PC라 불리는, 확장된 2단계 완료 프로토콜로 협동작업을 수행해서 변경 상충을 해결하는 새로운 중복 제어 기법을 설계하고 구현한다.Abstract The update of a long transaction should be propagated to the other sites for consistency control, when spatial database are replicated at multiple sites to achieve availability, reliability, and performance. When the replicated spatial data are updated at the same time, the update of one site would be conflicted with the other or a user would not be able to access the replicated spatial data under the control of locking. Two spatial objects having spatial relationships should be cooperatively updated even if there are no conflicts of locking for them.This paper deals with the issues of concurrency control and update propagation of replicated spatial data. We present the concept of region lock and SR-bound WRITE lock for enhancing the parallelism of updating the replicated spatial data. If there are no spatial relationships between one site's objets and the other's objects, parallel update would be allowed. Concurrent update of two spatial objects having spatial relationships should be propagated and cooperated by using an extended two-phase commit protocol, called spatial relationship-based 2PC.

• Journal of the Korea Convergence Society
• /
• v.7 no.5
• /
• pp.1-6
• /
• 2016

Many studies have been carried out for the development of big data utilization and analysis technology recently. There is a tendency that government agencies and companies to introduce a Hadoop of a processing platform for analyzing big data is increasing gradually. Increased interest with respect to the processing and analysis of these big data collection technology of data has become a major issue in parallel to it. However, study of the collection technology as compared to the study of data analysis techniques, it is insignificant situation. Therefore, in this paper, to build on the Hadoop cluster is a big data analysis platform, through the Apache sqoop, stylized from relational databases, to collect the data. In addition, to provide a sensor through the Apache flume, a system to collect on the basis of the data file of the Web application, the non-structured data such as log files to stream. The collection of data through these convergence would be able to utilize as a basic material of big data analysis.

• Economic and Environmental Geology
• /
• v.2 no.1
• /
• pp.13-33
• /
• 1969

The Mulkum mine, located in Mulkum-myon, Yangsan-Kun, Kyeongsang Province, is one of the biggest iron mine in Korea. The geology of this mine and its vicinity consists of Chusan andesitic rocks and Datae-dong andesite porphyry of the Kyeongsang System which were intruded by biotite granite widely distributed near the vicinity of Mulkum-ni. The ore deposits, embedded in Dotae-dong andesite porphyry, are fissure-filling vein type in origin. Up to present ore bodies of Main vein, No. 2 vein, Eastern No. 1, 2 vein and Western No. 1 vein are exploited. Generally the veins strike N 10-25 E and dip to 60-90 SE. The proved length of vein is more than 500 meters and its depth 150 meters in Main vein with 3-4 meters of thickness in average. Ore minerals are mainly magnetite and locally associated with small amounts of hematite, sphecularite and chalcopyrite. Gangue minerals are quartz, epidote, chlorite, pyroxene, and garnet, etc. The modes of occurrence of vein are as follow; 1. Branching and parallel vein patterns are observed around main shaft in -1 level. 2. Multiple cymoid loops and subrectangular vein patterns are observed around main shaft in -2 level. 2. Single vein patterns are observed in -3 and -5 level. The ore-shoots plunge northeasterly about 20-30 degrees. In conclusion, the tectonically fractured zone belongs to the poorly mineralized zone and shoots are formed as single vein type. The general trends of one-shoots must be applied the prospecting of the deep-seated ore body in the deposits.