Abstract
A new fully adaptive routing algorithm for irregular networks is proposed in this paper. When compared to the most relevant routing proposals for networks of workstations with irregular topology, our routing algorithm has the characteristic of avoiding the existence of packet deadlock without using virtual channels. For a 256-node network, uniform traffic, and virtual cut-through flow control, our mechanism can outperform the classic up*/down* algorithm by a factor of 10. In fact, for medium size networks, the new technique can obtain better performance than its virtual channel-based counterparts even though it has a lower hardware complexity.
This work has been supported by Spanish CICYT, project TIC98-1162-C02-01.
Chapter PDF
Similar content being viewed by others
References
J. Duato, “A necessary and sufficient condition for deadlock-free routing in cut-through and store-and-forward networks”. IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 8, pp. 841–854, August 1996.
J. Duato, A. Robles, F. Silla and R. Beivide, “A comparison of router architectures for virtual cut-through and wormhole switching in a NOW environment”, Proc. of 13th Int. Parallel Processing Symp., pp. 240–247, April 1998.
S. Konstantinidou and L. Snyder, “The Chaos Router”, IEEE Trans. on Computers, Dec. 1994.
V. Puente, R. Beivide, J. A. Gregorio, J. M. Prellezo, J. Duato and C. Izu, “ Adaptive Bubble Router: a design to improve performance in torus networks”, Proc. Of International Conf. On Parallel Processing, Japan, Sep. 1999.
M. D. Schroeder et al., “Autonet: A high-speed, self-configuring local area network using point-to-point links,” Tech. Report SRC 59, DEC, April 1990.
F. Silla, M. Malumbres, A. Robles, P. López and J. Duato, “Efficient adaptive routing in networks of workstations with irregular topology”, Proc. of the Workshop on Comm. and Arch. Support for Parallel Computing, pp. 46–60, Feb. 1997.
J. R. Jump, “YACSIM (Ver.2.1), NETSIM(Ver.1.0) Reference Manuals”, Electrical & Computer Engineering Department, RICE University, March 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ibañez, A., Puente, V., Gregorio, J.A., Beivide, R. (2001). A New Communication Mechanism for Cluster Computing. In: Sakellariou, R., Gurd, J., Freeman, L., Keane, J. (eds) Euro-Par 2001 Parallel Processing. Euro-Par 2001. Lecture Notes in Computer Science, vol 2150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44681-8_111
Download citation
DOI: https://doi.org/10.1007/3-540-44681-8_111
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42495-6
Online ISBN: 978-3-540-44681-1
eBook Packages: Springer Book Archive