loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05)
An Efficient Search Algorithm of Worst-Case Cache Flush Timings
Hong Kong, China
August 17-August 19
ISBN: 0-7695-2346-3
ASCII Text
x 
 
Hiroshi Miyamoto, Shinichi Iiyama, Hiroyuki Tomiyama, Hiroaki Takada, Hiroshi Nakashima, "An Efficient Search Algorithm of Worst-Case Cache Flush Timings," Real-Time Computing Systems and Applications, International Workshop on, pp. 45-52, 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/RTCSA.2005.22,
author = {Hiroshi Miyamoto and Shinichi Iiyama and Hiroyuki Tomiyama and Hiroaki Takada and Hiroshi Nakashima},
title = {An Efficient Search Algorithm of Worst-Case Cache Flush Timings},
journal ={Real-Time Computing Systems and Applications, International Workshop on},
volume = {0},
year = {2005},
issn = {1533-2306},
pages = {45-52},
doi = {http://doi.ieeecomputersociety.org/10.1109/RTCSA.2005.22},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Real-Time Computing Systems and Applications, International Workshop on
TI - An Efficient Search Algorithm of Worst-Case Cache Flush Timings
SN - 1533-2306
SP45
EP52
A1 - Hiroshi Miyamoto,
A1 - Shinichi Iiyama,
A1 - Hiroyuki Tomiyama,
A1 - Hiroaki Takada,
A1 - Hiroshi Nakashima,
PY - 2005
KW - null
VL - 0
JA - Real-Time Computing Systems and Applications, International Workshop on
ER -
 
Hiroshi Miyamoto, Nagoya University
Shinichi Iiyama, Toyohashi University of Technology
Hiroyuki Tomiyama, Nagoya University
Hiroaki Takada, Nagoya University
Hiroshi Nakashima, Toyohashi University of Technology
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.
Citation:
Hiroshi Miyamoto, Shinichi Iiyama, Hiroyuki Tomiyama, Hiroaki Takada, Hiroshi Nakashima, "An Efficient Search Algorithm of Worst-Case Cache Flush Timings," rtcsa, pp.45-52, 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.