Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Wait-Free Consensus James Aspnes
 

Summary: Wait-Free Consensus
James Aspnes
July 24, 1992
CMU-CS-92-164
School of Computer Science
Carnegie Mellon University
Pittsburgh, PA 15213
Submitted in partial ful llment of the requirements
for the degree of Doctor of Philosophy
c 1992 James Aspnes.
This research was supported by an IBM Graduate Fellowship and an NSF Graduate
Fellowship.
Keywords: distributed algorithms, shared memory, consensus, random
walks, martingales, shared coins
Abstract
Consensus is a decision problem in which n processors, each starting with a
value not known to the others, must collectively agree on a single value. If the
initial values are equal, the processors must agree on that commonvalue; this
is the validity condition. A consensus protocol is wait-free if every proces-
sor nishes in a nite number of its own steps regardless of the relative speeds

  

Source: Aspnes, James - Department of Computer Science, Yale University

 

Collections: Computer Technologies and Information Sciences