Abstract
Many simulation-based performance studies of interconnection networks are carried out using synthetic workloads under the assumption of independent traffic sources. We show that this assumption, although useful for some traffic patterns, can lead to deceptive performance results for loads beyond saturation. Network throughput varies so much amongst the network nodes that average throughput does not reflect anymore network performance as a whole. We propose the utilization of burst synchronized traffic sources that better reflect the coupled behavior of parallel applications at high loads. A performance study of a restrictive injection mechanism is used to illustrate the different results obtained using independent and non-independent traffic sources.
This work has been done with the support of the Ministerio de Educación y Ciencia, Spain, under grants TIN2004-07440-C02-01 and TIN2004-07440-C02-02, and also by the Diputación Foral de Gipuzkoa under grant OF-846/2004.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Blumrich, M., Chen, D., Coteus, P., Gara, A., Giampapa, M., Heidelberger, P., Singh, S., Steinmacher-Burrow, B., Takken, T., Vranas, P.: Design and Analysis of the BlueGene/L Torus Interconnection Network. IBM Research Report RC23025, W0312-022, December 3 (2003)
Callahan, T.J., Goldstein, S.C.: NIFDY: A Low Overhead, High Throughput Network Interface. In: Proc. of the 22nd Annual International Symposium on Computer Architecture, ISCA 1995, Santa Margherita Ligure, Italy, June 1995, pp. 230–241 (1995)
The Chaotic Routing Project at the U. of Washington. Chaos Router Simulator, Available at http://www.cs.washington.edu/research/projects/lis/chaos/www/chaos.html
Dally, W.J., Towles, B.: Principles and Practices on Interconnection Networks. Morgan Kaufmann, San Francisco (2004)
Dinda, P., Garcia, B., Leung, K.: The Measured Network Traffic of Compiler-Parallelized Programs. In: Proceedings of the 30th International Conference on Parallel Processing (ICPP 2001), pp. 175–184 (2001)
Duato, J.: A Necessary and Sufficient Condition for Deadlock-Free Routing in Cut-Through and Store-and-Forward Networks. IEEE Trans. on Parallel and Distributed Systems 7(8), 841–854 (1996)
Izu, C., Miguel-Alonso, J., Gregorio, J.A.: Packet Injection Mechanisms and their Impact on Network Throughput. Technical report EHU-KAT-IK-01-05. Department of Computer Architecture and Technology, The University of the Basque Country, Available at http://www.sc.ehu.es/acwmialj/papers/ehu_kat_ik_01_05.pdf
Mukherjee, S., Bannon, P., Lang, S., Spink, A., Webb, D.: The Alpha 21364 Network Architecture. IEEE Micro 21(1), 26–35 (2002)
Petrini, F., Kerbyson, D., Pakin, S.: The Case of the Missing Supercomputer Performance: Achieving Optimal Performance on the 8,192 Processors of ASCI Q. In: IEEE/ACM SC 2003, Phoenix, AZ (November 2003)
Puente, V., Gregorio, J.A., Beivide, R., Izu, C.: On the Design of a High-Performance Adaptive Router for CC-NUMA Multiprocessors. IEEE Trans. on Parallel and Distributed Systems, 14(5) (May 2003)
Puente, V., Izu, C., Beivide, R., Gregorio, J.A., Vallejo, F., Prellezo, J.M.: The Adaptative Bubble Router. Journal of Parallel and Distributed Computing 61(9) (2001)
SMART group at the U. of Southern California. FlexSim 1.2, Available at http://ceng.usc.edu/smart/FlexSim/flexsim.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Izu, C., Miguel-Alonso, J., Gregorio, J.A. (2005). Evaluation of Interconnection Network Performance Under Heavy Non-uniform Loads. In: Hobbs, M., Goscinski, A.M., Zhou, W. (eds) Distributed and Parallel Computing. ICA3PP 2005. Lecture Notes in Computer Science, vol 3719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564621_46
Download citation
DOI: https://doi.org/10.1007/11564621_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29235-7
Online ISBN: 978-3-540-32071-5
eBook Packages: Computer ScienceComputer Science (R0)