Reconfiguration With Time Division Multiplexed MINs for Multiprocessor Communications

In this paper, time-division multiplexed multistage interconnection networks (TDM-MINs) are proposed for multiprocessor communications. Connections required by an application are partitioned into a number of subsets called mappings, such that connections in each mapping can be established in a MIN without conflict. Switch settings for establishing connections in each mapping are determined and stored in shift registers. By repeatedly changing switch settings, connections in each mapping are established for a time slot in a round-robin fashion. Thus, all connections required by an application may be established in a MIN in a time-division multiplexed way. TDM-MINs can emulate a completely connected network using N time slots. It can also emulate regular networks such as rings, meshes, Cube-Connected-Cycles (CCC), binary trees and n -dimensional hypercubes using 2, 4, 3, 4 and n time slots, respectively. The problem of partitioning an arbitrary set of requests into a minimal number of mappings is NP-hard. Simple hueristic algorithms are presented and their performances are shown to be close to optimal. The flexibility of TDM-MINs allows for the support of run time requests through dynamic reconfigurations. The techniques are especially suitable for hybrid electro-optical systems with optical interconnects.

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

[2]  D. C. Opferman,et al.  On a class of rearrangeable switching networks part I: Control algorithm , 1971 .

[3]  H. R. Ramanujam.  Decomposition of Permutation Networks , 1973, IEEE Transactions on Computers.

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

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

[6]  Kenneth E. Batcher,et al.  The flip network in staran , 1976 .

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

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

[9]  Jacques Lenfant,et al.  Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations , 1978, IEEE Transactions on Computers.

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

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

[12]  Leslie G. Valiant,et al.  A fast parallel algorithm for routing in permutation networks , 1981, IEEE Transactions on Computers.

[13]  Suchai Thanawastien,et al.  Interference Analysis of Shuffle/Exchange Networks , 1981, IEEE Transactions on Computers.

[14]  Sartaj Sahni,et al.  Parallel Algorithms to Set Up the Benes Permutation Network , 1982, IEEE Transactions on Computers.

[15]  Woei Lin,et al.  Configuring Computation Tree Topologies on a Distributed Computing System , 1983, ICPP.

[16]  Marc Snir,et al.  The Performance of Multistage Interconnection Networks for Multiprocessors , 1983, IEEE Transactions on Computers.

[17]  G. Jack Lipovski,et al.  Resource allocation in rectangular CC-banyans , 1983, ISCA '83.

[18]  Cauligi S. Raghavendra,et al.  Fault-Tolerant Multiprocessors with Redundant-Path Interconnection Networks , 1986, IEEE Transactions on Computers.

[19]  Jitender S. Deogun,et al.  A Heuristic Algorithm for Conflict Resolution Problem Multistage Interconnection Networks , 1987, ICPP.

[20]  Rami G. Melhem,et al.  Space Multiplexing of Waveguides in Optically Interconnected Multiprocessor Systems , 1989, Comput. J..

[21]  Jon R. Sauer,et al.  Multi-Gb/s optical interconnect , 1990, Photonics West - Lasers and Applications in Science and Engineering.

[22]  Rami Melhem,et al.  Array processors with pipelined optical busses , 1990, [1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation.

[23]  Harry F. Jordan,et al.  Digital fiber optic delay line memory , 1990, Photonics West - Lasers and Applications in Science and Engineering.

[24]  Arun K. Somani,et al.  On Embedding Permutations in Hypercubes , 1991, The Sixth Distributed Memory Computing Conference, 1991. Proceedings.

[25]  Zahava Koren,et al.  WDM passive star-protocols and performance analysis , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[26]  Nian-Feng Tzeng,et al.  Enhanced Hypercubes , 1991, IEEE Trans. Computers.

[27]  Abdou Youssef.  Off-line permutation scheduling on circuit-switched fixed routing networks , 1992, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation.

[28]  R. Sarnath,et al.  Proceedings of the International Conference on Parallel Processing , 1992 .

[29]  Philip J. Bernhard.  Bounds on the Performance of Message Routing Heuristics , 1993, IEEE Trans. Computers.

[30]  Rami G. Melhem,et al.  Time-Division Optical Communications in Multiprocessor Arrays , 1993, IEEE Trans. Computers.

[31]  Rami G. Melhem,et al.  Dynamic Reconfiguration of Optically Interconnected Networks with Time-Division Multiplexing , 1994, J. Parallel Distributed Comput..