Component-wise instruction-cache behavior prediction

A. Rakib; O. Parshin; S. Thesing; R. Wilhelm

doi:10.1007/978-3-540-30476-0_20

Component-wise instruction-cache behavior prediction

A. Rakib, O. Parshin, S. Thesing, R. Wilhelm

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

7 Citations (Scopus)

Abstract

The precise determination of worst-case execution times (WCETs) for programs is mostly being performed on fully linked executables, since all needed information is available and all machine parameters influencing cache performance are available to the analysis. This paper describes how to perform a component-wise prediction of the instruction cache behavior guaranteeing conservative results compared to an analysis of a fully linked executable. This proves the correctness of the method based on a previous proof of correctness of the analysis of fully linked executables. The analysis is described for a general A-way set associative cache. The only assumption is that the replacement strategy is LRU.

Original language	English
Title of host publication	Lecture Notes in Computer Science
Editors	F Wang
Pages	211-229
Number of pages	19
Volume	3299
DOIs	https://doi.org/10.1007/978-3-540-30476-0_20
Publication status	Published - 2004
Externally published	Yes

Bibliographical note

Keywords

Buffer storage
Cache performance
Instruction caches
Machine parameters
Precise determinations
Proof of correctness
Replacement strategy
Set associative cache
Worst-case execution time
Cache memory

Access to Document

10.1007/978-3-540-30476-0_20

Cite this

@inbook{d5a3c2a1f3f24224afe3b794fb947186,

title = "Component-wise instruction-cache behavior prediction",

abstract = "The precise determination of worst-case execution times (WCETs) for programs is mostly being performed on fully linked executables, since all needed information is available and all machine parameters influencing cache performance are available to the analysis. This paper describes how to perform a component-wise prediction of the instruction cache behavior guaranteeing conservative results compared to an analysis of a fully linked executable. This proves the correctness of the method based on a previous proof of correctness of the analysis of fully linked executables. The analysis is described for a general A-way set associative cache. The only assumption is that the replacement strategy is LRU.",

keywords = "Buffer storage, Cache performance, Instruction caches, Machine parameters, Precise determinations, Proof of correctness, Replacement strategy, Set associative cache, Worst-case execution time, Cache memory",

author = "A. Rakib and O. Parshin and S. Thesing and R. Wilhelm",

note = "Copyright {\textcopyright} Elsevier B.V",

year = "2004",

doi = "10.1007/978-3-540-30476-0_20",

language = "English",

isbn = "978-354023610-8",

volume = "3299",

pages = "211--229",

editor = "{Wang }, F",

booktitle = "Lecture Notes in Computer Science",

}

TY - CHAP

T1 - Component-wise instruction-cache behavior prediction

AU - Rakib, A.

AU - Parshin, O.

AU - Thesing, S.

AU - Wilhelm, R.

PY - 2004

Y1 - 2004

N2 - The precise determination of worst-case execution times (WCETs) for programs is mostly being performed on fully linked executables, since all needed information is available and all machine parameters influencing cache performance are available to the analysis. This paper describes how to perform a component-wise prediction of the instruction cache behavior guaranteeing conservative results compared to an analysis of a fully linked executable. This proves the correctness of the method based on a previous proof of correctness of the analysis of fully linked executables. The analysis is described for a general A-way set associative cache. The only assumption is that the replacement strategy is LRU.

AB - The precise determination of worst-case execution times (WCETs) for programs is mostly being performed on fully linked executables, since all needed information is available and all machine parameters influencing cache performance are available to the analysis. This paper describes how to perform a component-wise prediction of the instruction cache behavior guaranteeing conservative results compared to an analysis of a fully linked executable. This proves the correctness of the method based on a previous proof of correctness of the analysis of fully linked executables. The analysis is described for a general A-way set associative cache. The only assumption is that the replacement strategy is LRU.

KW - Buffer storage

KW - Cache performance

KW - Instruction caches

KW - Machine parameters

KW - Precise determinations

KW - Proof of correctness

KW - Replacement strategy

KW - Set associative cache

KW - Worst-case execution time

KW - Cache memory

UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-35048883825&partnerID=MN8TOARS

U2 - 10.1007/978-3-540-30476-0_20

DO - 10.1007/978-3-540-30476-0_20

M3 - Chapter

SN - 978-354023610-8

VL - 3299

SP - 211

EP - 229

BT - Lecture Notes in Computer Science

A2 - Wang , F

ER -

Component-wise instruction-cache behavior prediction

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this