Asynchronous PRAMs are (almost) as good as synchronous PRAMs
- 4 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 590-599
- https://doi.org/10.1109/fscs.1990.89580
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Are wait-free algorithms fast?Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Time-and space-efficient randomized consensusPublished by Association for Computing Machinery (ACM) ,1990
- A complexity theory of efficient parallel algorithmsTheoretical Computer Science, 1990
- The expected advantage of asynchronyPublished by Association for Computing Machinery (ACM) ,1990
- Efficient robust parallel computationsPublished by Association for Computing Machinery (ACM) ,1990
- The wakeup problemPublished by Association for Computing Machinery (ACM) ,1990
- General Purpose Parallel ArchitecturesPublished by Elsevier ,1990
- Asynchronous shared memory parallel computationPublished by Association for Computing Machinery (ACM) ,1990
- A more practical PRAM modelPublished by Association for Computing Machinery (ACM) ,1989
- Efficient parallel algorithms can be made robustPublished by Association for Computing Machinery (ACM) ,1989