Parallel Algorithms with Processor Failures and Delays

DOI10.1006/jagm.1996.0003zbMath0840.68055OpenAlexW2158446672MaRDI QIDQ4864434

Jonathan F. Buss, Paris C. Kanellakis, Alexander A. Schwarzmann, Prabhakar Ragde

Publication date: 20 February 1996

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2f92f8d6755600348d927fdf8faa6acb9f5780f6

zbMATH Keywords

complexity measure

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (8)

Efficient parallel computing with memory faults ⋮ An algorithm for the asynchronous Write-All problem based on process collision ⋮ Hundreds of impossibility results for distributed computing ⋮ The complexity of synchronous iterative Do-All with crashes ⋮ Emulating shared-memory do-all algorithms in asynchronous message-passing systems ⋮ A tight analysis and near-optimal instances of the algorithm of Anderson and Woll ⋮ The Do-All problem with Byzantine processor failures ⋮ Performing work with asynchronous processors: Message-delay-sensitive bounds

This page was built for publication: Parallel Algorithms with Processor Failures and Delays