Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Modular Approach to Shared-Memory Consensus, with Applications to the Probabilistic-Write Model
 

Summary: A Modular Approach to Shared-Memory Consensus, with
Applications to the Probabilistic-Write Model
James Aspnes

Department of Computer Science
Yale University
New Haven, USA
aspnes@cs.yale.edu
ABSTRACT
We define two new classes of shared-memory objects: rati-
fiers, which detect agreement, and conciliators, which en-
sure agreement with some probability. We show that con-
sensus can be solved by an alternating sequence of these ob-
jects, and observe that most known randomized consensus
algorithms have this structure.
We give a deterministic m-valued ratifier for an unbounded
number of processes that uses lg m+(log log m) space and
individual work. We also give a randomized conciliator
for any number of values in the probabilistic-write model
with n processes that guarantees agreement with constant

  

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

 

Collections: Computer Technologies and Information Sciences