Limits on the power of parallel random access machines with weak forms of write conflict resolution
- 1 January 1993
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 386-397
- https://doi.org/10.1007/3-540-56503-5_39
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Fast and optimal simulations between CRCW PRAMsPublished by Springer Nature ,1992
- Incomparability in parallel computationDiscrete Applied Mathematics, 1990
- Every robust CRCW PRAM can efficiently simulate a PRIORITY PRAMPublished by Association for Computing Machinery (ACM) ,1990
- On Learning Ring-Sum-ExpansionsPublished by Elsevier ,1990
- Relations between Concurrent-Write Models of Parallel ComputationSIAM Journal on Computing, 1988
- Parallel Algorithmic Techniques For Combinational ComputationAnnual Review of Computer Science, 1988
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous WritesSIAM Journal on Computing, 1986
- A universal interconnection pattern for parallel computersJournal of the ACM, 1982
- Parallel computation and conflicts in memory accessInformation Processing Letters, 1982
- Parallelism in random access machinesPublished by Association for Computing Machinery (ACM) ,1978