R. Cypher and L. Gravano. "Storage-efficient deadlock-free packet routing algorithms for torus networks", IEEE Trans. on Computers, vol. C-43, no. 12, pp. 1376-1385, 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Adaptive Bubble Router: a Design to Improve.. - Puente, Beivide.. (1999) (1 citation) (Correct)
....on improving wormholed based routers by means of different routing and deadlock avoidance recovery strategies. Little has been done, though, for virtual cut through networks. To the best of our knowledge, few proposals, apart from our own, have considered VCT 0 s impact on network behavior ( 18] [5] [17] among others) the more close to our proposal are the Chaos router [18] which implements non minimal adaptive routing, and the minimal adaptive routing proposed by Cypher and Gravano [5] 3 The Bubble Router In this section we propose a minimal fully adaptive routing algorithm for k ary ....
.... knowledge, few proposals, apart from our own, have considered VCT 0 s impact on network behavior ( 18] 5] 17] among others) the more close to our proposal are the Chaos router [18] which implements non minimal adaptive routing, and the minimal adaptive routing proposed by Cypher and Gravano [5]. 3 The Bubble Router In this section we propose a minimal fully adaptive routing algorithm for k ary n cube networks using virtual cutthrough switching. After an informal description of this algorithm, we describe the VLSI design of the Bubble router, discussing low level issues. 2 3.1 ....
R. Cypher and L. Gravano. "Storage-efficient deadlock-free packet routing algorithms for torus networks", IEEE Trans. on Computers, vol. C-43, no. 12, pp. 1376-1385, 1994.
Minimal, Deadlock-Free Routing in Hypercubic and Arbitrary Networks - Cypher (1995) Self-citation (Cypher) (Correct)
....In particular, we study minimal and scalable routing algorithms, where an algorithm is minimal if it uses only shortest paths, and it is scalable if it uses only a constant number of buffers per node. A great deal of research has been devoted to creating efficient, deadlock free routing algorithms [1, 2, 4, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 19, 22, 23, 25, 26, 28, 29, 30], and minimal, scalable, deadlock free algorithms are known for many important networks including meshes [26] tori [7] trees [23] and hypercubes [26] 1 . However, no such algorithm is known for the de Bruijn [3, 21] or shuffle exchange [27, 21] networks (although a nonminimal, scalable, ....
.... A great deal of research has been devoted to creating efficient, deadlock free routing algorithms [1, 2, 4, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 19, 22, 23, 25, 26, 28, 29, 30] and minimal, scalable, deadlock free algorithms are known for many important networks including meshes [26] tori [7], trees [23] and hypercubes [26] 1 . However, no such algorithm is known for the de Bruijn [3, 21] or shuffle exchange [27, 21] networks (although a nonminimal, scalable, deadlock free algorithm is known for the shuffle exchange [26] These networks are known to be very powerful in a ....
R. Cypher and L. Gravano, "Storage-Efficient, Deadlock-Free Packet Routing Algorithms for Torus Networks", IEEE Trans. on Computers, vol. 43, no. 12, pp. 1376--1385, 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC