Realistic Evaluation of Interconnection Network Performance at High Loads

Any simulation-based evaluation of an interconnection network proposal requires a good characterization of the workload. Synthetic traffic patterns based on independent traffic sources are commonly used to measure performance in terms of average latency and peak throughput. As they do not capture the level of self-throttling that occurs in most parallel applications, they can produce inaccurate throughput estimates at high loads. Thus, workloads that resemble the varying levels of synchronization of actual applications are needed to study the performance of interconnection networks. One approach is to use simple, burst-synchronized synthetic workloads that emulate the self-throttling of many parallel applications. To validate this approach, we compare the gains achieved by a restrictive injection mechanism under this workload with those obtained using traces from the NAS Parallel Benchmarks. This study confirms that the burst-synchronized traffic model provides reasonable performance estimates, which could be improved by taking into account dependency chains between messages.

[1]  Raj Jain,et al.  Congestion Control in Computer Networks: Trends and Issues , 1990, IEEE Netw..

[2]  José Miguel-Alonso,et al.  INSEE: An Interconnection Network Simulation and Evaluation Environment , 2005, Euro-Par.

[3]  Seth Copen Goldstein,et al.  NIFDY: a low overhead, high throughput network interface , 1995, ISCA.

[4]  Pedro López,et al.  A family of mechanisms for congestion control in wormhole networks , 2005, IEEE Transactions on Parallel and Distributed Systems.

[5]  Mithuna Thottethodi,et al.  Exploiting global knowledge to achieve self-tuned congestion control for k-ary n-cube networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

[6]  Cruz Izu,et al.  Evaluation of Interconnection Network Performance Under Heavy Non-uniform Loads , 2005, ICA3PP.

[7]  José-Ángel Gregorio,et al.  Improving the performance of large interconnection networks using congestion-control mechanisms , 2008, Perform. Evaluation.

[8]  José Duato,et al.  A Necessary and Sufficient Condition for Deadlock-Free Routing in Cut-Through and Store-and-Forward Networks , 1996, IEEE Trans. Parallel Distributed Syst..

[9]  José-Ángel Gregorio,et al.  Effects of injection pressure on network throughput , 2006, 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'06).

[10]  Timothy Mark Pinkston,et al.  Distributed resolution of network congestion and potential deadlock using reservation-based scheduling , 2005, IEEE Transactions on Parallel and Distributed Systems.

[11]  Solomon W. Golomb,et al.  Run-length encodings (Corresp.) , 1966, IEEE Trans. Inf. Theory.

[12]  William J. Dally,et al.  Principles and Practices of Interconnection Networks , 2004 .

[13]  Philip Heidelberger,et al.  IBM Research Report Design and Analysis of the BlueGene/L Torus Interconnection Network , 2003 .

[14]  Cruz Izu,et al.  The Adaptive Bubble Router , 2001, J. Parallel Distributed Comput..

[15]  Javier Navaridas,et al.  Evaluation of Interconnection Networks Using Full-System Simulators: Lessons Learned , 2007, 40th Annual Simulation Symposium (ANSS'07).