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 with Infinite Arrivals James Aspnes
 

Summary: Wait-Free Consensus with Infinite Arrivals
James Aspnes
aspnes@cs.yale.edu
Gauri Shah
gauri.shah@yale.edu
Jatin Shah
jatin.shah@yale.edu
Department of Computer Science
Yale University
New Haven, CT 06520-8285, USA
ABSTRACT
A randomized algorithm is given that solves the wait-free
consensus problem for a shared-memory model with infinitely
many processes. The algorithm is based on a weak shared
coin algorithm that uses weighted voting to achieve a major-
ity outcome with at least constant probability that cannot
be disguised even if a strong adversary is allowed to destroy
infinitely many votes. The number of operations performed
by process i is a polynomial function of i. Additional al-
gorithms are given for solving consensus more efficiently in

  

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

 

Collections: Computer Technologies and Information Sciences