• Journal of Korea Water Resources Association
• /
• v.42 no.3
• /
• pp.247-257
• /
• 2009

In this study, a distributed rainfall-runoff model is developed using a multi-directional flow allocation algorithm and the real-time runoff updating algorithm. The developed model consists of relatively simple governing equations of hydrologic processes in order to apply developed algorithms and to enhance the efficiency of computational time which is drawback of distributed model application. The variability of topographic characteristics and flow direction according to various spatial resolution were analyzed using DEM(Digital Elevation Model) data. As a preliminary process using fine resolution DEM data, a multi-directional flow allocation algorithm was developed to maintain detail flow information in distributed rainfall-runoff simulation which has strong advantage in computation efficiency and accuracy. Also, a real-time updating algorithm was developed to update current watershed condition. The developed model is able to hold the information of actual behavior of runoff process in low resolution simulation. Therefore it is expected the improvement of forecasting accuracy and computational efficiency.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.5
• /
• pp.2457-2464
• /
• 2013

In this paper, we design and analyze a mutual exclusion algorithm, based on the Token and Failure detector, in asynchronous distributed systems. A Failure Detector is an independent module that detects and reports crashes of other processes. There are some of advantages in rewriting the Token-based ME algorithm using a Failure Detector. We show that the Token-based ME algorithm, when using Failure Detector, is more effectively implemented than the classic Token-based ME algorithm for synchronous distributed systems.

• Journal of Digital Contents Society
• /
• v.19 no.2
• /
• pp.343-349
• /
• 2018

The proposed hybrid algorithm combines the benefits of rapid convergence property of mean filed annealing(MFA) and the effective genetic operations of simulated annealing-like genetic algorithm(SGA). This algorithm is applied to the isotropic material stock cutting problem, especially to glass cutting in distributed computing environments base on MPI called message passing interface. The glass cutting is to place the required rectangular patterns to the given large glass sheets resulting in reducing the wasted scrap area. Our experimental results show that the heuristic method improves the performance over the conventional ones by decreasing the scrap area and maximum execution time. It is also proved that the proposed distributed algorithm maintains the convergence properties of sequential one while it achieves almost linear speedup as the problem size increases.

• Journal of the Korea Society for Simulation
• /
• v.6 no.1
• /
• pp.1-13
• /
• 1997

In this paper, we present a partitioning algorithm for distributed simulation of DEVS (Discrete Event System Specification) models. To preserve concurrency inherent in models, the proposed algorithm utilizes the structural information of models. Through benchmark simulation experiments, we show that the proposed algorithm can generate good partitions.

• Proceedings of the KIEE Conference
• /
• summer
• /
• pp.301-303
• /
• 2004

This paper presents an islanding detection algorithm based on the second harmonic. When the DG(distributed Generator) was connected with utility supply, for maintenance and repair of equipment, an islanding occurred. So islanding detection algorithm must be developed for safety of human. Although the DG generating power is similar to power consumption. the proposed algorithm can detect the islanding condition very successfully.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.15 no.6
• /
• pp.440-448
• /
• 2022

Recently, due to the introduction of distributed energy resources, the optimal resource allocation problem of the power network is more and more important, and the distributed resource allocation method is required to process huge amount of data in large-scale power networks. In the optimal resource allocation problem, many studies have been conducted on the case when the supply-demand balance is satisfied due to the limitation of the generation capacity of each generator, but the studies considering the supply-demand imbalance, that total demand exceeds the maximum generation capacity, have rarely been considered. In this paper, we propose the consensus-based distributed algorithm for the optimal resource allocation of power network considering the supply-demand imbalance condition as well as the supply-demand balance condition. The proposed distributed algorithm is designed to allocate the optimal resources when the supply-demand balance condition is satisfied, and to measure the amount of required resources when the supply-demand is imbalanced. Finally, we conduct the simulations to verify the performance of the proposed algorithm.

• Journal of Korean Institute of Industrial Engineers
• /
• v.38 no.1
• /
• pp.31-40
• /
• 2012

Distributed arrival time control (DATC) is a distributed feedback control algorithm for real-time scheduling problems in dynamic operational environment. Even though DATC has provided excellent performance for dynamic scheduling problems, it can be improved by considering the following considerations. First, the original DATC heavily depends on the quality of initial solution. In this paper, well-known dispatching rules are incorporated DATC algorithm to enhance its performance. Second, DATC improves its solution with adjusting virtual arrival times of jobs to be scheduled in proportion to the gap between completion time and due date iteratively. Since this approach assigns the same weight to all gaps generated with iterations, it fails to utilize significantly more the latest information (gap) than the previous ones. To overcome this issue we consider exponential smoothing which enable to assign different weight to different gaps. Using these two consideration This paper proposes A-DATC (Advanced-DATC). We demonstrate the effectiveness of the proposed scheduling algorithm through computational results.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.8
• /
• pp.1463-1471
• /
• 2009

In this paper, a new algorithm of Integrated Volt/Var Control (IVVC) is proposed using Volt/Var control for the Distribution Automation System (DAS) based on the modeling of the distributed load and the distributed current. In the proposed, the load flow based on the modeling of the distributed load and the distributed current are estimated from constants of four terminals using the measurement of the current and power factor from a Feeder Remote Terminal Unit (FRTU). For Integrated Volt/Var Control (IVVC), the gradient method is applied to find optimal solution for tap and capacity control of OLTC (On-Load Tap Changers), SVR (Step Voltage Regulator), and SC (Shunt Condenser). What is more Volt/Var control method is proposed using moving the tie switch as well as IVVC algorithm using power utility control. In the case studies, the estimation and simulation network have been testified in Matlab Simulink.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.6
• /
• pp.1464-1480
• /
• 1997

Distributed systems offer environments for attaining high performance, fault-tolerance, information sharing, resource sharing, etc. But we cannot benefit from these potential advantages without suitable management of events/states occurring in distributed systems. These events and states can be symptoms for performance degradation, erroneous functions, suspicious activities, etc. and are subject to further analysis. To properly manage events/states, we need to be able to specify and efficiently detect these events/states. In this paper we first describe an event/state specification language and a centralized algorithm for detecting events/states specified with this language. Then we describe an algorithm for distributing an event/state detection task in a distributed system which is hierarchically organized. The algorithm consists of decomposing an event/state detection task into subtasks and allocation these subtasks to the proper nodes. We also explain a method to make the distributed detection fault-tolerant.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2030-2035
• /
• 2005

In this paper, we study the distributed coordination of a set of synchronous, anonymous, memoryless mobile robots that can freely move on a two-dimensional plane but are unable to communicate directly. Based on this model, we analyze the application problem that consists in having a group of robots form a barricade line to protect from car traffic a crowd of demonstrators parading on the street. For the sake of robustness, we privilege fully decentralized solutions to the problem. In particular, we give a self-stabilizing distributed algorithm to address the problem, in this presentation