An Adaptation of the Fast Fourier Transform for Parallel Processing
Journal of the ACM (JACM)
Asynchronous Iterative Methods for Multiprocessors
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Sorting on a mesh-connected parallel computer
Communications of the ACM
A case study in programming for parallel-processors
Communications of the ACM
Analysis of speedup in distributed algorithms
Analysis of speedup in distributed algorithms
Optimal Sorting Algorithms for Parallel Computers
IEEE Transactions on Computers
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
The Lens Interconnection Strategy
IEEE Transactions on Computers
A versatile VLSI fast Fourier transform processor
AFIPS '84 Proceedings of the July 9-12, 1984, national computer conference and exposition
European Journal of Combinatorics
Shuffling with the Illiac and PM2I SIMD Networks
IEEE Transactions on Computers
| Hi-index | 14.98 |
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.