The Journal of Supercomputing

, Volume 71, Issue 3, pp 1038–1066 | Cite as

Performance evaluation of generic multi-stage interconnection networks with blocking and back-pressure mechanism

  • Mohammad Amiri-Zarandi
  • Farshad Safaei
  • Milad Roozikhar


Multi-stage interconnection networks (MINs) have frequently been proposed as connection means in traditional parallel systems and networks-on-chip. Most of the existing papers consider some specific traffic patterns over these networks, such as uniform traffic. In this paper, the performance of MIN operating under different types of traffic patterns is analyzed. Then, an analytical model is suggested to evaluate the performance of such systems. Moreover, a novel meta-heuristic approach is proposed, that is capable of alleviating some issues of iterative methods used in the literature. Simulation experiments show that the results achieved by the proposed model are in good agreement with those obtained through simulation.


Interconnection networks Multi-stage interconnection networks Meta-heuristic algorithms Analytical modeling  Performance evaluation 


  1. 1.
    Tehrani MA et al (2011) Design and implementation of multistage interconnection networks using quantum-dot cellular automata. Microelectron J 42(6):913–922CrossRefGoogle Scholar
  2. 2.
    Kim J (2008) High-radix interconnection networks. Ph.D. Thesis, Department of Electrical Engineering and the Committee on Graduate Studies of Stanford UniversityGoogle Scholar
  3. 3.
    Duato J, Yalamanchili S, Ni LM (2003) Interconnection networks: an engineering approach. Morgan Kaufmann Publishers, MassachusettsGoogle Scholar
  4. 4.
    Kim J, Dally WJ (2007) Flattened Butterfly: A cost-efficient topology for high-radix networks. In: ISCA ’07 proceedings of the 34th annual international symposium on computer architecture, San DiegoGoogle Scholar
  5. 5.
    Ahn J et al (2009) HyperX: topology, routing, and packaging of efficient large-scale networks. In: The proceedings of the conference on high performance computing networking, USAGoogle Scholar
  6. 6.
    Bhandarkar SM, Arabnia HR (1995) The REFINE multiprocessor: theoretical properties and algorithms. Parallel Comput, Elsevier 21(11):1783–1806Google Scholar
  7. 7.
    Arabnia HR, Smith JW (1993) A reconfigurable interconnection network for imaging operations and its implementation using a multi-stage switching box. In: Proceedings of the 7th annual international high performance computing conference. The 1993 high performance computing: new horizons supercomputing symposium, Calgary, Alberta, Canada, pp 349–357Google Scholar
  8. 8.
    Agarwal A (1991) Limits on interconnection network performance. IEEE Trans Parallel Distrib Syst 2:398–412CrossRefGoogle Scholar
  9. 9.
    Kruskal CP, Snir M (1983) The performance of multistage interconnection networks for multiprocessors. IEEE Trans Comput 32:1091–1098CrossRefGoogle Scholar
  10. 10.
    Yoon H et al (1990) Performance analysis of multibuffered packet-switching networks in multiprocessor systems. IEEE Trans Comput 39:319–327CrossRefGoogle Scholar
  11. 11.
    Goke LR, Lipovski GJ (1973) Banyan networks for partitioning multiprocessor systems. In: Proceedings of the 1st annual symposium on Computer architecture (ISCA ’73), pp 21–28Google Scholar
  12. 12.
    Jenq Y-C, Holmdel NJ (1983) Performance analysis of a packet switch based on single-buffered banyan network. IEEE J Select Areas Commun 1(6):1014–1021CrossRefGoogle Scholar
  13. 13.
    Theimer TH et al (1991) Performance analysis of buffered Banyan networks. IEEE Trans Commun 39:269–277CrossRefGoogle Scholar
  14. 14.
    Youngsong M, Hee Y, Yong M (1994) Performance analysis of finite buffered multistage interconnection networks. IEEE Trans Comput 43:153–162Google Scholar
  15. 15.
    Tutsch D, Hommel G (2002) Generating systems of equations for performance evaluation of multistage interconnection networks. J Parallel Distrib Comput 62:228–240CrossRefMATHGoogle Scholar
  16. 16.
    Zheng G et al (2005) MINSimulate-a multistage interconnection network simulator. Int J Parallel Programm 33:183–207CrossRefGoogle Scholar
  17. 17.
    Tutsch D, Brenner M (2003) Simulation-based performance rediction for large parallel machines. In: 17th European simulation multiconferenceGoogle Scholar
  18. 18.
    Lin T, Kleinrock L (2014) Performance analysis of finite-buffered multistage interconnection networks with a general traffic pattern. In: Proceedings of the 1991 ACM SIGMETRICS conference on measurement and modeling of computer systems, pp 68–78Google Scholar
  19. 19.
    Youngsong M (2005) Performance analysis of Banyan-type multistage interconnection networks under nonuniform traffic pattern, vol 33. Kluwer Academic Publishers, Boston, pp 33–52Google Scholar
  20. 20.
    Vasiliadis D et al (2006) Performance analysis of blocking banyan switches. In: Proceedings of the IEEE sponsored international joint conference on telecommunications and networking (CISSE’06)Google Scholar
  21. 21.
    Garofalakis J, Stergiou E (2010) An approximate analytical performance model for multistage interconnection networks with backpressure blocking mechanism. J Commun 5:247–261Google Scholar
  22. 22.
    Sharma S et al (2008) On a class of multistage interconnection network in parallel processing. Int J Comput Sci Netw Secur 8:287–291Google Scholar
  23. 23.
    Sharma S et al (2008) Irregular class of multistage interconnection network in parallel processing. J Comput Sci 4(3):220–224CrossRefGoogle Scholar
  24. 24.
    Minsu C et al (2003) Modeling and analysis of fault tolerant multistage interconnection networks. IEEE Trans Instrum Meas 52:1509–1519CrossRefGoogle Scholar
  25. 25.
    Colier M (2002) A systematic analysis of equivalence in multistage networks. J Lightwave Technol 20(9):1664–1672CrossRefGoogle Scholar
  26. 26.
    Gross D et al (2008) Fundamentals of queuing theory, 3 edn. Wiley Series in Probability and Statistics, New YorkGoogle Scholar
  27. 27.
    Ross SM (2009) Introduction to probability models, 10 edn. Academic Press, New YorkGoogle Scholar
  28. 28.
    Kleinrock L (1975) Queuing systems, vol 1. Wiley, New YorkGoogle Scholar
  29. 29.
    Holland JH (1973) Genetic algorithms and the optimal allocation of trials. SIAM J Comput 2:88CrossRefMATHMathSciNetGoogle Scholar
  30. 30.
    Gen M, Cheng R (2000) Genetic algorithms and engineering optimization, vol. 7. Wiley, New YorkGoogle Scholar
  31. 31.
    Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micromachine and human science, Nagoya, Japan, pp 39–43Google Scholar
  32. 32.
  33. 33.
    Nayebi A et al (2007) Xmulator: a listener-based integrated simulation platform for interconnection networks. In: Proceedings of asian modeling symposium (AMS’07)Google Scholar
  34. 34.
    Xmulator Simulator (2014).
  35. 35.
    Dally WJ, Towles B (2004) Principles and practices of interconnection networks. Morgan Kaufmann Publishers, MassachusettsGoogle Scholar
  36. 36.
    Hildebrand FB (2013) Introduction to numerical analysis, 2 edn. Courier Dover Publications, USAGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Mohammad Amiri-Zarandi
    • 1
  • Farshad Safaei
    • 2
  • Milad Roozikhar
    • 3
  1. 1.Department of Computer Science, Faculty of Mathematics and Computer ScienceShahid Bahonar UniversityKermanIran
  2. 2.Faculty of Computer Science and EngineeringShahid Beheshti University G.C.TehranIran
  3. 3.Department of Electrical, Computer and IT EngineeringQIAUQazvinIran

Personalised recommendations