IEICE TRANSACTIONS on Information
ILP-Based Program Path Analysis for Bounding Worst-Case Inter-Task Cache Conflicts
Summary :
The unpredictable behavior of cache memory makes it difficult to statically analyze the worst-case performance of real-time systems. This problem is further exacerbated in the case of preemptive multitask systems because of inter-task cache interference, called Cache-Related Preemption Delay (CRPD). This paper proposes an approach to analyzing the tight upper bound on CRPD which a task might impose on lower-priority tasks. Our method finds the program execution path which requires the maximum number of cache blocks using an integer linear programming technique. Experimental results show that our approach provides up to 69% tighter bounds on CRPD than a conservative approach.
- Publication
- IEICE TRANSACTIONS on Information Vol.E87-D No.6 pp.1582-1587
- Publication Date
- 2004/06/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- System Programs
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hiroyuki TOMIYAMA, Nikil DUTT, "ILP-Based Program Path Analysis for Bounding Worst-Case Inter-Task Cache Conflicts" in IEICE TRANSACTIONS on Information,
vol. E87-D, no. 6, pp. 1582-1587, June 2004, doi: .
Abstract: The unpredictable behavior of cache memory makes it difficult to statically analyze the worst-case performance of real-time systems. This problem is further exacerbated in the case of preemptive multitask systems because of inter-task cache interference, called Cache-Related Preemption Delay (CRPD). This paper proposes an approach to analyzing the tight upper bound on CRPD which a task might impose on lower-priority tasks. Our method finds the program execution path which requires the maximum number of cache blocks using an integer linear programming technique. Experimental results show that our approach provides up to 69% tighter bounds on CRPD than a conservative approach.
URL: https://global.ieice.org/en_transactions/information/10.1587/e87-d_6_1582/_p
Copy
@ARTICLE{e87-d_6_1582,
author={Hiroyuki TOMIYAMA, Nikil DUTT, },
journal={IEICE TRANSACTIONS on Information},
title={ILP-Based Program Path Analysis for Bounding Worst-Case Inter-Task Cache Conflicts},
year={2004},
volume={E87-D},
number={6},
pages={1582-1587},
abstract={The unpredictable behavior of cache memory makes it difficult to statically analyze the worst-case performance of real-time systems. This problem is further exacerbated in the case of preemptive multitask systems because of inter-task cache interference, called Cache-Related Preemption Delay (CRPD). This paper proposes an approach to analyzing the tight upper bound on CRPD which a task might impose on lower-priority tasks. Our method finds the program execution path which requires the maximum number of cache blocks using an integer linear programming technique. Experimental results show that our approach provides up to 69% tighter bounds on CRPD than a conservative approach.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - ILP-Based Program Path Analysis for Bounding Worst-Case Inter-Task Cache Conflicts
T2 - IEICE TRANSACTIONS on Information
SP - 1582
EP - 1587
AU - Hiroyuki TOMIYAMA
AU - Nikil DUTT
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E87-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 2004
AB - The unpredictable behavior of cache memory makes it difficult to statically analyze the worst-case performance of real-time systems. This problem is further exacerbated in the case of preemptive multitask systems because of inter-task cache interference, called Cache-Related Preemption Delay (CRPD). This paper proposes an approach to analyzing the tight upper bound on CRPD which a task might impose on lower-priority tasks. Our method finds the program execution path which requires the maximum number of cache blocks using an integer linear programming technique. Experimental results show that our approach provides up to 69% tighter bounds on CRPD than a conservative approach.
ER -
English
