D. S. Parker
Abstract
The Gamma network is an interconnection network connecting N=2' inputs to N outputs. It consists of log2N stages with N switches per stage, each of which is a 3 input, 3 output crossbar. The stages are linked via “power of two” and identity connections in such a way that redundant paths exist between the input and output terminals. In this network, a path from a source to a destination may be represented using one of the redundant forms of the difference between the source and destination numbers. The redundancy in paths may thus be studied using the theory of redundant number systems. Results are obtained on the distribution of paths connecting inputs to outputs, and the permuting capabilities of the Gamma network. Switch settings for certain frequently used permutations and control mechanisms are also considered in this paper. This network has an interesting application in solving tridiagonal systems using the odd-even elimination algorithm.
- 1 A. Avizienis, "Signed-Digit Number Representations for Fast Parallel Arithmetic", IRE Trans. EC-10, 1961, pp.389-400.Google Scholar
Cross Ref
- 2 T. Feng, "Data Manipulation Functions in Parallel Processors and their Implementations", IEEE Trans. Comp., Vol. C-23, Mar 1974, pp.309-318.Google Scholar
- 3 R. W. Hockney, "A Fast Direct Solution of Poisson's Equation Using Fourier Analysis", Jour. of the ACM, Dec 1962, pp.95-113. Google ScholarDigital Library
- 4 R.H. Kuhn, "Transforming Algorithms for Single-Stage and VLSI Architecture", Workshop on Interconnection Networks for Parallel and Distributed Processing, Purdue University, April 1980.Google Scholar
- 5 H.T. Kung, C.E. Leiserson, "Systolic Arrays (for VLSI)", Tech. Rept., Carnegie-Mellon University, Dept. of Comp. Sci., Dec 1978.Google Scholar
- 6 T. Lang, H.S. Stone, "A Shuffle-Exchange Network with Simplified Control", IEEE Trans. Comp., Vol. C-25, Jan 1976, pp.55-65.Google Scholar
- 7 D.H. Lawrie, "Access and Alignment of Data in an Array Processor", IEEE Trans. Comp., Vol. C-24, Dec 1975, pp.1145-1155.Google Scholar
- 8 J. Lenfant, "Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations", IEEE Trans. Comp., Vol. C-27, July 1978, pp.637-647.Google Scholar
- 9 R.J. McMillen, H.J. Siegel, "MIMD Machine Communications Using the Augmented Data Manipulator Network", 7th Annual Symposium on Computer Architecture, May 1980, pp.51-58. Google ScholarDigital Library
- 10 D.C. Opferman, N.T. Tsao-Wu, "On a Class of Rearrangeable Switching Networks", Bell Syst. Tech. Jour., Vol. 50, May-June 1971, pp.1579-1618.Google ScholarCross Ref
- 11 D.S. Parker, "Notes on Shuffle/Exchange-Type Switching Networks", IEEE Trans. Comp., Vol. C-29, March 1980, pp.213-222.Google Scholar
- 12 D.S. Parker, C.S. Raghavendra, "The Gamma Network", in preparation.Google Scholar
- 13 M.C. Pease, "The Indirect Binary n-Cube Microprocessor Array", IEEE Trans. Comp., Vol. C-26, May 1977, pp.458-473.Google Scholar
- 14 H.J. Siegel, "Interconnection Networks for SIMD Machines", Computer, Vol. 12, June 1979, pp.57-65.Google ScholarDigital Library
- 15 S.D. Smith, H.J. Siegel, R.J. McMillen, G.B. Adams, "Use of the Augmented Data Manipulator Multistage Network for SIMD Machines," Proc. 1980 International Conf. on Parallel Processing, pp.75-78.Google Scholar
- 16 H.S. Stone, "Parallel Processing with the Perfect Shuffle", IEEE Trans. Comp., Vol. C-20, Feb 1971, pp.153-161.Google Scholar
Index Terms
- The Gamma network: A multiprocessor interconnection network with redundant paths
Recommendations
The Gamma network: A multiprocessor interconnection network with redundant paths
ISCA '82: Proceedings of the 9th annual symposium on Computer ArchitectureThe Gamma network is an interconnection network connecting N=2' inputs to N outputs. It consists of log2N stages with N switches per stage, each of which is a 3 input, 3 output crossbar. The stages are linked via “power of two” and identity connections ...
The Gamma Network
The Gamma network is an interconnection network connecting N = 2n inputs to N outputs. It is a multistage network with N switches per stage, each of which is a 3 input, 3 output crossbar. The stages are linked via "power of two" and identify connections ...
Design of 4-disjoint gamma interconnection network layouts and reliability analysis of gamma interconnection Networks
Multistage interconnection networks (MINs) are widely used for reliable data communication in a tightly coupled large-scale multiprocessor system. High reliability of MINs can be achieved using fault tolerance techniques. The fault tolerance is ...
Comments