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

  • Authors:

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

  • Affiliations:

  • Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands and CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands;University of Groningen, P.O. Box 800, 9700 AV Groningen, The Netherlands;Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands and CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands;Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands

  • Venue:
  • Distributed Computing
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 O(NċPlog(x+1)/x)), where x N1/log(P) (assuming N = xk and P = 2k). 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.