Quotient Networks
- 1 April 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-31 (4), 288-295
- https://doi.org/10.1109/tc.1982.1675994
Abstract
A large-network algorithm solves a problem of size N on a network of N processors. We present a method for transforming certain large networks into quotient networks that emulate those large networks with fewer processors. Large-network algorithms are easily modified to execute on the quotient network. The emulations result in no loss in execution efficiency. Quotient networks allow algorithms to be designed assuming any number of processors and executed efficiently at a great savings in hardware cost.Keywords
This publication has 13 references indexed in Scilit:
- UltracomputersACM Transactions on Programming Languages and Systems, 1980
- Asynchronous Iterative Methods for MultiprocessorsJournal of the ACM, 1978
- Optimal Sorting Algorithms for Parallel ComputersIEEE Transactions on Computers, 1978
- Sorting on a mesh-connected parallel computerCommunications of the ACM, 1977
- Analysis Techniques for SIMD Machine Interconnection Networks and the Effects of Processor Address MasksIEEE Transactions on Computers, 1977
- The Illiac IV systemProceedings of the IEEE, 1972
- Parallel Processing with the Perfect ShuffleIEEE Transactions on Computers, 1971
- A case study in programming for parallel-processorsCommunications of the ACM, 1969
- Chaotic relaxationLinear Algebra and its Applications, 1969
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965