Efficient execution of nondeterministic parallel programs on asynchronous systems

DOI10.1006/inco.1997.2653zbMath0892.68018OpenAlexW2057933312MaRDI QIDQ1383149

Yonatan Aumann, Lisa Zhang, Michael A. Bender

Publication date: 27 July 1998

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1997.2653

zbMATH Keywords

asynchronous execution of parallel programsautomatic execution scheme

Mathematics Subject Classification ID

Theory of software (68N99)

Related Items (2)

Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler ⋮ A tight analysis and near-optimal instances of the algorithm of Anderson and Woll

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient parallel algorithms can be made robust
• Clock construction in fully asynchronous parallel systems and PRAM simulation
• The expected advantage of asynchrony
• Polylog randomized wait-free consensus
• Fast randomized consensus using shared memory
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• Time- and Space-Efficient Randomized Consensus
• Efficient parallel algorithms on restartable fail-stop processors
• Parallelism in random access machines

This page was built for publication: Efficient execution of nondeterministic parallel programs on asynchronous systems