• Title, Summary, Keyword: distributed algorithm

Search Result 1,756, Processing Time 0.046 seconds

An Election Algorithm with Failure Detectors in Distributed Systems (분산 시스템에서 고장 추적 장치를 이용한 선출 알고리즘)

  • Park, Sung-Hoon
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.2
    • /
    • pp.9-17
    • /
    • 2008
  • Tn this paper, we design and analyze an election algorithm, based on the Bully algorithm, in synchronous distributed systems. We show that the Bully algorithm, when using Failure Detector, is more effectively implemented than the classic Bully algorithm for synchronous distributed systems.

A Distributed Algorithmfor Weighted Shortest Path Problem (최단경로문제를 해결하는 효율적인 분산 알고리즘)

  • Park, Jeong-Ho;Park, Yun-Yong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.1
    • /
    • pp.42-48
    • /
    • 1999
  • Consider the situation that informations necessary to solve a certain problem are distributed among processors on a network. It is called a distributed algorithm that in this situation each processor exchanges the message with adjacent processors to solve the problems. This paper proposes a distributed algorithm to solve the problem that constructs the weighted shortest path tree in an asynchronous network system. In general, a distributed algorithm is estimated by the number of messages(message complexity of the distributed algorithm proposed in this paper are O(n53) and O(nln) respectively. where n is the number of processors on the network.

  • PDF

A Study On the Development of Process Coordination Algorithm in Distributed System (분산 시스템에서 프로세스 협동 알고리듬의 개발에 관한 연구)

  • Koo, Yong-Wan
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.1
    • /
    • pp.20-29
    • /
    • 1990
  • In this paper, we propose the \ulcorner/G algorithm that is an efficient distributed process coordination algorithm. It controls mutually exclusive access to a shared resource in a distributed system. We show that the \ulcorner/G algorithm satisfies the properties of distributed systems. In performnace, the algorithm is more efficient than existing algorithms because it sends only 3(K-1)/G meassages.

  • PDF

Distributed/parallel Algorithm Simulator (분산 및 병렬 알고리즘 시뮬레이터)

  • ;R.S.Ramakrishna
    • Proceedings of the Korean Information Science Society Conference
    • /
    • /
    • pp.777-779
    • /
    • 1999
  • A new distributed/parallel algorithm simulator, DASim(Distributed Algorithm Simulator), is proposed in this paper. The idea is to ease the task of design, analysis and implementation of distributed algorithms. A small high level language has been proposed for the purpose. Through this non-language specific high level language, the users are spared from the tedious details about how to program distributed or parallel algorithms. Further, visualization of these algorithms are pretty helpful to understand behaviors of these algorithms.

  • PDF

The Development of Boiler Fuel Control Algorithm and Distributed Control System for Coal-Fired Power Plant (석탄화력발전소 보일러 연료제어 알고리즘과 분산제어시스템의 개발)

  • Lim, Gun-Pyo;Lee, Heung-Ho
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.62 no.1
    • /
    • pp.36-44
    • /
    • 2013
  • This paper is written for the development and application of boiler fuel control algorithm and distributed control system of coal-fired power plant by the steps of design, coding, simulation test, site installation and site commissioning test. Fuel control algorithm has the upper algorithm and it is boiler master control algorithm that controls the fuel, feed water, air by generation output demand. Generation output demand by power load influences fuel control. Because fuel can not be supplied fast to the furnace of boiler, fuel control algorithm was designed adequately to control the steam temperature and to prevent the explosion of boiler. This control algorithms were coded to the control programs of distributed control systems which were developed domestically for the first time. Simulator for coal-fired power plant was used in the test step. After all of distributed control systems were connected to the simulator, the tests of the actual power plant were performed successfully. The reliability was obtained enough to be installed at the actual power plant and all of distributed control systems had been installed at power plant and all signals were connected mutually. Tests for reliability and safety of plant operation were completed successfully and power plant is being operated commercially. It is expected that the project result will contribute to the safe operation of domestic new and retrofit power plants, the self-reliance of coal-fired power plant control technique and overseas business for power plant.

Distributed Mean Field Genetic Algorithm for Channel Routing (채널배선 문제에 대한 분산 평균장 유전자 알고리즘)

  • Hong, Chul-Eui
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.2
    • /
    • pp.287-295
    • /
    • 2010
  • In this paper, we introduce a novel approach to optimization algorithm which is a distributed Mean field Genetic algorithm (MGA) implemented in MPI(Message Passing Interface) environments. Distributed MGA is a hybrid algorithm of Mean Field Annealing(MFA) and Simulated annealing-like Genetic Algorithm(SGA). The proposed distributed MGA combines the benefit of rapid convergence property of MFA and the effective genetic operations of SGA. The proposed distributed MGA is applied to the channel routing problem, which is an important issue in the automatic layout design of VLSI circuits. Our experimental results show that the composition of heuristic methods improves the performance over GA alone in terms of mean execution time. It is also proved that the proposed distributed algorithm maintains the convergence properties of sequential algorithm while it achieves almost linear speedup as the problem size increases.

Distributed Power Control and Removal Algorithms for Multimedia CDMA Wireless Networks

  • Wang, Jui-Teng
    • Journal of Communications and Networks
    • /
    • v.5 no.3
    • /
    • pp.197-201
    • /
    • 2003
  • We study in this paper both distributed power control and removal algorithms for multimedia CDMA wireless networks. In our study, users can have different data rates as well as different quality of service (QoS) requirements. We derive a necessary and sufficient condition for the fully distributed power control (FDPC) algorithm to find a feasible power set. We also prove that, if the maximal power level is used at the start, then the distributed constrained power control (DCPC) algorithm is equivalent to the FDPC algorithm. For the connection removal algorithm, we prove that the non-reinitialized removal algorithm finds a feasible power set faster and employs smaller power levels than the reinitialized one does. Performances of some connection removal criteria are also studied. Our simulation results reveal that the smallest normalized CIR (SNC) and largest CIR requirement (LCR) criteria result in smaller outage probability than the smallest CIR (SC) criterion in a multimedia environment.

Design and Specification of an Election Algorithm in Mobile Ad Hoc Distributed Systems (모바일 애드 혹 분산 시스템에서 선출 알고리즘의 명세 및 설계)

  • Park, Sung-Hoon
    • Journal of Digital Contents Society
    • /
    • v.11 no.4
    • /
    • pp.453-461
    • /
    • 2010
  • Specifying and designing the election algorithm in mobile ad hoc distributed systems is very difficult task. It is because mobile ad hoc systems are more prone to failures than conventional distributed systems. The aim of this paper is to propose a specification and design of the election algorithm in a specific ad hoc mobile computing environment. For this aim, we specify and design an election algorithm in this paper. In addition, we formally verify it and show that it is correct. This solution is based on the nodes detection algorithm that is a classical one for synchronous distributed systems.

Global Optimization for Energy Efficient Resource Management by Game Based Distributed Learning in Internet of Things

  • Ju, ChunHua;Shao, Qi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.10
    • /
    • pp.3771-3788
    • /
    • 2015
  • This paper studies the distributed energy efficient resource management in the Internet of Things (IoT). Wireless communication networks support the IoT without limitation of distance and location, which significantly impels its development. We study the communication channel and energy management in the wireless communication network supported IoT to improve the ability of connection, communication, share and collaboration, by using the game theory and distributed learning algorithm. First, we formulate an energy efficient neighbor collaborative game model and prove that the proposed game is an exact potential game. Second, we design a distributed energy efficient channel selection learning algorithm to obtain the global optimum in a distributed manner. We prove that the proposed algorithm will asymptotically converge to the global optimum with geometric speed. Finally, we make the simulations to verify the theoretic analysis and the performance of proposed algorithm.

Design and Implementation of Distributed Mutual Exclusion Lock Counter Algorithm (분산 상호 배제 카운트 알고리즘을 이용한 클라이언트 사용자 구분 시스템 개발)

  • Jang, Seung-Ju
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.4
    • /
    • pp.1227-1235
    • /
    • 2000
  • In this paper, we propose new concepts that the distributed counter value with the distributed EC system identify each user who users the distributed system. The web user should register his/her own user ID in the cyber shopping mall system. Instead of registration, this paper proposes the proprietary mechanism that is distributing counter. The counter assigns the distinguished number to each client. The distributed lock algorithm is used for mutual assignment of the counter to each client. The proposed algorithm is the best solution in the distributed environment system such as cyber shopping mall. If a user should register his/her own ID in every EC system, he/she may not try to use these uncomfortable systems. The mutual counter is used to identify each client. All of these features are designed and implemented on Windows NT web server. Also these features were experiments with 5 clients for 300 times. According to the experiments, clients have their own mutual counter value. The proposed algorithm will be more efficient in internet application environment. Moreover, it will improve the number of internet users.

  • PDF