By Topic

An efficient search algorithm of worst-case cache flush timings

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Miyamoto, H. ; Graduate Sch. of Inf. Sci., Nagoya Univ., Aichi, Japan ; Iiyama, S. ; Tomiyama, H. ; Takada, H.
more authors

In recent years, the use of cache memory has been desired in hard real-time systems in order to reduce the memory access time. To enable it, accurate analysis of the worst-case execution time considering cache flushes is necessary since the cache may be flushed by preempting tasks in a multitask environment. This paper proposes a method to find the worst-case timing of cache flushes and demonstrates its effectiveness.

Published in:

Embedded and Real-Time Computing Systems and Applications, 2005. Proceedings. 11th IEEE International Conference on

Date of Conference:

17-19 Aug. 2005