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

J.F. Groote, W.H. Hesselink, S. Mauw, R. Vermeulen

Research output: Contribution to journalArticleAcademicpeer-review

33 Citations (Scopus)

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 , where (assuming and ). 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.
Original languageEnglish
Pages (from-to)75-81
JournalDistributed Computing
Volume14
Issue number2
DOIs
Publication statusPublished - 2001

Fingerprint

Dive into the research topics of 'An algorithm for the asynchronous Write-All problem based on process collision'. Together they form a unique fingerprint.

Cite this