Ultracomputers
- 1 October 1980
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 2 (4) , 484-521
- https://doi.org/10.1145/357114.357116
Abstract
A class of parallel processors potentially involving thousands of individual processing elements is described. The architecture is based on the perfect shuffle connection and has two favorable characteristics: (1) Each processor communicates with a fixed number of other processors. (2) Important communication functions can be accomplished in time proportional to the logarithm of the number of processors. A number of basic algorithms for these “ultracomputers” are presented, and physical design considerations are discussed in a preliminary fashion.Keywords
This publication has 101 references indexed in Scilit:
- Fast parallel sorting algorithmsCommunications of the ACM, 1978
- An improved parallel processor bound in fast matrix inversionInformation Processing Letters, 1978
- The Complexity of Parallel Evaluation of Linear RecurrencesJournal of the ACM, 1977
- On non‐blocking switching networksNetworks, 1971
- Structuring of Parallel AlgorithmsJournal of the ACM, 1968
- Matrix Inversion Using Parallel ProcessingJournal of the ACM, 1967
- The Organization of Computations for Uniform Recurrence EquationsJournal of the ACM, 1967
- Application of Parallel Processing to Numerical Weather PredictionJournal of the ACM, 1967
- Large Parallel ComputersJournal of the ACM, 1966
- Algorithms for Parallel-Search MemoriesJournal of the ACM, 1962