7 citations found. Retrieving documents...
S. Ramany and D. Eager, "The interaction between virtual channel flow control and adaptive routing in wormhole networks," in Proc. International Conference on Supercomputing, pp. 136--145, July 1994.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Impact of Selection Functions on Routing Algorithm Performance.. - Feng, Shin (1996)   (3 citations)  (Correct)

....represent spheres of spatial locality, but these still do not capture the communication structure of specific parallel algorithms or applications. In particular, many scientific programs generate permutation patterns such as matrix transpose (dimension reversal) bit complement, and bit reversal [8 12]. In this paper, we focus on characterizing network performance over a range of destination distributions. 2.2 Routing The routing algorithm determines which path a packet takes to reach its destination. Each time a packet enters a node, the routing algorithm generates a list of candidate links ....

S. Ramany and D. Eager, "The interaction between virtual channel flow control and adaptive routing in wormhole networks," in Proc. International Conference on Supercomputing, pp. 136--145, July 1994.


A Programmable Routing Controller for Flexible.. - Daniel, Rexford.. (1995)   (Correct)

....particular routing switching example employs dimension ordered oblivious routing, using virtual channels solely to improve network throughput. The PRC can also use its three virtual channels to implement deadlock free adaptive routing algorithms, which improve performance for some traffic patterns [33]. The PRC s programmable routing engines allow the network to use its virtual channels for adaptive routing or to reduce contention between packets traveling on the same link, depending on the application s traffic patterns. Alternately, the network can assign virtual channels to different ....

S. Ramany and D. Eager, "The interaction between virtual channel flow control and adaptive routing in wormhole networks," in Proc. International Conference on Supercomputing, pp. 136--145, July 1994. 18


Alleviating Consumption Channel Bottleneck in Wormhole-Routed.. - Basak, Panda (1997)   (3 citations)  (Correct)

....consumption capacity at a node. In the absence of sufficient consumption capacity at a node the advantages of these schemes become somewhat limited. Over the years multiple virtual channels per network channel has been proposed to provide deadlock freedom [18] routing adaptivity [3, 8] and VCFC [14, 35]. Contemporary systems are adopting such multiple virtual channels lanes on network channels [12] In such systems, a consumption channel is required to support virtual multiplexing. Otherwise, virtual multiplexing on the network channels, causing slowdown in propagation of messages, can lead to ....

S. Ramany and D. Eager. The Interaction between Virtual Channel Flow Control and Adaptive Routing in Wormhole Networks. In International Conference on Supercomputing, pages 136-- 145, 1994.


Tailoring Routing and Switching Schemes to.. - Feng, Rexford.. (1995)   (Correct)

....represent spheres of spatial locality, but these still do not capture the communication structure of specific parallel algorithms or applications. In particular, many scientific programs generate permutation patterns such as matrix transpose (dimension reversal) bit complement, and bit reversal [13 16]. Other application constructs, such as synchronization or multicast operations, may induce hot spots of heavily utilized nodes and links [16 18] Finally, dynamic models [1] can produce variation in target destinations during the course of application execution. Interface Control Memory ....

.... In particular, many scientific programs generate permutation patterns such as matrix transpose (dimension reversal) bit complement, and bit reversal [13 16] Other application constructs, such as synchronization or multicast operations, may induce hot spots of heavily utilized nodes and links [16 18]. Finally, dynamic models [1] can produce variation in target destinations during the course of application execution. Interface Control Memory Buffer (1 MByte) Memory Reservation Status Unit Unit CRC Time Stamp Unit Unit CRC Control Memory Programmable Routing Controller To from host (via ....

[Article contains additional citation context not shown here]

S. Ramany and D. Eager, "The interaction between virtual channel flow control and adaptive routing in wormhole networks," in Proc. International Conference on Supercomputing, pp. 136--145, July 1994.


Impact of Selection Functions on Routing Algorithm Performance.. - Feng, Shin (1997)   (3 citations)  (Correct)

....represent spheres of spatial locality, but these still do not capture the communication structure of specific parallel algorithms or applications. In particular, many scientific programs generate permutation patterns such as matrix transpose (dimension reversal) bitcomplement, and bit reversal [6 9]. In this paper, we focus on characterizing network performance over a range of destination distributions. 2.2 Routing The routing algorithm determines the path a packet takes in order to reach its destination. Each time a packet enters a node, the routing algorithm generates a list of candidate ....

S. Ramany and D. Eager, "The interaction between virtual channel flow control and adaptive routing in wormhole networks," in Proc. International Conference on Supercomputing, pp. 136--145, July 1994.


Alleviating Consumption Channel Bottleneck in Wormhole-Routed.. - Basak, Panda (1995)   (3 citations)  (Correct)

....channels are virtual in nature 3 . 3 Since consumption channels are always demand multiplexed over the local bus, they are inherently virtual in As discussed in the introduction section, over the years many attractive features like routing adaptivity [1, 5, 32] virtual channel flow control [11, 30], and fault tolerance [4, 18, 19] have been proposed over the basic wormhole routing. Future wormhole systems are expected to incorporate these features into the design to increase system performance and usability. Most of these schemes primarily rely on having greater number of virtual channels. ....

S. Ramany and D. Eager. The Interaction between Virtual Channel Flow Control and Adaptive Routing in Wormhole Networks. In International Conference on Supercomputing, pages 136-- 145, 1994.


Impact of Selection Functions on Routing Algorithm Performance.. - Feng, Shin (1997)   (3 citations)  (Correct)

No context found.

S. Ramany and D. Eager, "The interaction between virtual channel flow control and adap- tive routing in wormhole networks," in Proc. International Conference on Supercomputing, pp. 136 145, July 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