Abstract
In actual multicomputer networks, communications consist of hybrid traffic, a mix of short and long messages.Typically, the short messages are used to support synchronization, global combining, and multicasting where the latencies are critical to the execution time of whole parallel program. However, in normal wormhole routed networks without packetization, the presence of long messages degrades network performance of short messages dramatically, qualitatively changing network behaviour. In this paper, we extend one existing adaptive routing framework, Hierarchical Adaptive Routing (HAR) to a hybrid traffic model, to form a new simple and efficient adaptive routing framework called Hybrid-HAR. Hybrid-HAR has four important advantages. Firstly, without packetization, the impact of long messages on short messages is very small. Secondly, it supports fully adaptive routing to both short and long messages for high communication performance. Third, the implementation complexity of Hybrid-HAR is compatible to standard routing algorithms such as Dimension Order Routing. Fourth, Hybrid-HAR is applicable to a wide variety of network topologies. High level implementation and simulation studies of a Hybrid-HAR for 2D mesh networks are presented.
Ziqiang Liu died in December 1994, leaving his work to the members of his research group.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A. Agarwal. Limits on interconnection network performance. IEEE Transactions on Parallel and Distributed Systems 2(4):398–412, 1991.
R. Cypher, A. Ho, S. Konstantinidou, and P. Messina. Architectural requirements of parallel scientific applications with explicit communication. In Proceedings of the International Symposium on Computer Architecture, pages 2–13, 1993.
W. Dally and C. Seitz. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers, C-36(5):547–53, 1987.
W. J. Dally, et. al. Design and implementation of the message-driven processor. In Proceedings of the 1992 Brown/MIT Conference on Advanced Research in VLSI and Parallel Systems, T. Knight and J. Savage, eds., pages 5–25. MIT Press, 1992.
J. Duato. On the design of deadlock-free adaptive routing algorithms for multicomputers: design methodologies. In Proceedings of Parallel Architectures and Languages Europe, pages 390–405, 1991.
F. Hady. A Performance Study of Wormhole Routed Networks Through Analytical Modelling and Experimentation. PhD thesis, University of Maryland, 1993.
J. M. Hsu and P. Banerjee. Performance measurement and trace driven simulation of parallel cad and numeric applications on a hypercube multicomputer. IEEE Transactions on Parallel and Distributed Systems, 3(4):451–464, 1992.
C. R. Jesshope, P. R. Miller, and J. T. Yantchev. High performance communications in processor networks. In Proceedings of the International Symposium on Computer Architecture, pages 150–7, 1989.
P. Kermani and L. Kleinrock. Virtual cut-through: A new computer communications switching technique. Computer Networks, 3(4):267–86, 1979.
Jae Kim, Ziqiang Liu, and Andrew A. Chien. Compressionless routing: A framework for adaptive and fault-tolerant routing. In Proceedings of the International Symposium on Computer Architecture, pages 289–300, 1994.
Jae H. Kim and Andrew A. Chien. Network performance under bimodal traffic loads.To appear in the Journal of Parallel and Distributed Computing.
Z. Liu, L-E Thorelli, and H. Wu. Hsim: A hybrid sequential and parallel simulation. In Proceedings of the Information Processing, pages 372–378, 1992.
Ziqiang Liu and Andrew A. Chien. Hierarchical adaptive routing: A framework for fully adaptive and deadlock-free wormhole routing. In Sixth IEEE Symposium on Parallel and Distributed Processing, 1994.
L. Ni and C. Glass. The turn model for adaptive routing. In Proceedings of the International Symposium on Computer Architecture, pages 278–87, 1992.
Abdel-Halim Smai and Lars-Erik Thorelli. Dynamic allocation of communication bandwidth in multicomputers. In Parallel Architectures and Languages Europe, pages 677–687, 1994.
Abdel-Halim Smai and Handong Wu. Evaluation of a priority flow control scheme for multicomputer networks. In Euromicro Workshop on Parallel and Distributed Processing, pages 111–116, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, Z. (1995). Hierarchical adaptive routing under hybrid traffic load. In: Haridi, S., Ali, K., Magnusson, P. (eds) EURO-PAR '95 Parallel Processing. Euro-Par 1995. Lecture Notes in Computer Science, vol 966. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020467
Download citation
DOI: https://doi.org/10.1007/BFb0020467
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60247-7
Online ISBN: 978-3-540-44769-6
eBook Packages: Springer Book Archive