Skip to main content
Article thumbnail
Location of Repository

A.: Comparing distributed consensus algorithms

By Péter Urbán and André Schiper

Abstract

Protocols that solve agreement problems are essential building blocks for fault tolerant distributed systems. While many protocols have been published, little has been done to analyze their performance, especially the performance of their fault tolerance mechanisms. In this paper, we compare two consensus algorithms with different communication schemes: one is centralized and the other decentralized. The elements of the simulation study form a generic methodology for evaluating consensus algorithms. The results show that the centralized algorithm performs better in some environments, in spite of the fact that the decentralized algorithm finishes in fewer communication steps. The reason is that it generates less contention. Key words: simulation tools and techniques, Java-based simulation, distributed consensus, benchmarks

Year: 2004
OAI identifier: oai:CiteSeerX.psu:10.1.1.417.4330
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://ddg.jaist.ac.jp/pub/US0... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.