TY - JOUR
T1 - Instruction cache locking for multi-task real-time embedded systems
AU - Liu, Tiantian
AU - Li, Minming
AU - Xue, Chun Jason
PY - 2012/3
Y1 - 2012/3
N2 - In a multi-task embedded system, a cache is shared by different tasks, which increases the complexity of cache management and the unpredictability of cache behavior. This unpredictability in turn brings an overestimation of application's worst-case execution time (WCET) and worst-case CPU utilization (WCU) which are two of the most important criteria for real-time embedded systems. Modern processors often provide cache locking capability, which can be applied statically and dynamically to manage cache in a predictable manner. The selection of instructions to be locked in the instruction cache (I-Cache) has dramatic influence on the system performance. This paper focuses on applying cache locking techniques to the shared I-Cache to minimize WCU for multi-task embedded systems.We analyze and compare three different strategies to perform I-Cache locking: static locking, semidynamic locking, and dynamic locking. Different algorithms are proposed utilizing the foreknown information of embedded applications. Experimental results show that the proposed algorithms can reduce WCU compared to previous techniques. © Springer Science+Business Media, LLC 2011.
AB - In a multi-task embedded system, a cache is shared by different tasks, which increases the complexity of cache management and the unpredictability of cache behavior. This unpredictability in turn brings an overestimation of application's worst-case execution time (WCET) and worst-case CPU utilization (WCU) which are two of the most important criteria for real-time embedded systems. Modern processors often provide cache locking capability, which can be applied statically and dynamically to manage cache in a predictable manner. The selection of instructions to be locked in the instruction cache (I-Cache) has dramatic influence on the system performance. This paper focuses on applying cache locking techniques to the shared I-Cache to minimize WCU for multi-task embedded systems.We analyze and compare three different strategies to perform I-Cache locking: static locking, semidynamic locking, and dynamic locking. Different algorithms are proposed utilizing the foreknown information of embedded applications. Experimental results show that the proposed algorithms can reduce WCU compared to previous techniques. © Springer Science+Business Media, LLC 2011.
KW - Cache memories
KW - Real-time and embedded systems
KW - Worst-case analysis
UR - http://www.scopus.com/inward/record.url?scp=84861792435&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84861792435&origin=recordpage
U2 - 10.1007/s11241-011-9139-4
DO - 10.1007/s11241-011-9139-4
M3 - RGC 21 - Publication in refereed journal
SN - 0922-6443
VL - 48
SP - 166
EP - 197
JO - Real-Time Systems
JF - Real-Time Systems
IS - 2
ER -