Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers
- 1 December 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 21 (6) , 1070-1099
- https://doi.org/10.1137/0221063
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Optimal parallel algorithms for expression tree evaluation and list rankingPublished by Springer Nature ,2006
- Deterministic parallel list rankingPublished by Springer Nature ,2006
- Asynchronous PRAMs are (almost) as good as synchronous PRAMsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A bridging model for parallel computationCommunications of the ACM, 1990
- A complexity theory of efficient parallel algorithmsTheoretical Computer Science, 1990
- Parallel Algorithms for Shared-Memory MachinesPublished by Elsevier ,1990
- Simulation of Parallel Random Access Machines by CircuitsSIAM Journal on Computing, 1984
- Fail-stop processorsACM Transactions on Computer Systems, 1983
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952