D. Basak and D.K. Panda. Alleviating Consumption Channel Bottleneck in Wormhole-Routed k-ary n-cube Systems. IEEE Transactions on Parallel and Distributed Systems, 9(5):481--496, May 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....buffers than waiting for feedback from neighboring nodes to free up buffers. Basak and Panda demonstrate that consumption channels can be a bottleneck that can exacerbate tree saturation. They show that saturation bandwidth can be increased by having an appropriate number of consumption channels [1]. LANs (Local Area Networks) and WANs (Wide Area Networks) use self tuned congestion control techniques. Various flavors of self tuning, end to end congestion avoid ance and control techniques have been used in the TCP protocol [13, 3] TCP s congestion control mechanism uses time outs and ....

D. Basak and D.K. Panda. Alleviating Consumption Channel Bottleneck in Wormhole-Routed k-ary n-cube Systems. IEEE Transactions on Parallel and Distributed Systems, 9(5):481--496, May 1998.

....systems. Several concepts to alleviate saturation tree effects on network performance in direct and indirect networks have been proposed. These concepts can be divided into four classes: 1) combining techniques [7] 2) flow control techniques [8] 3) enhanced switch box and router designs [4, 9, 10], and (4) adaptive routing protocols [11] Hardware combining methods do not work for most routing protocols in mesh networks. Flow control techniques, like feedback or discarding networks [8] often result in decreased performance under uniform traffic. Most enhanced router designs for ....

....[11] Hardware combining methods do not work for most routing protocols in mesh networks. Flow control techniques, like feedback or discarding networks [8] often result in decreased performance under uniform traffic. Most enhanced router designs for wormholerouting direct networks (e.g. [9]) are unable to control the traffic flow under nonuniform traffic patterns. In direct networks, adaptive routing protocols are able to route messages around congested network areas [11] however, under hot spot traffic patterns, the overall network might become congested, so that adaptive routing ....

[Article contains additional citation context not shown here]

D. Basak and D. K. Panda, "Alleviating consumption channel bottleneck in wormhole-routed k-ary n-Cube systems," IEEE Transactions on Parallel and Distributed Systems, Vol. 9, No. 5, May 1998, pp. 481-496.

....channels Figure 1: Recent examples of processor cluster based systems. A cluster is connected to its inter cluster network router through a cluster interface. The interface offers a number of channels to and from the network router. These channels (referred to as injection consumption channels [2]) are used to inject consume messages to from other clusters. We use i to denote the number of injection or consumption channels per cluster. Typically, most systems have i = 1 2, this value being limited by the maximum available router pinout [3] 3 Processor cluster organizations ....

....the limitation that can arise from the limited memory bandwidth available for message injection. When a message is injected, the memory needs to be read at a rate matching the network channel speed. Otherwise, the network channels can remain under utilized leading to a fall in network performance [2]. In this paper we assume memory bandwidth per processor to support only one message injection, that is, a single port model. However, different processors in a cluster can inject messages concurrently since these are supported from different memories. 5.2 Illustrating U mesh in terms of inter ....

D. Basak and D. K. Panda. Alleviating Consumption Channel Bottleneck in Wormhole-Routed k-ary n-cube Systems. Technical Report OSU-CISRC-9/95-TR36, Department of Computer and Information Science, The Ohio State University, 1995.

....usage of virtual channels in the network may reduce contention inside the network. But it aggravates contention at the NI. An example of such contention is illustrated in Fig. 5. Such contention at the NI has also been identified in the context of distributed memory systems in a separate research [3]. 3.3 FIFO Restriction As the VLSI technology advances, implementing a coherence protocol with moderate complexity is no longer a concern. New automatic or semi automatic tools are available to help checking the correctness of the protocol. A FIFO coherence protocol is a natural fit in a ....

....of guidelines have been proposed in [5] for designing better networks for DSM systems with two virtual networks (with one virtual channel each) and one injection and consumption channel at the network interface. Impact of multiple physical injection consumption channels has been the focus of study [3]. However, this study has been done with respect to uniform traffic distribution in distributed memory systems. Traffic non uniformities in the forward and reverse multistage networks in the Cedar system have been investigated in [26] Strategies for improving the performance of dance hall vector ....

D. Basak and D. K. Panda. Alleviating Consumption Channel Bottleneck in WormholeRouted k-ary n-cube Systems. IEEE Transactions on Parallel and Distributed Systems, 1997. To appear.

No context found.

D. Basak and D.K. Panda. Alleviating Consumption Channel Bottleneck in Wormhole-Routed k-ary n-cube Systems. IEEE Transactions on Parallel and Distributed Systems, 9(5):481--496, May 1998.

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