A practical hierarchical model of parallel computation II. Binary tree and FFT algorithms
Open Access
- 1 November 1992
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 16 (3) , 233-249
- https://doi.org/10.1016/0743-7315(92)90035-l
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A practical hierarchical model of parallel computation I. The modelJournal of Parallel and Distributed Computing, 1992
- Towards an Architecture-Independent Analysis of Parallel AlgorithmsSIAM Journal on Computing, 1990
- A complexity theory of efficient parallel algorithmsTheoretical Computer Science, 1990
- Communication complexity of PRAMsTheoretical Computer Science, 1990
- On communication latency in PRAM computationsPublished by Association for Computing Machinery (ACM) ,1989
- Binary Trees and Parallel Scheduling AlgorithmsIEEE Transactions on Computers, 1983
- The cube-connected cycles: a versatile network for parallel computationCommunications of the ACM, 1981