Quotient Networks

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.

[1]  Howard Jay Siegel,et al.  Analysis Techniques for SIMD Machine Interconnection Networks and the Effects of Processor Address Masks , 1977, IEEE Transactions on Computers.

[2]  Jon Louis Bentley,et al.  Multidimensional Binary Search Trees in Database Applications , 1979, IEEE Transactions on Software Engineering.

[3]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[4]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[5]  Jack L. Rosenfeld,et al.  A case study in programming for parallel-processors , 1969, CACM.

[6]  Marvin H. Solomon,et al.  The Lens Interconnection Strategy , 1981, IEEE Transactions on Computers.

[7]  Marshall C. Pease,et al.  An Adaptation of the Fast Fourier Transform for Parallel Processing , 1968, JACM.

[8]  H. T. Kung,et al.  Systolic Arrays for (VLSI). , 1978 .

[9]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1977, CACM.

[10]  John Philip Fishburn.  Analysis of speedup in distributed algorithms , 1984 .

[11]  Gérard M. Baudet,et al.  Optimal Sorting Algorithms for Parallel Computers , 1978, IEEE Transactions on Computers.

[12]  H. T. Kung,et al.  A tree machine for searching problems , 1979 .

[13]  Gérard M. Baudet,et al.  Asynchronous Iterative Methods for Multiprocessors , 1978, JACM.

[14]  Ahmed Sameh,et al.  The Illiac IV system , 1972 .