Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
F.T. Leighton, Introduction to Parallel Algorithms and Architectures, Arrays Trees Hypercubes, Morgan Caufmann Publishers, San Mateo, California, 1992.
D. Nassimi and S. Sahni, A Self Routing Benes Network and Parallel Permutation Algorithms, IEEE Trans. on Computers, C-30(5):332–340, May 1981.
K.Y. Lee, On the Rearrangeability of 2log2N-1 Stage Permutation Networks, IEEE Trans. on Computers, C-34(5):412–425, May 1985.
Z. Liu and J. You, Routing Algorithms for Hypercube, Technical Report, TR90–26, 1990, Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada T6G 2H1.
R. Boppana and C.S. Raghavendra, On Self Routing in Benes and Shuffle-Exchange Networks, Proc. of the 1988 International Conference on Parallel Processing, I:196–200, Aug. 1988.
D. Nassimi and S. Sahni, Optimal BPC Permutations on a Cube Connected SIMD Computer, IEEE Trans. on Computers, C-31(4):338–341, April, 1982.
J.M. Frailong and W. Jalby and J. Lenfant, XOR-Schemes: A Flexible Data Organization in Parallel Memories, Proc. of the 1985 International Conference on Parallel Processing, 276–283, Aug. 1985.
D. Lee, A Multiple-processor Architecture for Image Processing, Ph.D Thesis, Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada, 1987.
D. Lee, On Access and Alignment of Data in a Parallel Processor, Information Processing Letters, 33(1):11–14, Oct.1989.
K. Kim and V.K.P. Kumar, Parallel Memory Systems for Image Processing, Proc. of the 1989 Conference on Computer vision and Pattern Recognition (CVPR’89), 654–659, 1989.
C.S. Raghavendra and R. Boppana, On Methods for Fast and Efficient Parallel Memory Access, Proc. of the 1990 International Conference on Parallel Processing, 76–83, Aug. 1990.
Z. Liu, X. Li, and J. You, On Storage Schemes for Parallel Array Access, Proc. of the 1992 ACM International Conference on Supercomputing, 282–291, 1992.
S. Ranka and S. Sahni, Hypercube Algorithms with Applications to Image Processing and Pattern Recognition, Springer-Verlag, New York, 1990.
R. Boppana and C.S. Raghavendra, Optimal Self-Routing of Linear-Complement Permutations in Hypercubes, Proc. of the 5th Distributed Memory Computing Conference, 800–808, April, 1990.
K. Zemoudeh and A. Sengupta, Routing Frequently Used Bijections on Hypercube, Proc. of the 5th Distributed Memory Computing Conference, 824–832, April, 1990.
J. Lenfant, Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations, IEEE Trans. on Computers, C-27(7): 637–647, July 1978.
D. Nassimi and S. Sahni, An Optimal Routing Algorithm for Mesh-connected Parallel Computers, J. ACM, 27(1)6–29, Jan. 1980.
D. Nassimi, A Fault-Tolerant Routing Algorithm for BPC Permutations on Multistage Interconnection Networks, Proc. of the 1989 International Conference on Parallel Processing, 1:278–287, Aug. 1989.
P.C. Yew and D.H. Lawrie, An Easily Controlled Network for Frequently Used Permutations, IEEE Trans. on Computers, C-30(4):296–298, April 1981.
S.T. Huang and S.K. Tripathi, Self-Routing Technique in Perfect-Shuffle Networks Using Control Tags, IEEE Trans. on Computers, C-37(2):251–256, Feb. 1988.
D. Nassimi, A Fault-Tolerant Routing Algorithm for BPC Permutations on Multistage Interconnection Networks, Proc. of the 1989 International Conference on Parallel Processing, I:278–287, Aug. 1989.
C.S. Raghavendra and M. A. Sridhar, Optimal Routing of Bit-Permutes on Hypercube Machines, Proc. of the 1990 International Conference on Parallel Processing, I:286–290, Aug. 1990.
C. Ho and S. Johnsson, Optimal Algorithms for Stable Dimension Permutations on Boolean Cubes, Proc. of the Third Conference on Hypercube Concurrent Computers and Applications, 725–736, Jan. 1988.
A. Sengupta and K. Zemoudeh, Self-Routing Algorithms for Strongly Regular Multistage Interconnection Networks, Journal of Parallel and Distributed Computing, 14(2):187–192, Feb. 1992.
Z. Liu, J. You and X. Li, Conflict-free Routing on Hypercubes, Proc. of the 1992 International Conference on Computer and Information, 153–158 (IEEE Version), May 1992.
Z. Liu, and J. You, Conflict-free Routing for BPC-permutations on Synchronous Hypercubes, Parallel Computing, 19(3):323–342, 1993.
Z. Liu and D. Zhang, Oblivious Routing for LC Permutations on Hypercubes, Parallel Computing, 25:445–460, 1999.
X. Shen, Optimal Realization of Any BPC Permutation on k-Extra-Stage Omega Networks, IEEE Trans. Computers, 44(5): 714–719, May 1995.
Q. Hu, X. Shen, and W. Liang, Optimaly Routing LC Permutations on kExtra-Stage Cube-Type Networks, IEEE Trans. on Computers. 45(1):97103, January 1996.
S. Abraham and K. Padmanabhan, Reliability of the Hypercube, Proc. of the 1988 International conference on Parallel Processing, 1:90–94, Aug.1988.
V.E. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic, Academic Press, New York, 1965.
P.Y. Chen and D.H. Lawrie and P.C. Yew and D.A. Padua, Interconnection Networks Using Shuffles, Computer, 14(12):55–63, Dec. 1981.
Q.F. Stout, Special Issue on Algorithms for Hypercube Computers --- Guest Editor’s Introduction, Journal of Parallel and Distributed Computing, 8(4):301–302, April 1990.
T. Szymanski, On the Permutation Capability of a Circuit-Switched Hypercube, Proc. of the 1989 International Conference on Parallel Processing, I:103–110, Aug. 1989.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Zhang, D., Li, X., Liu, Z. (2001). Permutation Routing for Interconnection Network. In: Data Management and Internet Computing for Image/Pattern Analysis. The International Series on Asian Studies in Computer and Information Science, vol 11. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1527-2_12
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1527-2_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5598-4
Online ISBN: 978-1-4615-1527-2
eBook Packages: Springer Book Archive