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

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

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

33 Citaten (Scopus)

Samenvatting

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.
Originele taal-2Engels
Pagina's (van-tot)75-81
TijdschriftDistributed Computing
Volume14
Nummer van het tijdschrift2
DOI's
StatusGepubliceerd - 2001

Vingerafdruk

Duik in de onderzoeksthema's van 'An algorithm for the asynchronous Write-All problem based on process collision'. Samen vormen ze een unieke vingerafdruk.

Citeer dit