Trade-Offs between Depth and Width in Parallel Computation
- 1 May 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 14 (2), 303-314
- https://doi.org/10.1137/0214024
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- A parallel-design distributed-implementation (PDDI) general-purpose computerTheoretical Computer Science, 1984
- Simulation of Parallel Random Access Machines by CircuitsSIAM Journal on Computing, 1984
- The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel ComputerIEEE Transactions on Computers, 1983
- A complexity theory for unbounded fan-in parallelismPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- An O(logn) parallel connectivity algorithmJournal of Algorithms, 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
- A unified approach to models of synchronous parallel machinesPublished by Association for Computing Machinery (ACM) ,1978
- A Survey of Parallel Machine Organization and ProgrammingACM Computing Surveys, 1977