DocumentCode
2576056
Title
Quick consensus through early disposal of faulty processes
Author
Dalui, Mamata ; Chakraborty, Bidesh ; Sikdar, Biplab K.
Author_Institution
Dept. of Comput. Sc & Tech, Bengal Eng. & Sci. Univ., Shibpur, India
fYear
2009
fDate
11-14 Oct. 2009
Firstpage
1989
Lastpage
1994
Abstract
This work reports an efficient solution for reaching agreement (consensus) among the processes of a distributed system. The better efficiency is achieved through early disposal of faulty processes while approaching for a consensus. The introduced network partitioning scheme further facilitates the progress by reducing the message exchange overhead. Simulation results establish that the proposed solution significantly reduces the message exchange complexity, in comparison to the schemes reported so far, simultaneously ensuring the fault-tolerance ability of a system as that of the known best results.
Keywords
fault tolerant computing; message passing; distributed system; early faulty process disposal; fault-tolerance ability; message exchange; network partitioning scheme; quick consensus; Computer crashes; Cybernetics; Decision making; Distributed computing; Fault tolerance; Fault tolerant systems; Protocols; USA Councils; Byzantine agreement; Consensus; Early stopping; Reaching agreement;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man and Cybernetics, 2009. SMC 2009. IEEE International Conference on
Conference_Location
San Antonio, TX
ISSN
1062-922X
Print_ISBN
978-1-4244-2793-2
Electronic_ISBN
1062-922X
Type
conf
DOI
10.1109/ICSMC.2009.5346568
Filename
5346568
Link To Document