Permutation Routing for Interconnection Network

Interconnection networks provide communication facility for parallel processing systems. In distributed memory systems, processors exchange messages through interconnection networks. In shared memory systems, processors access data from parallel memory system through interconnection networks. In order to reduce communication overhead (both hardware overhead and time overhead), interconnection networks and corresponding routing techniques have been the key issues in the research of parallel and distributed processing systems. Interconnection networks with connection complexity of O(Nlog2 N) make a good tradeoff between the cost of hardware and the delay of message transmission. This kind of networks includes multistage interconnected networks (MINs), which are referred to as dynamic networks, and hypercube, which is referred to as a kind of static or point to point connected network. Hypercube is an important network for its topological features. We will introduce some permutation routing algorithms for hypercubes. The algorithms introduced in this chapter have a common feature that they can avoid conflicts in the message transmission process. Also they are simple for their implementation.

[1]  Krishnan Padmanabhan,et al.  Reliability of the Hypercube , 1988, ICPP.

[2]  Cauligi S. Raghavendra,et al.  On Methods for Fast and Efficient Parallel Memory Access , 1990, ICPP.

[3]  D.-L. Lee,et al.  A multiple-processor architecture for image processing , 1987 .

[4]  Shing-Tsaan Huang,et al.  Self-Routing Technique in Perfect-Shuffle Networks Using Control Tags , 1988, IEEE Trans. Computers.

[5]  Viktor K. Prasanna,et al.  Parallel memory systems for image processing , 1989, Proceedings CVPR '89: IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[6]  Xiaobo Li,et al.  On storage schemes for parallel array access , 1992, ICS '92.

[7]  David Nassimi.  A Fault-Tolerant Routing Algorithm for BPC Permutations on Multistage Interconnection Networks , 1989, ICPP.

[8]  Cauligi S. Raghavendra,et al.  Optimal Routing of Bit-Permutes on Hypercube Machines , 1990, ICPP.

[9]  Xiaojun Shen.  Optimal Realization of Any BPC Permutation on K-Extra-Stage Omega Networks , 1995, IEEE Trans. Computers.

[10]  Quentin F. Stout.  Special Issue on Algorithms for Hypercube Computers. Guest Editor's Introduction , 1990, J. Parallel Distributed Comput..

[11]  Cauligi S. Raghavendra,et al.  On Self-Routing in Benes and Shuffle-Exchange Networks , 1991, IEEE Trans. Computers.

[12]  V. Benes,et al.  Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .

[13]  Sartaj Sahni,et al.  An optimal routing algorithm for mesh-connected Parallel computers , 1980, JACM.

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

[15]  Kyungsook Y. Lee.  On the Rearrangeability of 2(log2N) - 1 Stage Permutation Networks , 1985, IEEE Trans. Computers.

[16]  De-Lei Lee.  On Access and Alignment of Data in a Parallel Processor , 1989, Inf. Process. Lett..

[17]  David Wai-Lok Cheung,et al.  Oblivious routing for LC permutations on hypercubes , 1999, Parallel Comput..

[18]  Jia-Huai You,et al.  Conflict-Free Routing for BPC-Permutations on Synchronous Hupercubes , 1993, Parallel Comput..

[19]  Cauligi S. Raghavendra,et al.  Optimal Self-Routing of Linear-Complement Permutations in Hypercubes , 1990, Proceedings of the Fifth Distributed Memory Computing Conference, 1990..

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

[21]  Pen-Chung Yew,et al.  An Easily Controlled Network for Frequently Used Permutations , 1981, IEEE Transactions on Computers.

[22]  Subir Bandyopadhyay,et al.  Self-Routing Algorithms for Strongly Regular Multistage Interconnection Networks , 1992, J. Parallel Distributed Comput..

[23]  William Jalby,et al.  XOR-Schemes: A Flexible Data Organization in Parallel Memories , 1985, ICPP.

[24]  Ted H. Szymanski,et al.  On the Permutation Capability of a Circuit-Switched Hypercube , 1989, International Conference on Parallel Processing.

[25]  Sajal K. Das,et al.  Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.

[26]  Sartaj Sahni,et al.  Optimal BPC Permutations on a Cube Connected SIMD Computer , 1982, IEEE Transactions on Computers.

[27]  Sartaj Sahni,et al.  Hypercube Algorithms: with Applications to Image Processing and Pattern Recognition , 1990 .

[28]  Sartaj Sahni,et al.  A Self-Routing Benes Network and Parallel Permutation Algorithms , 1981, IEEE Transactions on Computers.

[29]  L. Johnsson,et al.  Optimal algorithms for stable dimension permutations on Boolean cubes , 1988, C3P.

[30]  K. Zemoudeh,et al.  Routing Frequently Used Bijections on Hypercube , 1990, Proceedings of the Fifth Distributed Memory Computing Conference, 1990..