Performing tasks on synchronous restartable message-passing processors

Distributed Computing

Volumn 14, Issue 1, 2001, Pages 49-64

  Chlebus, Bogdan S ^a   De Prisco, Roberto ^b   Shvartsman, Alex A ^b  

^a UNIVERSITY OF WARSAW   (Poland)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Distributed systems; Fault tolerance; Load balancing; Processor restarts; Work

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS;

LOAD BALANCING; MESSAGE PASSING; PROCESSOR RESTARTS; SYNCHRONOUS RESTARTABLE PROCESSORS;

PARALLEL PROCESSING SYSTEMS;

EID: 0034893155     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00008926     Document Type: Article

References (15)

1. Parallel algorithms with processor failures and delays
2. Performing tasks on restartable message-passing processors
3. Randomization helps to perform tasks on processors prone to failures
4. Time-optimal message-efficient work performance in the presence of faults
5. Performing work efficiently in the presence of faults
6. Resolving message complexity of byzantine agreement and beyond
7. Fault-tolerant broadcast and related problems
8. Controlling memory access concurrency in efficient fault-tolerant parallel algorithms
9. Efficient parallel algorithms can be made robust
10. Efficient robust parallel computations
11. A raghunathan: Efficient program transformations for resilient parallel computation via randomization
12. Work-optimal asynchronous algorithms for shared memory parallel computers
13. Fail-stop processors: An approach to designing fault-tolerant computing systems