Relations between Concurrent-Write Models of Parallel Computation
- 1 June 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 17 (3) , 606-627
- https://doi.org/10.1137/0217037
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Simulations among concurrent-write PRAMsAlgorithmica, 1988
- The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$SIAM Journal on Discrete Mathematics, 1988
- Simultaneous WRITES of parallel random access machines do not help to compute simple arithmetic functionsJournal of the ACM, 1987
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous WritesSIAM Journal on Computing, 1986
- A complexity theory for unbounded fan-in parallelismPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- A universal interconnection pattern for parallel computersJournal of the ACM, 1982
- Parallel computation and conflicts in memory accessInformation Processing Letters, 1982
- Finding the maximum, merging, and sorting in a parallel computation modelJournal of Algorithms, 1981
- Parallelism in random access machinesPublished by Association for Computing Machinery (ACM) ,1978
- Realizing Boolean functions on disjoint sets of variablesTheoretical Computer Science, 1976