Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study

Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study Distrib. Comput. (2000) 13: 155–186 c Springer-Verlag 2000 Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study 1 2 1 Anna Pogosyants , Roberto Segala , Nancy Lynch Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, USA (e-mail: lynch@theory.lcs.mit.edu) Dipartimento di Scienze dell’Informazione, Universita` di Bologna, Piazza di Porta San Donato 5, 40127 Bologna, Italy (e-mail: segala@cs.unibo.it) Received: February 1999 / Accepted: March 2000 This paper is written in memory of Anna Pogosyants, who died in a car crash in December 1995 while working on this project for her Ph.D. dissertation. Summary. The Probabilistic I/O Automaton model of [31] 1 Introduction is used as the basis for a formal presentation and proof of the randomized consensus algorithm of Aspnes and Herlihy. The With the increasing complexity of distributed algorithms there algorithm guarantees termination within expected polynomial is an increasing need for mathematical tools for analysis. Al- time. The Aspnes-Herlihy algorithm is a rather complex algo- though there are several formalisms and tools for the analysis rithm. Processes move through asuccession of asynchronous of ordinary distributed algorithms, there are not as many pow- rounds, attempting to agree at each round. At each round, http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Distributed Computing Springer Journals

Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study

Loading next page...
 
/lp/springer-journals/verification-of-the-randomized-consensus-algorithm-of-aspnes-and-JXl4QsAxcH

References (44)

Publisher
Springer Journals
Copyright
Copyright © 2000 by Springer-Verlag Berlin Heidelberg
Subject
Computer Science; Computer Communication Networks; Computer Hardware; Computer Systems Organization and Communication Networks; Software Engineering/Programming and Operating Systems; Theory of Computation
ISSN
0178-2770
eISSN
1432-0452
DOI
10.1007/PL00008917
Publisher site
See Article on Publisher Site

Abstract

Distrib. Comput. (2000) 13: 155–186 c Springer-Verlag 2000 Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study 1 2 1 Anna Pogosyants , Roberto Segala , Nancy Lynch Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139, USA (e-mail: lynch@theory.lcs.mit.edu) Dipartimento di Scienze dell’Informazione, Universita` di Bologna, Piazza di Porta San Donato 5, 40127 Bologna, Italy (e-mail: segala@cs.unibo.it) Received: February 1999 / Accepted: March 2000 This paper is written in memory of Anna Pogosyants, who died in a car crash in December 1995 while working on this project for her Ph.D. dissertation. Summary. The Probabilistic I/O Automaton model of [31] 1 Introduction is used as the basis for a formal presentation and proof of the randomized consensus algorithm of Aspnes and Herlihy. The With the increasing complexity of distributed algorithms there algorithm guarantees termination within expected polynomial is an increasing need for mathematical tools for analysis. Al- time. The Aspnes-Herlihy algorithm is a rather complex algo- though there are several formalisms and tools for the analysis rithm. Processes move through asuccession of asynchronous of ordinary distributed algorithms, there are not as many pow- rounds, attempting to agree at each round. At each round,

Journal

Distributed ComputingSpringer Journals

Published: Jul 1, 2000

There are no references for this article.