Skip to main content
SpringerLink
Log in

Adaptive flow control in high-performance interconnection networks

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

The flow-control mechanism determinates the manner in which the communicational resources are allocated. Well-designed flow-control mechanism should provide efficient allocation of the communicational resources in wide variety of interconnection networks. The goal of this paper is to suggest a highly effective “Step-Back-on-Blocking” buffered flow control. The proposed flow-control mechanism combines the advantages of the Wormhole and Virtual-Cut Through flow controls, whilst adds a means for adaptive allocation of the communicational resources. The “Step-Back-on-Blocking” flow control provides low message latency and achieves high fraction of the channel bandwidth by performing conditional evasion of temporary blocked network resources. The effectiveness of the proposed flow control has been evaluated on the basis of numerous experiments conducted in OMNet++ discrete event simulation environment.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17

Similar content being viewed by others

References

  1. Aridor Y, Domany T, Goldshmidt O, Kliteynik Y, Shmueli E, Moreira JE (2008) Multitoroidal interconnects for tightly coupled supercomputers. IEEE Trans Parallel Distrib Syst 19

  2. Gupta AK, Dally WJ (2006) Topology optimization of interconnection networks. Comput Archit Lett 5(1):10–13

    Article  Google Scholar 

  3. Abts D, Kim J (2011) High performance data center networks. Morgan and Claypool Publishers

  4. Xiao W, Weidong C, Wenhong W, Parhami B (2008) On necessary conditions for scale-freedom in complex networks with applications to computer communication systems. In: First international conference, intelligent networks and intelligent systems, (2008) ICINIS ’08, pp 187–190

  5. Kermani P, Kleinrock L (1979) Virtual cut-through: a new computer communication switching technique. Comput Netw

  6. Verbeek F, Schmaltz J (2011) A fast and verified algorithm for proving store-and-forward networks deadlock-free. In: IEEE 19th Euromicro international conference on parallel, distributed and network-based processing (PDP), 2011

  7. Dally WJ, Seitz CL (1986) Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans Comput, June

  8. Borovska P, Kimovski D (2012) \(\alpha \Omega \)Highway interconnection network architecture for high performance computing. In: IEEE symposium on computers and communications (ISCC), 2012. IEEE

  9. Jiang N, Dally WJ (2009) Indirect adaptive routing on large scale interconnection networks. Stanford, Engineering

  10. Rubio JMM, Lopez P, Duato J (2003) Flow control-based distributed deadlock detection mechanism for true fully adaptive routing in wormhole networks. IEEE Trans Parallel Distrib Syst 14(8):765–779

    Google Scholar 

  11. Luo W, Xiang D (2012) An efficient adaptive deadlock-free routing algorithm for torus networks. IEEE Trans Parallel Distrib Syst 23(5):800–808

    Article  Google Scholar 

  12. Jouraku A, Koibuchi M, Amano H (2007), An effective design of deadlock-free routing algorithms based on 2D turn model for irregular networks. IEEE Trans Parallel Distrib Syst 320–333

  13. Xiang D (2011) Deadlock-free adaptive routing in meshes with fault-tolerance ability based on channel overlapping. IEEE Trans Dependable Secur Comput 8:74–88

    Google Scholar 

  14. Seiculescu C, Murali S, Benini L, De Micheli G (2010) A method to remove deadlocks in networks-on-chips with Wormhole flow control. In: Design, automation & test in Europe conference & exhibition, pp 1625–1628

  15. Ching-Tien H, Stockmeyer L (2002) A new approach to fault-tolerant wormhole routing for mesh-connected parallel computers. In: International, proceedings parallel and distributed processing symposium, IPDPS 2002, pp 48–56

  16. Cole RJ (2001) On the benefit of supporting virtual channels in wormhole routers. J Comput Syst Sci 62

  17. Gábor L, Varga A (2010) Performance prediction of conservative parallel discrete event simulation. In: Proceedings of the 2010 industrial simulation conference, pp 214–219

Download references

Acknowledgments

The results reported in this paper are part of the research project, Center of excellence “Supercomputing Applications”—DCVP 02/1, supported by the National Science Fund, Bulgarian Ministry of Education and Science.

Author information

Authors and Affiliations

  1. Faculty of Computer Systems and Control, Technical University of Sofia, Sofia, Bulgaria

    Plamenka Borovska

  2. Faculty for Communication Networks and Security, University for Information Science and Technology, Ohrid, Republic of Macedonia

    Dragi Kimovski

Authors
  1. Plamenka Borovska
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dragi Kimovski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dragi Kimovski.

Electronic supplementary material

Below is the link to the electronic supplementary material.

Supplementary material 1 (pdf 220 KB)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Borovska, P., Kimovski, D. Adaptive flow control in high-performance interconnection networks. J Supercomput 68, 315–338 (2014). https://doi.org/10.1007/s11227-013-1041-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-013-1041-5

Keywords

Search

Navigation