Abstract
A novel routing scheme is proposed for virtual cut-through switching that attempts to combine the low routing delay of deterministic routing with the flexibility and low queuing delays of adaptive routing on k-ary n-cube networks. In this hybrid routing scheme a message is routed as soon as possible along a minimal path to its destination even though the routing choice may not be optimal. Results show that the disadvantages of making a non-optimal routing decision are offset by its speed. Two pipelined implementations of this hybrid routing mechanism are evaluated and compared to traditional deterministic and adaptive implementations. The experimental evaluations show that both hybrid implementations do indeed achieve their objectives under various types of traffic patterns.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aoyama, K., Chien, A.: The cost of adaptivity and virtual lanes in wormhole router. J. of VLSI Design 2(4) (1995)
Baran, P.: On distributed communication networks. IEEE Trans. on Commun. Systems CS-12, 1–9 (1964)
Berman, P., Gravano, L., Pifarre, G., Sanz, J.: Adaptive deadlock and livelock free routing with all minimal paths in torus networks. In: Proc. of the Symp. on Parallel Algorithms and Architectures, pp. 3–12 (1992)
Chien, A.: A cost and speed model for k-ary n-cube wormhole routers. In: IEEE Proc. of Hot Interconnects (August 1993)
Dally, W., Song, P.: Design of a self-timed VLSI multicomputer communicaton controller. In: Proc. of the Int. Conf. on Computer Design, pp. 230–240 (1987)
Dally, W.J.: Virtual-channel flow control. IEEE Trans. on Computers 3(2), 194–205 (1992)
Dally, W.J., Seitz, C.L.: The torus routing chip. J. Dist. Computing 1(3), 187–196 (1986)
Duato, J.: A new theory of deadlock-free adaptive routing in wormhole networks. IEEE Trans. on Parallel and Distributed Systems 4(12), 1320–1331 (1993)
Duato, J., Lopez, P.: Performance evaluation of adaptive routing algorithms for k-ary n-cubes. Parallel Computer Routing and Communication, 45–59 (1994)
Flaig, C.: VLSI mesh routing systems. Master’s thesis, California Institute of Tehnology (May 1987)
Fulgham, M., Snyder, L.: Integrated multi-class routing. In: Proceedings of the Workshop on Parallel Computer Routing and Communication (1997)
Glass, C.L., Ni, L.M.: The turn model for adaptive routing. In: Int. Symp. On Computer Architecture, May 1992, pp. 278–287 (1992)
Kermani, P., Kleinrock, L.: Virtual cut-through: a new computer communication switching technique. Computer Networks 3, 267–286 (1979)
Lagman, A.: Modelling, Analysis and Evaluation of Adaptive Routing Strategies. PhD thesis, Colorado State University, Computer Science Department (November 1994)
Miller, D., Najjar, W.: Empirical evaluation of deterministic and adaptive routing with constant-area routers. Parallel Architecture and Compiler Techniques (1997)
Ni, L.M., McKinley, P.K.: A survey of wormhole routing techniques in direct networks. IEEE Computer, 62–76 (1993)
Scott, S., Thorson, G.: The Cray T3E networks: Adaptive routing in a high performance 3D torus. In: Proceedings of Hot Interconnects IV (August 1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kumar, D.R., Najjar, W.A. (1999). Combining Adaptive and Deterministic Routing: Evaluation of a Hybrid Router. In: Sivasubramaniam, A., Lauria, M. (eds) Network-Based Parallel Computing. Communication, Architecture, and Applications. CANPC 1999. Lecture Notes in Computer Science, vol 1602. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10704826_11
Download citation
DOI: https://doi.org/10.1007/10704826_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65915-0
Online ISBN: 978-3-540-48869-9
eBook Packages: Springer Book Archive