Abstract
Locking cache lines in hard real-time systems is a common means of achieving predictability of cache access behavior and tightening as well as reducing worst case execution time, especially in a multitasking environment. However, cache locking poses a challenge for multi-core hard real-time systems since theoretically optimal scheduling techniques on multi-core architectures assume zero cost for task migration. Tasks with locked cache lines need to proactively migrate these lines before the next invocation of the task. Otherwise, cache locking on multi-core architectures becomes useless as predictability is compromised.
This paper proposes hardware-based push-assisted cache migration as a means to retain locks on cache lines across migrations. We extend the push-assisted migration model with several cache migration techniques to efficiently retain locked cache lines on a bus-based chip multi-processor architecture. We also provide deterministic migration delay bounds that help the scheduler decide which migration technique(s) to utilize to relocate a single or multiple tasks. This information also allows the scheduler to determine feasibility of task migrations, which is critical for the safety of any hard real-time system. Such proactive migration of locked cache lines in multi-cores is unprecedented to our knowledge.
- Hypertransport technology. http://www.hypertransport.org.Google Scholar
- Tilera processor family. http://www.tilera.com/products/processors.php.Google Scholar
- Wcet project benchmarks, 2007. http://www.mrtc.mdh.se/projects/-wcetbenchmarks.html.Google Scholar
- A. Acquaviva, A. Alimonda, S. Carta, and M. Pittau. Assessing task migration impact on embedded soft real-time streaming multimedia applications. EURASIP J. Embedded Syst., 2008(2):1--15, 2008. Google Scholar
Digital Library
- J. Anderson, J. Calandrino, and U. Devi. Real-time scheduling on multicore platforms. In IEEE Real-Time Embedded Technology and Applications Symposium, pages 179--190, April 2006. Google Scholar
Digital Library
- J. Anderson and A. Srinivasan. Mixed pfair/erfair scheduling of asynchronous periodic tasks. In Euromicro Conference on Real-Time Systems, pages 76--85, June 2001. Google Scholar
Digital Library
- S. Baruah. Techniques for multiprocessor global schedulability analysis. In IEEE Real-Time Systems Symposium, 2007. Google Scholar
Digital Library
- S. Baruah, N. Cohen, C.G. Plaxton, and D. Varvel. Proportionate progress: A notion of fairness in resource allocation. Algorithmica, 15:600--625, 1996.Google Scholar
Digital Library
- S. Bertozzi, A. Acquaviva, D. Bertozzi, and A. Poggiali. Supporting task migration in multi-processor systems-on-chip: a feasibility study. In Design, Automation and Test in Europe, pages 15--20, 2006. Google Scholar
Digital Library
- J. Calandrino and J. Anderson. Cache-aware real-time scheduling on multicore platforms: Heuristics and a case study. In Euromicro Conference on Real-Time Systems, pages 209--308, July 2008. Google Scholar
Digital Library
- D. Choffnes, M. Astley, and M. J. Ward. Migration policies for multicore fair-share scheduling. ACM SIGOPS Operating Systems Review, 42:92--93, 2008. Google Scholar
Digital Library
- S.K. Dhall and C.L. Liu. On a real-time scheduling problem. Operations Research, 26(1):127--140, 1978.Google Scholar
Digital Library
- Noel Eisley, Li-Shiuan Peh, and Li Shang. Leveraging on-chip networks for data cache migration in chip multiprocessors. In International conference on Parallel architectures and compilation techniques, pages 197--207, 2008. Google Scholar
Digital Library
- D. Hardy and I. Puaut. Estimation of cache related migration delays for multi-core processors with shared instruction caches. In Proceedings of the 17th Real-Time and Network Systems, Paris, France, 2009.Google Scholar
- T. Li, D. Baumberger, D. A. Koufaty, and S. Hahn. Efficient operating system scheduling for performance-asymmetric multi-core architectures. In International Conference on Supercomputing, pages 1--11, November 2007. Google Scholar
Digital Library
- M. Moir and S. Ramamurthy. Pfair scheduling of fixed and migrating periodic tasks on multiple resources. In IEEE Real-Time Systems Symposium, pages 294--303, December 1999. Google Scholar
Digital Library
- Isabelle Puaut. Wcet-centric software-controlled instruction caches for hard real-time systems. In Euromicro Conference on Real-Time Systems, pages 217--226, 2006. Google Scholar
Digital Library
- Isabelle Puaut and David Decotigny. Low-complexity algorithms for static cache locking in multitasking hard real-time systems. In Real- Time Systems, pages 114--123, 2002. Google Scholar
Digital Library
- Isabelle Puaut and Christophe Pais. Scratchpad memories vs locked caches in hard real-time systems: a quantitative comparison. In Design, Automation and Test in Europe, pages 1484--1489, San Jose, CA, USA, 2007. EDA Consortium. Google Scholar
Digital Library
- H. Ramaprasad and F. Mueller. Tightening the bounds on feasible preemptions. Transactions on Embedded Computing Systems, 2008. Google Scholar
Digital Library
- J. Rattner. Tera-scale research program. In Intel Dev. Forum, 2006.Google Scholar
- J. Renau, B. Fragela, J. Tuck, W. Liu, L. Ceze, S. Sarangi, P. Sack, and and P. Montesinos K. Strauss. Sesc simulator. http://sesc.sourceforge.net, Jan. 2005.Google Scholar
- A. Sarkar, F. Mueller, H. Ramaprasad, and S. Mohan. Push-assisted migration of real-time tasks in multi-core processors. In ACM SIGPLAN Conference on Language, Compiler, and Tool Support for Embedded Systems, pages 80--89, New York, NY, USA, 2009. ACM. Google Scholar
Digital Library
- A. Srinivasan and J. Anderson. Optimal rate-based scheduling on multiprocessors. In ACM Symposium on Theory of Computing, pages 189--198, May 2002. Google Scholar
Digital Library
- J. Staschulat, S. Schliecker, and R. Ernst. Scheduling analysis of realtime systems with precise modeling of cache related preemption delay. In Euromicro Conference on Real-Time Systems, pages 41--48, 2005. Google Scholar
Digital Library
- Vivy Suhendra and Tulika Mitra. Exploring locking & partitioning for predictable shared caches on multi-cores. In Design Automation Conference, pages 300--303, New York, NY, USA, 2008. ACM. Google Scholar
Digital Library
- X. Vera, B. Lisper, and J. Xue. Data caches in multitasking hard realtime systems. In IEEE Real-Time Systems Symposium, 2003. Google Scholar
Digital Library
- E. Wandeler and L. Thiele. Optimal tdma time slot and cycle length allocation for hard real-time systems. In Proceedings of Asia and South Pacific Design Automation Conference, Yokohama, Japan, 2006. Google Scholar
Digital Library
Index Terms
Predictable task migration for locked caches in multi-core systems
Recommendations
Predictable task migration for locked caches in multi-core systems
LCTES '11: Proceedings of the 2011 SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systemsLocking cache lines in hard real-time systems is a common means of achieving predictability of cache access behavior and tightening as well as reducing worst case execution time, especially in a multitasking environment. However, cache locking poses a ...
Predictable Shared Cache Management for Multi-Core Real-Time Virtualization
Special Issue on Autonomous Battery-Free Sensing and Communication, Special Issue on ESWEEK 2016 and Regular PapersReal-time virtualization has gained much attention for the consolidation of multiple real-time systems onto a single hardware platform while ensuring timing predictability. However, a shared last-level cache (LLC) on modern multi-core platforms can ...
Static task partitioning for locked caches in multi-core real-time systems
CASES '12: Proceedings of the 2012 international conference on Compilers, architectures and synthesis for embedded systemsLocking cache lines in hard real-time systems is a common means to ensure timing predictability of data references and to lower bounds on worst-case execution time, especially in a multi-tasking environment. Growing processing demand on multi-tasking ...







Comments