D. Gelernter. A DAG-based algorithm for prevention of store-and-forward deadlock in packet networks. IEEE Transactions on Computers, C-30:709-- 715, October 1981.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of possible deadlocks. In this paper we show that there is an algorithm that takes an SCI configuration as input, and decides whether or not this configuration is prone to deadlocks. The algorithm is derived from corresponding ones from store and forward networks, and wormhole routing networks [Gel81, Gn81, MS80, DS87]. Then we present an algorithm that alters the routing functions of a configuration that is prone to deadlocks, in order to make it deadlock free. Our results indicates the following approach for configuring and reconfiguring of SCI installations: First create your configuration while considering ....

D. Gelernter. A DAG-based algorithm for prevention of store-and-forward deadlock in packet networks. IEEE Transactions on Computers, C-30:709-- 715, October 1981.

....buffers) and define routing functions on the virtual networks. The new routing functions are from virtual channel to virtual channel and define a network with no cycles. This technique is useful in both deterministic and adaptive routing systems and is based on ideas from data networks found in [20, 19]. We focus particularly on two families of networks, k ary n cubes and multi dimensional meshes (k ary n cubes without wraparounds) and assume wormhole routing [15] Dally and Seitz use virtual channels and restrict routing to implement deadlock free routing in k ary n cubes [9] However, their ....

D. Gelernter. A dag-based algorithm for prevention of store-and-forward deadlock in packet networks. IEEE Transactions on Computers, C-30(10):709--15, October 1981.

....a set of minimal paths (wasting no work) and non minimal paths (potentially wasting routing work in exchange for increased routing freedom) We focus on minimal routers because they do not waste any effort. Minimal routing schemes typically prevent deadlock by restricting the routing algorithm [2, 8, 7]. A minimal adaptive routing scheme described by Linder and Harden [9] allows fully adaptive routing while preventing deadlock. However, the hardware cost of their approach is significant, requiring a large number of virtual channels, 2 n Gamma1 . In addition, the hardware complexity of their ....

D. Gelernter. A DAG-based Algorithm for Prevention of Store-and-Forward Deadlock in Packet Networks. IEEE Transactions on Computers, C-30(10):709--15, October 1981.

....because the queues of the message system are full. Obviously, deadlocks arise because the number of resources is finite. Many deadlock free routing algorithms have been developed for store andforward computer networks. Most of them require the use of central queues, restricting buffer allocation [7, 16, 19, 21, 28, 33]. These algorithms are also applicable to virtual cut through networks with central queues. Although algorithms that use central queues require less storage than those using edge buffers, central queues can become a bottleneck. So, algorithms that use edge buffers usually achieve a higher ....

D. Gelernter, "A DAG-based algorithm for prevention of store-and-forward deadlock in packet networks," IEEE Trans. Computers, vol. C-30, pp. 709-- 715, Oct. 1981.

....buffers) and define routing functions on the virtual networks. The new routing functions are from virtual channel to virtual channel and define a network with no cycles. This technique is useful in both deterministic and adaptive routing systems and is based on ideas from data networks found in [12, 11]. We focus particularly on two families of networks, k ary n cubes and multi dimensional meshes (k ary n cubes without wraparounds) and assume cut through [13] or 1 We define network capacity as the bandwidth of all network wires being used simultaneously. Topology Deterministic Linder Harden ....

D. Gelernter. A dag-based algorithm for prevention of store-and-forward deadlock in packet networks. IEEE Transactions on Computers, C-30(10):709--15, October 1981.

....path selection in such shuffle exchange networks. A related theorem and algorithm are described in detail in Chapter 3. 2.1.3 Flow Control and Deadlock When switches have a limited amount of queues, the message flow should be controlled so as not to overflow a switch. In store and forward routing [54], a message is completely stored before it is sent to the next switch. When a message size is large, this scheme increases routing time significantly. Other approaches are wormhole routing [55] and virtual cut through [56] routing. In both schemes, a message advances to the next switch without ....

....is stored in the next switch. Virtual cut through routing is used throughout this thesis. In multidimensional torus networks and shuffle exchange networks, deadlock situations may develop. Deadlock can be avoided by using various approaches proposed previously. These are structured buffer pools [54], virtual channels [55] deflection routing [57] Chaos routing [58] and abort and retry [59, 60] The deadlock problem and the effect of deadlock free routing on network performance is beyond the scope of this thesis. In our evaluation, we use infinite queues to avoid deadlock problems. However, ....

D. Gelernter, "A DAG-based algorithm for prevention of store-and-forward deadlock in packet networks," IEEE Transaction on Computers, vol. C-30, pp. 709--715, Oct. 1981.

....2, that is checking whether a given routing algorithm (function) is deadlock free or not. Partial ordering of resources is the basic technique to study the presence of deadlocks. This technique was introduced for store and forward routing [71] and is based on the structured buffer pool concept [37, 45, 56] (see also [16] and [64] for more recent results) Dally and Seitz have adapted the partial ordering technique to wormhole routing (see [20, 21] They pointed out that the structured buffer pool approach is not directly applicable to wormhole routing, mainly because resources for ....

D. Gelernter, A DAG-based algorithm for prevention of store-and-forward deadlock in packet networks, IEEE Transactions on Computer, C-30 (1981), pp. 709--715.

....or relatively large packets. By contrary, second generation machines buffer flits, being more deadlock prone. So, the only practical way to avoid deadlock is to design deadlock free routing algorithms. Many deadlock free routing algorithms have been developed for store andforward computer networks [13, 15, 23]. These algorithms are based on a structured buffer pool. However, with wormhole routing, buffer allocation cannot be restricted, because flits have no routing information. Once the header of a message has been accepted by a channel, the remaining flits must be accepted before the flits of any ....

D. Gelernter, "A DAG-based algorithm for prevention of store-andforward deadlock in packet networks," IEEE Trans. Comput., vol. C-30, pp. 709--715, Oct. 1981.

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