The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—Network performance in tightly-coupled multiprocessors typically degrades rapidly beyond network saturation. Consequently, designers must keep a network below its saturation point by reducing the load on the network. Congestion control via source throttling—a common technique to reduce the network load—prevents new packets from entering the network in the presence of congestion. Unfortunately, prior schemes to implement source throttling either lack vital global information about the network to make the correct decision (whether to throttle or not) or depend on specific network parameters, or communication patterns. This paper presents a global-knowledge-based, self-tuned, congestion control technique that prevents saturation at high loads across different communication patterns for <tmath>k{\hbox{-}\rm ary}</tmath><tmath>n{\hbox{-}\rm cube}</tmath> networks. Our design is composed of two key components. First, we use global information about a network to obtain a timely estimate of network congestion. We compare this estimate to a threshold value to determine when to throttle packet injection. The second component is a self-tuning mechanism that automatically determines appropriate threshold values based on throughput feedback. A combination of these two techniques provides high performance under heavy load, does not penalize performance under light load, and gracefully adapts to changes in communication patterns.</p>
Interconnection networks, wormhole, k{\hbox{-}\rm ary}n{\hbox{-}\rm cubes}, congestion control, global information, self-tuning.

A. R. Lebeck, M. Thottethodi and S. S. Mukherjee, "Exploiting Global Knowledge to Achieve Self-Tuned Congestion Control for k-Ary n-Cube Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 15, no. , pp. 257-272, 2004.
91 ms
(Ver 3.3 (11022016))