Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/OASIcs.WCET.2017.2
URN: urn:nbn:de:0030-drops-73050
URL: https://drops.dagstuhl.de/opus/volltexte/2017/7305/
Schoeberl, Martin ; Cilku, Bekim ; Prokesch, Daniel ; Puschner, Peter
Best Practice for Caching of Single-Path Code
| pdf-format: |
|
Abstract
Single-path code has some unique properties that make it interesting to explore different caching and prefetching alternatives for the stream of instructions. In this paper, we explore different cache organizations and how they perform with single-path code.
BibTeX - Entry
@InProceedings{schoeberl_et_al:OASIcs:2017:7305,
author = {Martin Schoeberl and Bekim Cilku and Daniel Prokesch and Peter Puschner},
title = {{Best Practice for Caching of Single-Path Code}},
booktitle = {17th International Workshop on Worst-Case Execution Time Analysis (WCET 2017)},
pages = {2:1--2:12},
series = {OpenAccess Series in Informatics (OASIcs)},
ISBN = {978-3-95977-057-6},
ISSN = {2190-6807},
year = {2017},
volume = {57},
editor = {Jan Reineke},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7305},
URN = {urn:nbn:de:0030-drops-73050},
doi = {10.4230/OASIcs.WCET.2017.2},
annote = {Keywords: single-path code, method cache, prefetching}
}
| Keywords: | single-path code, method cache, prefetching | |
| Seminar: | 17th International Workshop on Worst-Case Execution Time Analysis (WCET 2017) | |
| Issue date: | 2017 | |
| Date of publication: | 23.06.2017 |
