Efficient execution of nondeterministic parallel programs on asynchronous systems

DOI10.1006/INCO.1997.2653MaRDI QIDQ1383149zbMATH OpenOpenAlexFDO

Authors Yonatan Aumann, Michael A. Bender, Lisa Zhang

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)

Recommendations

• Non-strict execution in parallel and distributed computing
• On nondeterminism in parallel computation
• A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism
• A model of efficient asynchronous parallel algorithms on multicomputer systems
• scientific article; zbMATH DE number 5198953
• scientific article; zbMATH DE number 1091202

Cites work

• scientific article; zbMATH DE number 1256649 (Why is no real title available?)
• scientific article; zbMATH DE number 1256650 (Why is no real title available?)
• scientific article; zbMATH DE number 2102783 (Why is no real title available?)
• Clock construction in fully asynchronous parallel systems and PRAM simulation
• Efficient parallel algorithms can be made robust
• Efficient parallel algorithms on restartable fail-stop processors
• Fast randomized consensus using shared memory
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• Parallelism in random access machines
• Polylog randomized wait-free consensus
• The expected advantage of asynchrony
• Time- and Space-Efficient Randomized Consensus

Cited in

(8)

• Data structures for order-sensitive predicates in parallel nondeterministic systems
• A tight analysis and near-optimal instances of the algorithm of Anderson and Woll
• Efficient task scheduling in the parallel result-verifying solution of nonlinear systems
• Hitting Families of Schedules for Asynchronous Programs
• A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism
• Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers
• Provably efficient scheduling for languages with fine-grained parallelism
• Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383149)