skip to main content
10.1145/2038642.2038680acmconferencesArticle/Chapter ViewAbstractPublication PagesesweekConference Proceedingsconference-collections
research-article

Real-time communication analysis for networks with two-stage arbitration

Published:09 October 2011Publication History

ABSTRACT

Current on-chip and macro networks use multi-stage arbitration schemes which independently assign different resources such as crossbar inputs and outputs to individual traffic streams. To use these networks in real-time systems, their worst-case behavior must be proved analytically in order to ensure the required timing guarantees. Current analysis approaches, however, do not capture the multi-stage arbitration accurately. In this paper, we propose an analysis that maps the multi-stage arbitration to a schedulability analysis of multiprocessors with shared resources. This allows the exploitation of knowledge about the worst-case behavior of the individual traffic streams, which is required to provide nonsymmetric guarantees. Using this scheduling analysis approach, a detailed analysis solution for a common multi-stage arbitration scheme (iSLIP) is presented. Finally, we evaluate the proposed approach experimentally and compare it to previous work.

References

  1. T. Bjerregaard. The MANGO Clockless Network-on-Chip: Concepts and Implementation. PhD thesis, IMM, Danmarks Tekniske Universitet, 2005.Google ScholarGoogle Scholar
  2. E. Bolotin, I. Cidon, R. Ginosar, and A. Kolodny. QNoC: QoS Architecture and Design Process for Network on Chip. J. Syst. Archit., 50(2--3):105--128, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. W. Dally. Principles and Practices of Interconnection Networks. Morgan Kaufmann, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. J. Diemer and R. Ernst. Back Suction: Service Guarantees for Latency-Sensitive On-Chip Networks. In NOCS, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. J. Draper and J. Ghosh. A comprehensive analytical model for wormhole routing in multicomputer systems. Journal of Parallel and Distributed Computing, 23(2):202--214, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. M. A. A. Faruque, G. Weiss, and J. Henkel. Bounded Arbitration Algorithm for QoS-Supported On-chip Communication. In CODESGoogle ScholarGoogle Scholar
  7. ISSS'06, 2006.Google ScholarGoogle Scholar
  8. K. Goossens, J. Dielissen, and A. Ruadulescu. Æthereal Network on Chip: Concepts, Architectures, and Implementations. IEEE DESIGN & TEST, 22(5):414--421, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. S. Gopalakrishnan, M. Caccamo, and L. Sha. Switch scheduling and network design for real-time systems. In RTAS'06, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. A. Hansson, K. Goossens, and A. R\uadulescu. A unified approach to constrained mapping and routing on network-on-chip architectures. In CODES Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. ISSS'05. ACM New York, NY, USA, 2005.Google ScholarGoogle Scholar
  12. R. Henia, A. Hamann, M. Jersak, R. Racu, K. Richter, and R. Ernst. System Level Performance Analysis--the SymTA/S Approach. IEE Proceedings-Computers and Digital Techniques, 152(2):148--166, 2005.Google ScholarGoogle Scholar
  13. P. Hu and L. Kleinrock. An analytical model for wormhole routing with finite size input buffers. In ITC-15, 1997.Google ScholarGoogle ScholarCross RefCross Ref
  14. B. Kim, J. Kim, S. Hong, and S. Lee. A real-time communication method for wormhole switching networks. Parallel and Distributed Systems, IEEE Transactions on, 13(12):1261--1274, 2002.Google ScholarGoogle Scholar
  15. T. Kranich and M. Berekovic. NoC switch with credit based guaranteed service support qualified for GALS systems. In DSD'10. CPS, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. J. Le Boudec and P. Thiran. Network Calculus: A Theory of Deterministic Queuing Systems for the Internet. Springer, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. J. Lee, M. C. Ng, and K. Asanovic. Globally-Synchronized Frames for Guaranteed Quality-of-Service in On-Chip Networks. In ISCA'08, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. S. Lee. Real-time wormhole channels. Journal of Parallel and Distributed Computing, 63(3):299--311, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. J. Lehoczky. Fixed priority scheduling of periodic task sets with arbitrary deadlines. In RTSS'90, 1990.Google ScholarGoogle ScholarCross RefCross Ref
  20. R. Marculescu, U. Ogras, L. Peh, N. Jerger, and Y. Hoskote. Outstanding Research Problems in NoC Design: System, Microarchitecture, and Circuit Perspectives. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 28(1):3, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. T. M. Marescaux. Mapping and Management of Communication Services on MP-SoC Platforms. PhD thesis, Technische Universiteit Eindhoven, 2007.Google ScholarGoogle Scholar
  22. N. McKeown. The iSLIP scheduling algorithm for input-queued switches. IEEE/ACM Transactions on Networking (TON), 7(2):188--201, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. M. Millberg, E. Nilsson, R. Thid, and A. Jantsch. Guaranteed Bandwidth using Looped Containers in Temporally Disjoint Networks within the Nostrum Network on Chip. In DATE'04, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. M. Negrean, S. Schliecker, and R. Ernst. Response-time analysis of arbitrarily activated tasks in multiprocessor systems with shared resources. In DATE'09, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. U. Ogras and R. Marculescu. Analytical router modeling for networks-on-chip performance analysis. In DATE'07, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. R. Racu, L. Li, R. Henia, A. Hamann, and R. Ernst. Improved response time analysis of tasks scheduled under preemptive round-robin. In CODES+ISSS'07, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. D. Rahmati, S. Murali, L. Benini, F. Angiolini, G. De Micheli, and H. Sarbazi-Azad. A method for calculating hard QoS guarantees for Networks-on-Chip. In ICCAD'09, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. S. Schliecker and R. Ernst. A Recursive Approach to End-To-End Path Latency Computation in Heterogeneous Multiprocessor Systems. In CODES+ISSS'09. ACM, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. S. Schliecker, M. Negrean, and R. Ernst. Response Time Analysis in Multicore ECUs with Shared Resources. IEEE Transactions on Industrial Informatics, 5(4):402--413, 2009.Google ScholarGoogle ScholarCross RefCross Ref
  30. S. Schliecker, J. Rox, M. Ivers, and R. Ernst. Providing Accurate Event Models for the Analysis of Heterogeneous Multiprocessor Systems. In CODES-ISSS'08, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Z. Shi and A. Burns. Real-time communication analysis for on-chip networks with wormhole switching. In NOCS, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Y. Tamir and H. Chi. Symmetric crossbar arbiters for VLSI communication switches. IEEE Transactions on Parallel and Distributed Systems, 4:13--27, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. L. Thiele, S. Chakraborty, and M. Naedele. Real-time calculus for scheduling hard real-time systems. In ISCAS'00, volume 4. IEEE, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  34. K. Tindell, A. Burns, and A. Wellings. An extendible approach for analyzing fixed priority hard real-time tasks. Real-Time Systems, 6(2):133--151, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. K. Tindell and J. Clark. Holistic schedulability analysis for distributed hard real-time systems. Microprocessing and microprogramming, 40(2--3):117--134, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Q. Wang, S. Gopalakrishnan, X. Liu, and L. Sha. A Switch Design for Real-Time Industrial Networks. In RTAS'08. Citeseer, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Real-time communication analysis for networks with two-stage arbitration

        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
        • Published in

          cover image ACM Conferences
          EMSOFT '11: Proceedings of the ninth ACM international conference on Embedded software
          October 2011
          366 pages
          ISBN:9781450307147
          DOI:10.1145/2038642

          Copyright © 2011 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 9 October 2011

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate60of203submissions,30%

          Upcoming Conference

          ESWEEK '24
          Twentieth Embedded Systems Week
          September 29 - October 4, 2024
          Raleigh , NC , USA

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader