Presentation 2004-09-17
Synchronous Condition-Based Consensus Algorithm Adapting to Input-Vector Legality
Taisuke IZUMI, Toshimitsu MASUZAWA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper proposes a novel condition-based algorithm for the uniform consensus in synchronous systems. The proposed algorithm is adaptive in the sense that its execution time depends on actual difficulty of input vectors, legality level, which is newly formalized in this paper. On the assumption that majority of processes are correct, the algorithm terminates within min{f+2-l,t+1} rounds if ln/2, the algorithm achieves the best time complexity in almost all situations.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Distributed Algorithm / Consensus / Condition-Based Approach / Synchronous System / Fault tolerance
Paper # COMP2004-31
Date of Issue

Conference Information
Committee COMP
Conference Date 2004/9/10(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Synchronous Condition-Based Consensus Algorithm Adapting to Input-Vector Legality
Sub Title (in English)
Keyword(1) Distributed Algorithm
Keyword(2) Consensus
Keyword(3) Condition-Based Approach
Keyword(4) Synchronous System
Keyword(5) Fault tolerance
1st Author's Name Taisuke IZUMI
1st Author's Affiliation Graduate School of Information Science and Technology, Osaka University()
2nd Author's Name Toshimitsu MASUZAWA
2nd Author's Affiliation Graduate School of Information Science and Technology, Osaka University
Date 2004-09-17
Paper # COMP2004-31
Volume (vol) vol.104
Number (no) 317
Page pp.pp.-
#Pages 8
Date of Issue