J. Yantchev and C.R. Jesshope: "Adaptive, low latency, deadlock-free packet routing for networks of processors ", IEE Proc. Pt. E, vol.36, no.3, pp.178--196 (1989).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....message routing by using the virtual channels (VCs) and a channel dependency graph[6] Many deterministic routing networks have been developed based on their theory. Yantchev and Jesshope introduced a concept of virtual networks which split a physical network into a set of independent ones[23]. They proposed a method to design an adaptive routing network by using the virtual networks. Linder and Harden generalized the adaptive routing algorithms for k ary n cubes by using the virtual networks[17] Glass and Ni proposed the turn model[13] It allows the maximum number of turns which do ....

J. Yantchev and C.R. Jesshope: "Adaptive, low latency, deadlock-free packet routing for networks of processors ", IEE Proc. Pt. E, vol.36, no.3, pp.178--196 (1989).

....Routers based on the turn model [9] restrict routing by forbidding certain turns from one dimension to another. The Zenith router [10] and planaradaptive router [11] require extra buffering as well as extra constraints on packet paths in order to prevent deadlock. Other routers [12] 13] [14], 15] 16] 17] 18] are minimal fully adaptive, in that all minimal paths are allowed, although some amount of extra buffering is required. One disadvantage of some of these algorithms [11] 15] 17] is that different buffer capacities for different nodes in the network are required, ....

J. Yantchev and C.R. Jesshope, "Adaptive, low latency, deadlock-free packet routing for networks of processors," IEE Proc., Part E, vol. 136, no. 3, pp. 178--186, May 1989.

....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, ....

J. Yantchev and C.R. Jesshope, "Adaptive, Low Latency, Deadlock-Free Packet Routing for Networks of Processors", IEE Proc., Pt. E, vol. 136, pp. 178--186, 1989.

....that the xy and e cube algorithms avoid deadlock, but it also ensures nonadaptiveness. Another popular way to avoid deadlock, and possibly to provide adaptiveness, is to add virtual channels to networks. Dally and Seitz [14] introduced the idea for nonadaptive routing, and several researchers [15, 12, 16] have extended it to adaptive routing. Adding a virtual channel to a physical channel is less expensive than adding a new physical channel, but it is not free. It involves adding buffer space and control logic to the two routers at the ends of the physical channel so that the virtual channels can ....

....direction. Therefore, to travel in a negative direction, a packet must start out in a negative direction. This suggests the negative first routing algorithm: route a packet first adaptively west and south, and then adaptively east and north. Yantchev and Jesshope propose a similar algorithm [15], but only for minimal routing. The negative first algorithm can be either minimal or nonminimal, the nonminimal version being more adaptive and fault tolerant. Example paths for the negative first algorithm are shown in Figure 10b. Theorem 4 The negative first routing algorithm is deadlock ....

J. T. Yantchev and C. R. Jesshope, "Adaptive, low latency, deadlock-free packet routing for networks of processors," in IEE Proceedings, Pt. E, vol. 136(3), pp. 178--186, May 1988.

....virtual channels [5] Virtual channels were first used to prevent deadlock and provide adaptiveness in routing, and not specifically to provide fault tolerance. Dally and Seitz [6] used virtual channels to design nonadaptive routing algorithms, which are not fault tolerant. Yantchev and Jesshope [7, 8] used virtual channels to design minimal (that is, shortest path) adaptive routing algorithms. Minimal routing algorithms are very limited in their fault tolerance because they cannot route message packets around faults when it would require increasing the path length. Dally and Aoki [9] and ....

....to use virtual channels to design routing algorithms that are fault tolerant for meshes. They order the dimensions of a mesh, create a virtual network for each pair of sequential dimensions, and allow message packets to progress from one virtual network to the next, much as other researchers [2, 8] have done. The result is a nonminimal, adaptive routing algorithm that can route a message along either of two dimensions at a time and that can tolerate at least one faulty node or channel. The advantage of Chien and Kim s routing algorithm over Linder and Harden s routing algorithm is that, ....

J. T. Yantchev and C. R. Jesshope, "Adaptive, low latency, deadlock-free packet routing for networks of processors," in IEE Proceeding, Pt. E, vol. 136(3), pp. 178--186, May 1989.

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