Efficient execution of nondeterministic parallel programs on asynchronous systems
From MaRDI portal
Publication:1383149
DOI10.1006/INCO.1997.2653zbMATH Open0892.68018OpenAlexW2057933312MaRDI QIDQ1383149FDOQ1383149
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
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
- Impossibility of distributed consensus with one faulty process
- On the minimal synchronism needed for distributed consensus
- Parallelism in random access machines
- Fast randomized consensus using shared memory
- Polylog randomized wait-free consensus
- Efficient parallel algorithms can be made robust
- Time- and Space-Efficient Randomized Consensus
- Clock construction in fully asynchronous parallel systems and PRAM simulation
- The expected advantage of asynchrony
- Title not available (Why is that?)
- Efficient parallel algorithms on restartable fail-stop processors
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
