Distributed Computing

, Volume 14, Issue 2, pp 75–81 | Cite as

An algorithm for the asynchronous Write-All problem based on process collision

  • Jan Friso Groote
  • Wim H. Hesselink
  • Sjouke Mauw
  • Rogier Vermeulen
Orignial articles

Summary.

The problem of using P processes to write a given value to all positions of a shared array of size N is called the Write-All problem. We present and analyze an asynchronous algorithm with work complexity \({\cal O}(N\cdot P^{\log(\frac{x+1}{x})})\), where \(x = N^{1/\log(P)}\) (assuming \(N=x^k\) and \(P=2^k\)). Our algorithm is a generalization of the naive two-processor algorithm where the two processes each start at one side of the array and walk towards each other until they collide.

Key words: Write-all problem – Wait-free – Distributed algorithms – Work complexity – PRAM – Dynamic load balancing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Jan Friso Groote
    • 1
  • Wim H. Hesselink
    • 3
  • Sjouke Mauw
    • 1
  • Rogier Vermeulen
    • 1
  1. 1.Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands (e-mail: sjouke@win.tue.nl) NL
  2. 2.CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands (e-mail: jfg@cwi.nl) NL
  3. 3.University of Groningen, P.O. Box 800, 9700 AV Groningen, The Netherlands (e-mail: wim@cs.rug.nl) NL

Personalised recommendations