scientific article; zbMATH DE number 432838

MaRDI QIDQ3138972zbMATH OpenFDO

Authors Nir Shavit, Heather Woll, Michael Saks

Publication date 20 October 1993

zbMATH Keywords

consensus algorithmdistributed systemsresilient algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Cited in

(13)

• Anonymous obstruction-free (n,k)-set agreement with n-k+1 atomic read/write registers
• A tight analysis and near-optimal instances of the algorithm of Anderson and Woll
• Randomized consensus in expected \(O(n ^{2})\) total work using single-writer registers
• Dynamic load balancing with group communication
• Communication-efficient randomized consensus
• Randomized two-process wait-free test-and-set
• Cooperative computing with fragmentable and mergeable groups
• Combining shared-coin algorithms
• Meeting the deadline: on the complexity of fault-tolerant continuous gossip
• Randomized protocols for asynchronous consensus
• The epigenetic consensus problem
• Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler
• Doing-it-all with bounded work and communication

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138972)