Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Digital Object Identifier (DOI) 10.1007/s00446-004-0113-4 Distrib. Comput. (2005) 17: 191207
 

Summary: Digital Object Identifier (DOI) 10.1007/s00446-004-0113-4
Distrib. Comput. (2005) 17: 191207
Efficient low-contention asynchronous consensus with the value-oblivious
adversary scheduler
Yonatan Aumann1,
, Michael A. Bender2,
1
Department of Mathematics and Computer Science, Bar-Ilan University, Ramat-Gan, Israel (e-mail: aumann@cs.biu.ac.il)
2
Department of Computer Science, State University of New York at Stony Brook, Stony Brook, NY 11794-4400, USA
(e-mail: bender@cs.sunysb.edu)
Abstract. We consider asynchronous consensus in the
shared-memory setting. We present the first efficient low-
contention consensus algorithm for the weak-adversary-
scheduler model. The algorithm achieves consensus in
O(n log2
n) total work and O(log n) (hot-spot) contention,
both expected and with high probability. The algorithm as-
sumes the value-oblivious scheduler, which is defined in the
paper. Previous efficient consensus algorithms for weak ad-

  

Source: Aumann, Yonatan - Computer Science Department, Bar Ilan University

 

Collections: Computer Technologies and Information Sciences