skip to main content
research-article

Application of Logical Sub-networking in Congestion-aware Deadlock-free SDmesh Routing

Authors Info & Claims
Published:21 June 2020Publication History
Skip Abstract Section

Abstract

An adaptive routing helps in evading early network saturation by steering data packets through the less congested area at the oppressive loaded situation. However, performances of adaptive routing are not always promising under all circumstances. Say for, given more freedom in choosing an alternate route on non-minimal paths for a substantially loaded network even may result in worsening network performances due to following longer route under adaptive routing. Here, underlying topology facilitates routing by offering more alternate short-cut routes on minimal or quasi-minimal paths. This work presents a congestion-aware (CA) adaptive routing for one-hop diagonally connected subnet-based mesh (SDmesh) network aiming to facilitate both performances and routing flexibility simultaneously. Our proposed technique on the selected system facilitates packet routing, offering more options in choosing an output link from minimal or quasi-minimal paths and hence helps in lowering packet delay by shortening the length of traversed traffic under the oppressive loaded situation. Furthermore, we have also employed a congestion-aware virtual input crossbar router aiming to split the entire network into two distinct logically separated sub-networks. It facilitates preserving important routing properties like deadlock, live-lock fairness, and other essential routing constraints. Experiments, conducted over two 8×8- and 12×12-sized networks, show an average improvement of 25--87.5% saturated latency and 60--83% throughput improvement under uniform traffic patterns for the proposed CA routing compared to centralized adaptive XY routing. Experimental results on application-specific PARSEC and SPLASH2 benchmark suites show an average of 22--50% latency and 23--30% throughput improvements by the proposed technique compared to centralized XY routing on the baseline mesh network. Moreover, experiments were also carried out to check the performance of the proposed routing method with different newly proposed deadlock-free adaptive routing approaches over the same subnet-based diagonal mesh (SDmesh) network and reported.

