Parallel algorithms with processor failures and delays
J. Algorithms, pp. 45-86, 1991.
parallel algorithmem total workparallel algorithmsprocessor failureprocessor stepMore(17+)
We study efficient deterministic parallel algorithms on two models: restartable fail-stop CRCW PRAMs and strongly asynchronous PRAMs. In the first model, synchronous processors are subject to arbitrary stop failures and restarts determined by an on-line adversary and involving loss of private but not shared memory; the complexity measures...More
Full Text (Upload PDF)
PPT (Upload PPT)