On the Routing Properties of Some Star Graph, Mesh and Hypercube
Routing Algorithms
Sylvana H. Youssef (*) and Fouad B. Chedid
Department of Computer Science
Notre Dame University
P.O. Box: 72 Zouk Mikael
Zouk Mosbeh, Lebanon
ABSTRACT
The race for creating optimal and efficient routing algorithms has been the aim of many
research papers. A recent publication by Demaine and Sirinivas [9] has presented a
classification scheme to evaluate routing algorithms for multicomputers. In particular, the star
graph, mesh and hypercube have attracted the attention of many recent publications [1]-[7] and
[10]-[16].
The classification scheme [9] according to which the algorithms are rated is based on five
categories including the hardware specification, destination type, worst-case characteristics, fault
tolerance and performance [9]. The hardware specification takes care of the network’s topology
and switching techniques used for message passing including packet switching and wormhole
routing. The destination type investigates whether the algorithm uses unicast, broadcast,
multicast or conference communication. The worst-case characteristics observe deadlock,
livelock and starvation situations in the presence of high congestion and faults in the network.
Measures of the fault tolerance and performance are conducted according to several factors.
While fault tolerance requires the measurement of the fault knowledge, fault tolerance guarantee
and fault tolerance probability, performance requires knowledge of the minimality of paths,
header size and virtual channels number.
The importance of this scheme lies in its capability to improve or create new hybrid
algorithms with a better performance and efficiency.
In this paper we update the table of [9] by studying some routing algorithms for the star graph,
the mesh architecture and for the hypercube.
(*) Speaker
References
[1] S. G. Akl and P. Fragopoulou, “Edge-disjoint spanning trees on the star network with
applications to fault tolerance”, IEEE Transactions On Computers, vol. 45, pp. 174–185,
February 1996.
[2] S. G. Akl and P. Fragopoulo, “Optimal communication algorithms on star graphs using
spanning constructions”, Department of Computing and Information Science, Queen’s
University, Canada, February 1993.
[3] S. Akl and T. Wolf, “Efficient sorting on the star graph interconnection network”,
Department of Computing and Information Science, Queen’s University, Canada, September
1997.
[4] N. Bagherzadeh , N. Nassif and S. Latifi , “A routing and broadcasting scheme on faulty
star graphs”, IEEE Transactions on Computers, vol. 42, pp. 1398-1403, November 1993.
[5] N. Bagherzadeh, M. Dowd and N. Nassif, “Embedding an arbitrary binary tree into the star
graph”, IEEE Transactions on Computers, vol. 45, pp. 475 – 481, 1996.
[6] J. Bruck, R. Cypher and D. Soroker, “Embedding cube-connected cycles graphs into faulty
hypercubes”, IEEE Transactions on Computers, vol. 43, pp. 1210–1220, October 1994.
[7] M. Chen, K. G. Shin and D. D. Kandlur, “Addressing, routing, and broadcasting in hexagonal
mesh multiprocessors”, IEEE Transactions on Computers, vol. 39, pp.10–18, January 1990.
[8] E. Demaine and S. Srinivas, “A novel routing algorithm for k-ary n-cube interconnection
networks,” International Journal of High Speed Computing, vol. 8, pp. 81-92, 1996.
[9] E. Demaine and S. Srinivas, “Routing algorithms on static interconnection networks: a
classification scheme”, International Journal of Computer Systems Science and Engineering,
vol. 12, pp. 359-367, November 1997.
[10] P. Fragopoulo, S. G. Akl and H. Meijer, “Optimal communication primitives on the
generalized hypercube network”, Department of Computing and Information Science,
Queen’s University, Canada, June 1994.
[11] S. W. Graham and S. R. Seidel, “The cost of broadcasting on star graphs and k-ary
hypercubes”, IEEE Transactions on Computers, vol. 42, pp. 756 – 759, June 1993.
[12] D. A. Hoelzeman and S. Bettayeb, “On the genus of star graphs”, IEEE Transactions on
Computers, vol. 43, pp.755–759, June 1994.
[13] J. Kim and C. R. Das, “Hypercube communication delay with wormhole routing”, IEEE
Transactions on Computers, vol. 43, pp. 800–814, July 1994.
[14] A. Olson and K. G. Shin, “Fault-tolerant routing in mesh architectures”, IEEE Transactions
on Parallel and Distributed Systems, pp. 1225–1232, November 1994.
[15] S. Sur and P. K. Srimani , “A fault tolerant routing algorithm in star graph interconnection
networks”, International Conference on Parallel Processing, vol. 3, pp. 267-270, 1991.
[16] C.-C. Su and K. G. Shin, “Adaptive fault-tolerant deadlock free routing in meshes and
hypercubes”, IEEE Transactions on Computers, 1995 (in press).