skip to main content
research-article

Finding an upper bound on the increase in execution time due to contention on the memory bus in COTS-based multicore systems

Published:01 January 2010Publication History
Skip Abstract Section

Abstract

Contention on the memory bus in COTS based multicore systems is becoming a major determining factor of the execution time of a task. Analyzing this extra execution time is non-trivial because (i) bus arbitration protocols in such systems are often undocumented and (ii) the times when the memory bus is requested to be used are not explicitly controlled by the operating system scheduler; they are instead a result of cache misses. We present a method for finding an upper bound on the extra execution time of a task due to contention on the memory bus in COTS based multicore systems. This method makes no assumptions on the bus arbitration protocol (other than assuming that it is work-conserving).

References

  1. S. Williams, A. Waterman, and D. Patterson, "Roofline: an insightful visual performance model for multicore architectures," Communications of the ACM, vol. 52, no. 4, pp. 65--76, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. K. D. Bosschere, W. Luk, X. Martorell, N. Navarro, M. OBoyle, D. Pnevmatikatos, A. Ramirez, P. Sainrat, A. Seznec, P. Stenström, and O. Temam, "Challenge 2.2 in high-performance embedded architecture and compilation roadmap," in Transactions on HiPEAC, 2007, pp. 5--29. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J. Rosén, A. Andrei, P. Eles, and Z. Peng, "Bus access optimization for predictable implementation of real-time applications on multiprocessor systems-on-chip," in Proc. of IEEE Real-Time Systems Symposium, 2007, pp. 49--60. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. L. Steffens, M. Agarwal, and P. van der Wolf, "Real-time analysis for memory access in media processing SoCs: A practical approach," in Proc. of Euromicro Conference on Real-Time Systems, 2008, pp. 255--265. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. T. Lundqvist and P. Stenström, "Timing anomalies in dynamically scheduled microprocessors," in Proc. of IEEE Real-Time Systems Symposium, 1999, pp. 12--21. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. G. Laurent, N. Rivierre, and M. Spuri, "Preemptive and nonpreemptive real-time uniprocessor scheduling," Tech. Rep., 1996.Google ScholarGoogle Scholar
  7. S. K. Baruah, "A general model for recurring real-time tasks," in Proc. of IEEE Real-Time Systems Symposium, 1998, pp. 114--122. Google ScholarGoogle ScholarDigital LibraryDigital Library

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

  • Published in

    cover image ACM SIGBED Review
    ACM SIGBED Review  Volume 7, Issue 1
    Special Issue on the Work-in-Progress (WIP) Session at the 2009 IEEE Real-Time Systems Symposium (RTSS)
    January 2010
    27 pages
    EISSN:1551-3688
    DOI:10.1145/1851166
    Issue’s Table of Contents

    Copyright © 2010 Authors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 1 January 2010

    Check for updates

    Qualifiers

    • research-article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader