download0 view154
twitter facebook

공공누리This item is licensed Korea Open Government License

Title
The Fast Bully Algorithm: For Electing a Coordinator Process in Distributed Systems
Author(s)
이석형최훈
Publication Year
2002-09-02
Abstract
Many of software in distributed systems require a special process called the coordinator or the leader. The coordinator is elected among the processes participating a particular distributed service when the service begins operation or the existing coordinator fails. The procedure of selecting the coordinator is called the election. One of the most popular election algorithms is the bully algorithm. However, this algorithm is costly because it generates O(n2) messages for n processes. Also the time delay till the completion of the election is considerably long. This paper proposes a new election algorithm called the fast bully algorithm. The algorithm is described and performance of the algorithm has been analyzed. The fast bully algorithm shows a clear performance improvement. It works with less messages, only O(n) messages, and with shorter time delay than the bully algorithm. Also the problem of having two coordinators at the same time that appears by the bully algorithm can be avoid
Journal Title
Lecture Notes of Computer Science(LNCS)
Citation Volume
2344
ISSN
0302-9743
Files in This Item:
There are no files associated with this item.
Appears in Collections:
7. KISTI 연구성과 > 학술지 발표논문
URI
https://repository.kisti.re.kr/handle/10580/13561
http://www.ndsl.kr/ndsl/search/detail/article/articleSearchResultDetail.do?cn=NART14209532
Export
RIS (EndNote)
XLS (Excel)
XML

Browse