Orthogonal Graphs for the Construction of a Class of Interconnection Networks

A graph theoretical representation for a class of interconnection networks is suggested. The idea is based on a definition of orthogonal binary vectors and leads to a construction rule for a class of orthogonal graphs. An orthogonal graph is first defined as a set of 2/sup m/ nodes, which in turn are linked by 2/sup m-n/ edges for every link model defined in an integer set Q*. The degree and diameter of an orthogonal graph are determined in terms of the parameters n, m, and the number of link modes defined in Q*. Routing in orthogonal graphs is shown to reduce to the node covering problem in bipartite graphs. The proposed theory is applied to describe a number of well-known interconnection networks such as the binary m-cube and spanning-bus meshes. Multidimensional access (MDA) memories are also shown as examples of orthogonal shared memory multiprocessing systems. Finally, orthogonal graphs are applied to the construction of multistage interconnection networks. Connectivity and placement rules are given and shown to yield a number of well-known networks. >

[1]  Frank Harary,et al.  Graph Theory , 2016 .

[2]  Howard Jay Siegel,et al.  Study of multistage SIMD interconnection networks , 1978, ISCA '78.

[3]  Tse-Yun Feng.  Data Manipulating Functions in Parallel Processors and Their Implementations , 1974, IEEE Transactions on Computers.

[4]  Ralph P. Grimaldi.  Discrete and Combinatoral Mathematics: An Applied Introduction 2nd Ed. , 1989 .

[5]  Marshall C. Pease,et al.  The Indirect Binary n-Cube Microprocessor Array , 1977, IEEE Transactions on Computers.

[6]  Kevin P. McAuliffe,et al.  The IBM Research Parallel Processor Prototype (RP3): Introduction and Architecture , 1985, ICPP.

[7]  Kai Hwang,et al.  An Orthogonal Multiprocessor for Parallel Scientific Computations , 1989, IEEE Trans. Computers.

[8]  Douglas Stott Parker,et al.  Notes on Shuffle/Exchange-Type Switching Networks , 1980, IEEE Transactions on Computers.

[9]  Howard Jay Siegel,et al.  Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.) , 1985 .

[10]  Ralph P. Grimaldi,et al.  Discrete and combinatorial mathematics , 1985 .

[11]  Willard Van Orman Quine,et al.  A Way to Simplify Truth Functions , 1955 .

[12]  S. N. Maheshwari,et al.  Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees , 1983, IEEE Transactions on Computers.

[13]  Tse-Yun Feng,et al.  The Universality of the Shuffle-Exchange Network , 1981, IEEE Transactions on Computers.

[14]  Larry D. Wittie,et al.  Communication Structures for Large Networks of Microcomputers , 1981, IEEE Transactions on Computers.

[15]  Hans Jürgen Halin,et al.  The ETH-Multiprocessor Empress: A Dynamically Configurable MIMD System , 1982, IEEE Transactions on Computers.

[16]  Howard Jay Siegel.  The Theory Underlying the Partitioning of Permutation Networks , 1980, IEEE Transactions on Computers.

[17]  Willard Van Orman Quine,et al.  The Problem of Simplifying Truth Functions , 1952 .

[18]  TOMAS LANG,et al.  A Shuffle-Exchange Network with Simplified Control , 1976, IEEE Transactions on Computers.

[19]  E. McCluskey.  Minimization of Boolean functions , 1956 .

[20]  Kenneth E. Batcher,et al.  Design of a Massively Parallel Processor , 1980, IEEE Transactions on Computers.

[21]  Yiming Ma,et al.  Vector computations on an orthogonal memory access multiprocessing system , 1987, 1987 IEEE 8th Symposium on Computer Arithmetic (ARITH).

[22]  Edward A. Feigenbaum,et al.  Switching and Finite Automata Theory: Computer Science Series , 1990 .

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

[24]  Isaac D. Scherson,et al.  Definition and analysis of a class of spanning bus orthogonal multiprocessing systems , 1990, CSC '90.

[25]  J. Taylor,et al.  Switching and finite automata theory, 2nd ed. , 1980, Proceedings of the IEEE.

[26]  Charles L. Seitz,et al.  The cosmic cube , 1985, CACM.

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

[28]  Yiming Ma,et al.  Two Nearly Optimal Sorting Algorithms for Mesh-Connected Processor Arrays Using Shear-Sort , 1989, J. Parallel Distributed Comput..

[29]  Tse-Yun Feng,et al.  On a Class of Multistage Interconnection Networks , 1980, IEEE Transactions on Computers.

[30]  Dhiraj K. Pradhan,et al.  A Uniform Representation of Single-and Multistage Interconnection Networks Used in SIMD Machines , 1980, IEEE Transactions on Computers.

[31]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.

[32]  Tomás Lang,et al.  Interconnections Between Processors and Memory Modules Using the Shuffle-Exchange Network , 1976, IEEE Transactions on Computers.

[33]  Viktor K. Prasanna,et al.  A VLSI-Based Multiprocessor Architecture for Implementing Parallel Algorithms , 1985, International Conference on Parallel Processing.

[34]  Dharma P. Agrawal,et al.  Generalized Hypercube and Hyperbus Structures for a Computer Network , 1984, IEEE Transactions on Computers.

[35]  Isaac D. Scherson,et al.  Parallel Sorting in Two-Dimensional VLSI Models of Computation , 1989, IEEE Trans. Computers.

[36]  Kai Hwang,et al.  Generalization of orthogonal multiprocessor for massively parallel computation , 1988, Proceedings., 2nd Symposium on the Frontiers of Massively Parallel Computation.

[37]  H. M. Alnuweiri,et al.  Optimal image computations on reduced VLSI architectures , 1989 .

[38]  Robert J. McMillen,et al.  The Multistage Cube: A Versatile Interconnection Network , 1981, Computer.

[39]  Tomás Lang,et al.  An analytical characterization of generalized shuffle-exchange networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[40]  Ralph Grishman,et al.  The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer , 1983, IEEE Transactions on Computers.

[41]  Gérard Memmi,et al.  Some New Results About the (d, k) Graph Problem , 1982, IEEE Transactions on Computers.

[42]  David A. Padua,et al.  Interconnection Networks Using Shuffles , 1981, Computer.

[43]  Kenneth E. Batcher.  The Multidimensional Access Memory in STARAN , 1977, IEEE Transactions on Computers.

[44]  Yiming Ma,et al.  Analysis and Applications of the Orthogonal Access Multiprocessor , 1989, J. Parallel Distributed Comput..