Alleviating the Impact of Tree Saturation on Multistage Interconnection Network Performance

Abstract Tree saturation in a multistage interconnection network due to hotspot access can result in drastically degraded bandwidth and mean latency. Several solutions for preventing tree saturation or avoiding traffic congestion, enhancing overall network band-width and latency, have been proposed. One class of these solutions may be effective in many situations, but tends to offer disappointing performance when hotspot requests are not combinable, whereas the other class of solutions is generally applicable to all situations, but often gives rise to decreased bandwidth under uniform traffic when no hotspot exists. In this paper, we investigate a new approach that can provide good performance regardless of whether hotspot requests are combinable and, in addition, can improve network bandwidth in the absence of a hotspot. This is made possible by utilizing multiqueues at switch inputs and at network primary inputs to ensure a considerably larger traffic flow toward memory modules under both uniform and nonuniform reference patterns. Simulation studies reveal that if hotspots are present, this approach indeed alleviates the impact of tree saturation on regular requests effectively, exhibiting a performance better than that of most prior solutions. With its general applicability and reasonably low hardware complexity, the proposed approach appears to be readily suitable for practical applications.

[1]  Gregory F. Pfister,et al.  “Hot spot” contention and combining in multistage interconnection networks , 1985, IEEE Transactions on Computers.

[2]  Marc Snir,et al.  VLSI COMBINING NETWORK FOR THE NYU ULTRACOMPUTER. , 1985 .

[3]  Derek L. Eager,et al.  A Novel Strategy for Controlling Hot Spot Congestion , 1989, ICPP.

[4]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.

[5]  Daniel M. Dias,et al.  Analysis and Simulation of Buffered Delta Networks , 1981, IEEE Transactions on Computers.

[6]  Marc Snir,et al.  The Performance of Multistage Interconnection Networks for Multiprocessors , 1983, IEEE Transactions on Computers.

[7]  Richard M. Fujimoto,et al.  Multicomputer Networks: Message-Based Parallel Processing , 1987 .

[8]  Manoj Kumar,et al.  Preventing Congestion in Multistage Networks in the Presence of Hotspots , 1989, ICPP.

[9]  Y. Hsu,et al.  A novel message switch for highly parallel systems , 1989, Proceedings 1989 IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[10]  Yann-Hang Lee,et al.  Improving multistage network performance under uniform and hot-spot traffics , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[11]  S. L. Scott,et al.  Using feedback to control tree saturation in multistage interconnection networks , 1989, ISCA '89.

[12]  Matthew J. Thazhuthaveetil,et al.  Hotspot Contention in Non-Blocking Multistage Interconnection Networks , 1990, ICPP.

[13]  William J. Dally,et al.  The torus routing chip , 2005, Distributed Computing.

[14]  Y. Tamir,et al.  High-performance multi-queue buffers for VLSI communications switches , 1988, ISCA '88.

[15]  D J Kuck,et al.  Parallel Supercomputing Today and the Cedar Approach , 1986, Science.

[16]  Nian-Feng Tzeng,et al.  Distributing Hot-Spot Addressing in Large-Scale Multiprocessors , 1987, IEEE Transactions on Computers.