An algorithm for the asynchronous write-all problem based on process collision

Distributed Computing

Volumn 14, Issue 2, 2001, Pages 75-81

  Groote, Jan Friso ^a,b   Hesselink, Wim H ^c   Mauw, Sjouke ^a,b   Vermeulen, Rogier ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b CWI   (Netherlands)

^c UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

Distributed algorithms; Dynamic load balancing; PRAM; Wait free; Work complexity; Write all problem

Indexed keywords

ALGORITHMS; ASYNCHRONOUS TRANSFER MODE; COMPUTATIONAL COMPLEXITY; DATA HANDLING; PARALLEL PROCESSING SYSTEMS;

DISTRIBUTED ALGORITHM; DYNAMIC LOAD BALANCING; PARALLEL RANDOM ACCESS MACHINE; WORK COMPLEXITY; WRITE-ALL PROBLEM;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0035299714     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00008930     Document Type: Article

References (10)

1. Algorithms for the certified write-all problem
2. Parallel algorithms with processor failures and delays
3. Synchronization-free parallel accessible hash-tables
4. Wait-free synchronization
5. Waitfree distributed memory management by Create, and Read Until Deletion (CRUD)
6. Efficient parallel algorithms can be made robust
7. Fault-tolerance and efficiency in massively parallel algorithms
8. Combining tentative and definite executions for dependable parallel computing