This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
High-Performance Self-Routing Algorithm for Multiprocessor Systems with Shuffle Interconnections
January 2006 (vol. 17 no. 1)
pp. 38-50

Abstract—This paper proposes a routing algorithm for the interconnection of multiple processors based on the shortest-path and deflection-routing principles. The routing algorithm, named SPDRA (Shortest Path and Deflection Routing Algorithm), is applied to multiprocessor systems with a single-stage shuffle physical topology. SPDRA is general-purpose, as opposed to the majority of routing algorithms for multiprocessor systems which are optimized for particular traffic patterns generated by a restricted class of parallel algorithms. The general-purpose nature of SPDRA allows perfomance comparisons with a wide class of routing algorithms for multiprocessor systems that, similar to the single-stage shuffle physical topology, have a fixed node-to-processor ratio. The paper compares SPDRA with hypercube algorithms for bidimensional meshes and torus physical topologies, routing algorithms for hierarchical tridimensional tori, and algorithms for routing permutations in shuffle networks, which constitute the most widely accepted approaches for multiprocessor interconnection. SPDRA exhibits a performance advantage for a broad range of network sizes and, in general, the performance advantage grows as the number of processors increases. However, this paper compares the SPDRA algorithm against a limited set of multiprocessor systems and does not demonstrate a general superiority of SPDRA over all systems with a fixed node-to-processor ratio and, especially, with a growing node-to-processor ratio, such as multistage networks.

[1] The Infiniband Trade Association, InfiniBand Architecture Specification 1.0, http:/www.infinibandta.com, Oct. 2000.
[2] W.C. Athas and C.L. Seitz, “Multicomputers: Message-Passing Concurrent Computers,” Computer, vol. 21, no. 8, pp. 9-24, Aug. 1988.
[3] L.D. De Cerio, M. Valero-Garcia, and A. Gonzalez, “Hypercube Algorithms on Mesh Connected Multicomputers,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 12, pp. 1247-1260, Dec. 2002.
[4] S. Young-Joo and K.G. Shin, “All-to-All Personalized Communication in Multidimensional Torus and Mesh Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 1, pp. 38-59, Jan. 2001.
[5] M.M.H. Raman and S. Horiguchi, “HTN: A New Hierarchical Interconnection Network for Massively Parallel Computers,” IEICE Trans. Information and Systems, special issue on parallel and distributed computing, applications and technology, vol. E86-D, no. 9, pp. 1479-1486, Sept. 2003.
[6] Y. Yang and J. Wang, “Routing Permutations with Link-Disjoint and Node-Disjoint Paths in a Class of Self-Routable Interconnects,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 4, pp. 383-393, Apr. 2003.
[7] H.S. Stone, “Parallel Processing with the Perfect Shuffle,” IEEE Trans. Computers, vol. 20, no. 2, pp. 153-161, Feb. 1971.
[8] C.L. Wu and T.J. Feng, “On a Class of Multistage Interconnection Networks,” IEEE Trans. Computers, vol. 29, no. 8, pp. 694-702, Aug. 1980.
[9] V.E. Benes, “Optimal Rearrangeable Multistage Connecting Networks,” The Bell Technical System J., vol. 43, pp. 694-702, Aug. 1964.
[10] C. Clos, “A Study of Nonblocking Switching Networks,” The Bell Technical System J., vol. 41, 1953.
[11] S. Bassi, M. Decina, P. Giacomazzi, and A. Pattavina, ”Multistage Shuffle Networks with Shortest Path and Deflection Routing for High Performance ATM Switching: The Open-Loop Shuffleout,” IEEE Trans. Comm., vol. 42, no. 10, pp. 2881-2889, Oct. 1994.
[12] N.S. Sundar, D.N. Jayasimha, D.K. Panda, and P. Sadayappan, “Hybrid Algorithms for Complete Exchange in 2D Meshes,” Proc. ACM Int'l Conf. Supercomputing, pp. 181-188, 1996.
[13] S. Takkella and S. Seidel, “Complete Exchange and Broadcast Algorithms for Meshes,” Proc. IEEE Scalable High Performance Computing Conf., pp. 422-428, 1994.
[14] V.K. Jain, T. Ghirmai, and S. Horiguchi, ”TESH: A New Hierarchical Interconnection Network for Massively Parallel Computing,” IEICE Trans. Information and Systems, special issue on parallel and distributed computing, applications and technology, vol. E80-D, no. 9, pp. 837-846, Sept. 1997.
[15] C. Francalanci and P. Giacomazzi, “The Complete Analytical Model of SPDRA,” http://www.elet.polimi.it/upload/giacomaz/ specialcontents/additionalmaterial spdra_analysis.pdf, 2004.
[16] F.K. Hwang and W.-D. Lin, “A General Construction for Nonblocking Crosstalk-Free Photonic Switching Networks,” Proc. Int'l Conf. Parallel Processing Workshops, pp. 297-301, Sept. 2001.

Index Terms:
Multiprocessor systems, shuffle interconnection, self routing.
Citation:
Chiara Francalanci, Paolo Giacomazzi, "High-Performance Self-Routing Algorithm for Multiprocessor Systems with Shuffle Interconnections," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 1, pp. 38-50, Jan. 2006, doi:10.1109/TPDS.2006.11
Usage of this product signifies your acceptance of the Terms of Use.