References

  1. L. Benini and D. Bertozzi. 2005. Network-on-chip architectures and design methods. IEE Proc. Comput. Dig. Techn. 152, 2 (Mar. 2005), 261--272. Retrieved from http://digital-library.theiet.org/content/journals/10.1049/ip-cdt_20045100.Google ScholarGoogle Scholar
  2. Han-Yee Kim, Young-Hwan Kim, HeonChang Yu, and Taeweon Suh. 2013. Performance evaluation of many-core systems: Case study with TILEPro64. IET Comput. Dig. Techn. 7, 4 (July 2013), 143--154. Retrieved from http://digital-library.theiet.org/content/journals/10.1049/iet-cdt.2012.0101.Google ScholarGoogle Scholar
  3. T. G. Mattson, R. Van der Wijngaart, and M. Frumkin. 2008. Programming the Intel 80-core network-on-a-chip terascale processor. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC’08). 1--11. DOI:http://dx.doi.org/10.1109/SC.2008.5213921Google ScholarGoogle Scholar
  4. 2011. International Technology Roadmap for Semiconductors. Online. Retrieved from http://www.itrs2.net/itrs-reports.html.Google ScholarGoogle Scholar
  5. J. M. Montanana, M. Koibuchi, H. Matsutani, and H. Amano. 2009. Balanced dimension-order routing for k-ary n-cubes. In Proceedings of the International Conference on Parallel Processing Workshops. 499--506. DOI:http://dx.doi.org/10.1109/ICPPW.2009.64Google ScholarGoogle Scholar
  6. William James Dally and Brian Patrick Towles. 2004. Principles and Practices of Interconnection Networks. Elsevier.Google ScholarGoogle Scholar
  7. P. Gratz, B. Grot, and S. W. Keckler. 2008. Regional congestion awareness for load balance in networks-on-chip. In Proceedings of the IEEE 14th International Symposium on High Performance Computer Architecture. 203--214. DOI:http://dx.doi.org/10.1109/HPCA.2008.4658640Google ScholarGoogle Scholar
  8. Prasun Ghosal and Tuhin Subhra Das. 2013. Routing in Multicore NoCs. CRC Press, 299--331. DOI:http://dx.doi.org/10.1201/b15268-17Google ScholarGoogle Scholar
  9. C. J. Glass and L. M. Ni. 1992. Adaptive routing in mesh-connected networks. In Proceedings of the 12th International Conference on Distributed Computing Systems. 12--19. DOI:http://dx.doi.org/10.1109/ICDCS.1992.235060Google ScholarGoogle Scholar
  10. Ge-Ming Chiu. 2000. The odd-even turn model for adaptive routing. IEEE Trans. Parallel Distrib. Syst. 11, 7 (July 2000), 729--738. DOI:http://dx.doi.org/10.1109/71.877831Google ScholarGoogle Scholar
  11. Jie Wu and Dajin Wang. 2002. Fault-tolerant and deadlock-free routing in 2-D meshes using rectilinear-monotone polygonal fault blocks. In Proceedings of the International Conference on Parallel Processing. 247--254.Google ScholarGoogle Scholar
  12. K. V. Anjan and T. M. Pinkston. 1995. An efficient, fully adaptive deadlock recovery scheme: DISHA. In Proceedings 22nd Annual International Symposium on Computer Architecture. 201--210. DOI:http://dx.doi.org/10.1109/ISCA.1995.524561Google ScholarGoogle Scholar
  13. Ming Li, Qing-An Zeng, and Wen-Ben Jone. 2006. DyXY—A proximity congestion-aware deadlock-free dynamic routing method for network on chip. In Proceedings of the 43rd ACM/IEEE Design Automation Conference. 849--852. DOI:http://dx.doi.org/10.1109/DAC.2006.229242Google ScholarGoogle Scholar
  14. Jun Ho Bahn, Seung Eun Lee, Yoon Seok Yang, Jungsook Yang, and Nader Bagherzadeh. 2008. On design and application mapping of a Network-on-Chip (NoC) architecture. Parallel Process. Lett. 18, 02 (2008), 239--255.Google ScholarGoogle ScholarCross RefCross Ref
  15. Chifeng Wang and Nader Bagherzadeh. 2014. Design and evaluation of a high throughput QoS-aware and congestion-aware router architecture for Network-on-Chip. Microprocess. Microsyst. 38, 4 (2014), 304--315. DOI:http://dx.doi.org/10.1016/j.micpro.2013.09.006Google ScholarGoogle ScholarCross RefCross Ref
  16. N. Prasad, Priyajit Mukherjee, Santanu Chattopadhyay, and Indrajit Chakrabarti. 2018. Design and evaluation of ZMesh topology for on-chip interconnection networks. J. Parallel Distrib. Comput. 113 (2018), 17--36. DOI:http://dx.doi.org/10.1016/j.jpdc.2017.10.011Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Chrysostomos Nicopoulos, Vijaykrishnan Narayanan, and Chita R Das. 2009. Network-on-Chip Architectures: A Holistic Design Exploration. Vol. 45. Springer Science 8 Business Media.Google ScholarGoogle Scholar
  18. N. Alfaraj, J. Zhang, Y. Xu, and H. J. Chao. 2011. HOPE: Hotspot congestion control for Clos network on chip. In Proceedings of the 5th ACM/IEEE International Symposium. 17--24. DOI:http://dx.doi.org/10.1145/1999946.1999950Google ScholarGoogle Scholar
  19. Steven L. Teig. 2002. The X architecture: Not your Father’s diagonal wiring. In Proceedings of the International Workshop on System-level Interconnect Prediction (SLIP’02). ACM, New York, NY, 33--37.Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Shashi Kumar, Axel Jantsch, Juha-Pekka Soininen, Martti Forsell, Mikael Millberg, Johny Öberg, Kari Tiensyrjä, and Ahmed Hemani. 2002. A network on chip architecture and design methodology. In Proceedings of the IEEE Computer Society Annual Symposium on Very Large Scale Integration (VLSI’02). IEEE, 105--112.Google ScholarGoogle ScholarCross RefCross Ref
  21. C. Wang, W. H. Hu, and N. Bagherzadeh. 2010. Congestion-aware network-on-chip router architecture. In Proceedings of the 15th CSI International Symposium on Computer Architecture and Digital Systems. 137--144. DOI:http://dx.doi.org/10.1109/CADS.2010.5623552Google ScholarGoogle ScholarCross RefCross Ref
  22. Supriya Rao, Supreet Jeloka, Reetuparna Das, David Blaauw, Ronald Dreslinski, and Trevor Mudge. 2014. Vix: Virtual input crossbar for efficient switch allocation. In Proceedings of the 51st Annual Design Automation Conference. ACM, 1--6.Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Vincenzo Catania, Andrea Mineo, Salvatore Monteleone, Maurizio Palesi, and Davide Patti. 2016. Cycle-accurate network on chip simulation with noxim. ACM Trans. Model. Comput. Simul. 27, 1 (Aug. 2016). DOI:http://dx.doi.org/10.1145/2953878Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. J. E. Miller, H. Kasture, G. Kurian, C. Gruenwald, N. Beckmann, C. Celio, J. Eastep, and A. Agarwal. 2010. Graphite: A distributed parallel simulator for multicores. In Proceedings of the IEEE 16th International Symposium on High Performance Computer Architecture (HPCA’10). 1--12.Google ScholarGoogle Scholar
  25. Md Hasan Furhad and Jong-Myon Kim. 2014. A shortly connected mesh topology for high performance and energy efficient network-on-chip architectures. J. Supercomput. 69, 2 (2014), 766--792.Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Thomas Canhao Xu, Ville Leppänen, Pasi Liljeberg, Juha Plosila, and Hannu Tenhunen. 2015. PDNOC: Partially diagonal network-on-chip for high efficiency multicore systems. Concurr. Comput.: Pract. Exper. 27, 4 (Mar. 2015), 1054--1067. DOI:http://dx.doi.org/10.1002/cpe.3364Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Poona Bahrebar and Dirk Stroobandt. 2018. Abacus turn model-based routing for NoC interconnects with switch or link failures. Microprocess. Microsyst. 59 (2018), 69--91. DOI:http://dx.doi.org/10.1016/j.micpro.2018.01.005Google ScholarGoogle ScholarCross RefCross Ref
  28. C. Wang and N. Bagherzadeh. 2012. Design and evaluation of a high throughput QoS-aware and congestion-aware router architecture for network-on-chip. In Proceedings of the 20th Euromicro International Conference on Parallel, Distributed and Network-based Processing. 457--464. DOI:http://dx.doi.org/10.1109/PDP.2012.20Google ScholarGoogle Scholar
  29. S. P. Singh, S. Bhoj, D. Balasubramanian, T. Nagda, D. Bhatia, and P. Balsara. 2007. Network interface for NoC-based architectures. Int. J. Electron. 94, 5 (2007), 531--547. DOI:http://dx.doi.org/10.1080/00207210701306462 arXiv:https://doi.org/10.1080/00207210701306462Google ScholarGoogle ScholarCross RefCross Ref
  30. W. J. Dally and C. L. Seitz. 1987. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans. Comput. C-36, 5 (May 1987), 547--553. DOI:http://dx.doi.org/10.1109/TC.1987.1676939Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Sheng Ma, Natalie Enright Jerger, and Zhiying Wang. 2011. DBAR: An efficient routing algorithm to support multiple concurrent applications in networks-on-chip. SIGARCH Comput. Archit. News 39, 3 (June 2011), 413--424. DOI:http://dx.doi.org/10.1145/2024723.2000113Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Christopher J. Glass and Lionel M. Ni. 1992. The turn model for adaptive routing. In Proceedings of the 19th Annual International Symposium on Computer Architecture (ISCA’92). ACM, New York, NY, 278--287. DOI:http://dx.doi.org/10.1145/139669.140384Google ScholarGoogle Scholar
  33. P. Tsai, Y. Kuo, E. Chang, H. Hsin, and A. Wu. 2013. Hybrid path-diversity-aware adaptive routing with latency prediction model in Network-on-Chip systems. In Proceedings of the International Symposium on VLSI Design, Automation, and Test (VLSI-DAT’13). 1--4. DOI:http://dx.doi.org/10.1109/VLDI-DAT.2013.6533884Google ScholarGoogle Scholar
  34. Y. Kuo, P. Tsai, H. Ho, E. Chang, H. Hsin, and A. Wu. 2012. Path-diversity-aware adaptive routing in network-on-chip systems. In Proceedings of the IEEE 6th International Symposium on Embedded Multicore SoCs. 175--182. DOI:http://dx.doi.org/10.1109/MCSoC.2012.20Google ScholarGoogle Scholar
  35. Ran Manevich, Israel Cidon, Avinoam Kolodny, and Isask’har Walter. 2010. Centralized adaptive routing for NoCs. IEEE Comput. Archit. Lett. 9, 2 (July 2010), 57--60. DOI:http://dx.doi.org/10.1109/L-CA.2010.17Google ScholarGoogle Scholar
  36. S. C. Woo, M. Ohara, E. Torrie, J. P. Singh, and A. Gupta. 1995. The SPLASH-2 programs: Characterization and methodological considerations. In Proceedings of the 22nd Annual International Symposium on Computer Architecture. 24--36.Google ScholarGoogle Scholar
  37. Christian Bienia, Sanjeev Kumar, Jaswinder Pal Singh, and Kai Li. 2008. The PARSEC benchmark suite: Characterization and architectural implications. In Proceedings of the 17th International Conference on Parallel Architectures and Compilation Techniques (PACT’08). ACM, New York, NY, 72--81. DOI:http://dx.doi.org/10.1145/1454115.1454128Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Application of Logical Sub-networking in Congestion-aware Deadlock-free SDmesh Routing

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in

              Full Access

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader

              HTML Format

              View this article in HTML Format .

              View HTML Format
              About Cookies On This Site

              We use cookies to ensure that we give you the best experience on our website.

              Learn more

              Got it!