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 l
CITATION STYLE
Izumi, T., & Masuzawa, T. (2004). Synchronous condition-based consensus adapting to input-vector legality. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3274, 16–29. https://doi.org/10.1007/978-3-540-30186-8_2
Mendeley helps you to discover research relevant for your work.