Abstract
In this paper, we present a general methodology for the improvement of the criteria of a given routing scheme. We study particularly the correlation between deadlock-avoidance and paths' stretch factor [28]. We prove that the methodology preserves deadlock-avoidance. As the methodology starts from a primary communication scheme, we choose routing by Eulerian cycle rules [27] as the primary scheme. To validate the methodology, we apply the resulting routing scheme to the torus network. Then, making a judicious choice with regard to certain parameters, we prove that the result is an adaptive, deadlock-free, minimal and storage efficient routing algorithm for such networks.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H.R. Arabnia and S.M. Bhandarkar. Parallel stereocorrelation on a recofigurable multi-ring network. The Journal of Supercomputing (Kluwer Academic Publishers), Special issue on Parallel and Distributed Processing (Guest Editor: H.R. Arabnia) Vol. 10(3), pp. 243-270 1996.
A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, 1974.
J. Annot and R. Van Twist. A novel deadlock free and starvation free packet switching communication processor. LNCS 258, (pp. 68-85), June 1987.
C. Berge. Théorie des Graphes. Gauthier-Villars, 1983.
R. Cypher and L. Gravano. Storage-efficient, deadlock-free packet routing algorithms for torus networks. IEEE Transactions on Computers, 43(12), 1994.
C. Chan and T. Yum. An algorithm for detecting and resolving store and forward deadlocks in packet-switching networks. IEEE Transactions on Communications, 35(8), 1987.
J. Dally. Performance analysis of k-ary n-cube interconnection networks. IEEE Transactions on Computers, 39(6), 1990.
W. Dally and C. Seitz. The torus routing chip. Distributed Computing, 1, 1986.
W. Dally and C. Seitz. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers, cX-36(5), 1987.
J. Duato. A new theory of deadlock-free adaptive routing in wormhole networks. IEEE Transactions on Parallel and Distributed Systems, 4(12), December 1993.
E. Fleury and P. Fraigniaud. A general theory of deadlock avoidance in wormhole-routed networks. IEEE Transactions on Parallel and Distributed Systems, 9(7), pp. 626-638 1998.
D. Gelernter. A dag-based algorithm for prevention of store-and-forward dead-lock in packet networks. IEEE Transactions on Computers, C-30(10), 1981.
A. Giessler, J. Hanle, A. Koning, and A. Pade. Free buffer allocation-an investigation by simulation. Computer Networks, (2), 1978.
M. Gerla and L. Kleinrock. Flow control: A comparative survey. IEEE Transactions on Communications, 28(4), April 1980.
C.J. Glass and L.M. Ni. The turn model for adaptive routing. ACM, Com-28(4), July 1992.
I. Gopal. Prevention of store-and-forward deadlock in computer networks. IEEE Transactions on Communications, 33(12), 1985.
K. Gunter. Prevention of deadlock in packet-switched data transport systems. IEEE Transactions on Communications, 29(4), 1981.
B. Hadim. La communication multi-niveaux: facteur de régulation du rapport correction/efficacité d'un schéma de communication. Calculateurs Parallèles, Vol. 9—N. 4, 1997.
B. Hadim. Sur une methode de routage des messages dans les architectures parallèles à mémoire distribuée: Application à la grille torique. Ph.D thesis, Université de St Etienne & ENSMSE, Saint Etienne France, 1997.
B. Hadim. A minimal, deadlock-free and storage optimal routing algorithm for torus networks. International Conference on Parallel and Distributed Processing, Techniques and Applications, Las Vegas, Nevada(USA), 1999.
M.B. Hadim and A. Bouabdallah. A distributed algorithm for constructing an Eulerian cycle in networks. Proceedings of the International Conference on Parallel and Distributed Processing, Techniques and Applications, Las Vegas, Nevada(USA), 1999.
B. Hadim and I. Sakho. Minimal, deadlock free and oênë space memory routing for k-ary n-cubes with wraparound connections. International Conference on Parallel and Distributed Processing, Techniques and Applications, Athens, Georgia(USA), 1995.
Cray Research Inc. Cray T3D software overview technical note. Special Draft Edition for IEEE Supercomputing'92, 1992.
C. Jesshope, P. Miller, and J. Yantchev. High performance communication in processor networks. ACM Computer Architecture News, 17(7), 1989.
D.H. Linder and J.C. Harden. An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes. IEEE Transactions on Computers, 40(1), January 1991.
Q. Li. Minimum deadlock-free message routing restrictions in binary hypercubes. Journal of Parallel and Distributed Computing, (15), 1992.
L. Mugwaneza, T. Muntean, and I. Sakho. A deadlock free routing algorithm with network size independent buffering space. Proceedings of CONPAR90-VAPP IV, Zurich Switzerland, September 1990.
D. Peleg and E. Upfal. A trade-off between space and efficiency for routing tables. JACM, 36-3, July 1989.
A. Roscoe. Routing messages through networks: an exercise in deadlock avoidance. Workshop on Parallel Programming of Transputers Based Machines, Grenoble Sept 14-16, 1987.
I. Sakho, L. Mugwaneza, and Y. Langue. Routing with compact routing tables: Interval labelling scheme for generalized meshes. Proceedings of the IFIP WG10.3 WCAPDC, Caracas 1994.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hadim, M.B., Sakho, I. The Multi-Level Communication: Efficient Routing for Interconnection Networks. The Journal of Supercomputing 18, 153–177 (2001). https://doi.org/10.1023/A:1008160800606
Issue Date:
DOI: https://doi.org/10.1023/A:1008160800606