skip to main content
research-article

Cache-related preemption delay analysis for FIFO caches

Published:12 June 2014Publication History
Skip Abstract Section

Abstract

Hard real-time systems are typically composed of multiple tasks, subjected to timing constraints. To guarantee that these constraints will be respected, the Worst-Case Response Time (WCRT) of each task is needed. In the presence of systems supporting preemptible tasks, we need to take into account the time lost due to task preemption. A major part of this delay is the Cache-Related Preemption Delay (CRPD), which represents the penalties due to cache block evictions by preempting tasks. Previous works on CRPD have focused on caches with Least Recently used (LRU) replacement policy. However, for many real-world processors such as ARM9 or ARM11, the use of First-in-first-out (FIFO) cache replacement policy is common.

In this paper, we propose an approach to compute CRPD in the presence of instruction caches with FIFO replacement policy. We use the result of a FIFO instruction cache categorization analysis to account for single-task cache misses, and we model as an Integer Linear Programming (ILP) system the additional preemption-related cache misses. We study the effect of cache related timing anomalies, our work is the first to deal with the effect of timing anomalies in CRPD computation. We also present a WCRT computation method that takes advantage of the fact that our computed CRPD does not increase linearly with respect to the preemption count. We evaluated our method by computing the CRPD with realistic benchmarks (e.g. drone control application, robot controller application), under various cache configuration parameters. The experimentation shows that our method is able to compute tight CRPD bound for benchmark tasks.

References

  1. S. Altmeyer and C. Burguiere. A new notion of useful cache block to improve the bounds of cache-related preemption delay. In ECRTS, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. S. Altmeyer, R. I. Davis, and C. Maiza. Cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems. In RTSS, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. C. Berg. Plru cache domino effects. In WCET, 2006.Google ScholarGoogle Scholar
  4. C. Burgui'ere, J. Reineke, and S. Altmeyer. Cache-related preemption delay computation for set-associative caches - pitfalls and solutions. In WCET, 2009.Google ScholarGoogle Scholar
  5. F. Cassez, R. R. Hansen, and M. C. Olesen. What is a timing anomaly? In WCET, 2012.Google ScholarGoogle Scholar
  6. L. K. Chong, C. Ballabriga, V.-T. Pham, S. Chattopadhyay, and A. Roychoudhury. Integrated timing analysis of application and operating systems code. In RTSS, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. D. Grund and J. Reineke. Precise and efficient FIFO-replacement analysis based on static phase detection. In ECRTS, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. J. Gustafsson, A. Betts, A. Ermedahl, and B. Lisper. The mälardalen wcet benchmarks: Past, present and future. In WCET, 2010.Google ScholarGoogle Scholar
  9. C.-G. Lee, H. Hahn, Y.-M. Seo, S. L.Min, R. Ha, S. Hong, C. Y. Park, M. Lee, and C. S. Kim. Analysis of cache-related preemption delay in fixed-priority preemptive scheduling. IEEE Trans. Comput., 47(6), 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. X. Li, A. Roychoudhury, and T. Mitra. Modeling out-of-order processors for wcet analysis. Real-Time Systems, 34(3), 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. X. Li, Y. Liang, T. Mitra, and A. Roychoudhury. Chronos: A timing analyzer for embedded software. Science of Computer Programming, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. T. Lundqvist. A WCET Analysis Method for Pipelined Microprocessors with Cache Memories. PhD thesis, Chalmers University of Technology, 2002.Google ScholarGoogle Scholar
  13. T. Lundqvist and P. Stenström. Timing anomalies in dynamically scheduled microprocessors. In RTSS, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. H. S. Negi, T. Mitra, and A. Roychoudhury. Accurate estimation of cache-related preemption delay. In CODES+ISSS, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. F. Nemer, H. Cassé, P. Sainrat, J.-P. Bahsoun, and M. De Michiel. Papabench: a free real-time benchmark. In WCET, 2006.Google ScholarGoogle Scholar
  16. J. Reineke and D. Grund. Relative competitive analysis of cache replacement policies. In LCTES, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. J. Staschulat and R. Ernst. Scalable precision cache analysis for real-time software. ACM TECS, 6(4), 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Y. Tan and V. J.Mooney. Integrated intra- and inter-task cache analysis for preemptive multi-tasking real-time systems. In SCOPES, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  19. H. Tomiyama and N. D. Dutt. Program path analysis to bound cacherelated preemption delay in preemptive real-time systems. In CODES, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Cache-related preemption delay analysis for FIFO caches

        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 SIGPLAN Notices
          ACM SIGPLAN Notices  Volume 49, Issue 5
          LCTES '14
          May 2014
          162 pages
          ISSN:0362-1340
          EISSN:1558-1160
          DOI:10.1145/2666357
          Issue’s Table of Contents
          • cover image ACM Conferences
            LCTES '14: Proceedings of the 2014 SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems
            June 2014
            174 pages
            ISBN:9781450328777
            DOI:10.1145/2597809

          Copyright © 2014 ACM

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 12 June 2014

          Check for updates

          Qualifiers

          • research-article

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

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

        Learn more

        Got it!