Distributed Computing

, Volume 15, Issue 2, pp 87–96 | Cite as

An adaptive collect algorithm with applications

  • Hagit Attiya
  • Arie Fouren
  • Eli Gafni
Original article

Summary.

In a shared-memory distributed system, n independent asynchronous processes communicate by reading and writing to shared variables. An algorithm is adaptive (to total contention) if its step complexity depends only on the actual number, k, of active processes in the execution; this number is unknown in advance and may change in different executions of the algorithm. Adaptive algorithms are inherently wait-free, providing fault-tolerance in the presence of an arbitrary number of crash failures and different processes' speed.

A wait-free adaptive collect algorithm with O(k) step complexity is presented, together with its applications in wait-free adaptive alg orithms for atomic snapshots, immediate snapshots and renaming.

Keywords: Asynchronous shared-memory systems – Contention-sensitive complexity – Wait-free algorithms – Read/write registers – Atomic snapshots – Immediate snapshots – Renaming 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Hagit Attiya
    • 1
  • Arie Fouren
    • 1
  • Eli Gafni
    • 2
  1. 1.Department of Computer Science, The Technion, Haifa 32000, Israel (e-mail: {hagit,leonf}@cs.technion.ac.il) IL
  2. 2.Computer Science Department, UCLA (e-mail: eli@cs.ucla.edu) US

Personalised recommendations