<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06061836</id>
  <dt>j</dt>
  <an>06061836</an>
  <augroup>
    <au>Liu, Tiantian</au>
    <au>Li, Minming</au>
    <au>Xue, Chun Jason</au>
  </augroup>
  <ti>Instruction cache locking for multi-task real-time embedded systems.</ti>
  <so>Real-Time Syst. 48, No. 2, 166-197 (2012).</so>
  <py>2012</py>
  <pu>Springer, Norwell, MA</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>real-time systems</ut>
    <ut>embedded systems</ut>
    <ut>worst-case analysis</ut>
    <ut>cache memories</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/s11241-011-9139-4</li>
  </ligroup>
  <abgroup>
    <ab>Summary: 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, semi-dynamic 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.</ab>
    <rv></rv>
  </abgroup>
</item>