A Time-predictable Object Cache

Martin Schoeberl

doi:10.1109/ISORC.2011.22

A Time-predictable Object Cache

Martin Schoeberl

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

471 Downloads (Pure)

Abstract

Static cache analysis for data allocated on the heap is practically impossible for standard data caches. We propose a distinct object cache for heap allocated data. The cache is highly associative to track symbolic object addresses in the static analysis. Cache lines are organized to hold single objects and individual fields are loaded on a miss. This cache organization is statically analyzable and improves the performance. In this paper we present the design and implementation of the object cache in a uniprocessor and chip-multiprocessor version of the Java processor JOP.

Original language	English
Title of host publication	Proceedings of the 14th IEEE International Symposium on Object/component/service-oriented Real-time distributed Computing (ISORC 2011)
Publication date	2011
DOIs	https://doi.org/10.1109/ISORC.2011.22
Publication status	Published - 2011
Event	14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing - Newport Beach, United States Duration: 28 Mar 2011 → 31 Mar 2011 Conference number: 14 https://ieeexplore.ieee.org/xpl/conhome/5752887/proceeding

Conference

Conference	14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing
Number	14
Country/Territory	United States
City	Newport Beach
Period	28/03/2011 → 31/03/2011
Internet address	https://ieeexplore.ieee.org/xpl/conhome/5752887/proceeding

Access to Document

10.1109/ISORC.2011.22

OcacheSubmitted manuscript, 240 KB

OpenUrl availability

Full text

Cite this

@inproceedings{857dbb7870b94b5298b2e448e8b3bbb9,

title = "A Time-predictable Object Cache",

abstract = "Static cache analysis for data allocated on the heap is practically impossible for standard data caches. We propose a distinct object cache for heap allocated data. The cache is highly associative to track symbolic object addresses in the static analysis. Cache lines are organized to hold single objects and individual fields are loaded on a miss. This cache organization is statically analyzable and improves the performance. In this paper we present the design and implementation of the object cache in a uniprocessor and chip-multiprocessor version of the Java processor JOP.",

author = "Martin Schoeberl",

year = "2011",

doi = "10.1109/ISORC.2011.22",

language = "English",

booktitle = "Proceedings of the 14th IEEE International Symposium on Object/component/service-oriented Real-time distributed Computing (ISORC 2011)",

note = "14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC 2011 ; Conference date: 28-03-2011 Through 31-03-2011",

url = "https://ieeexplore.ieee.org/xpl/conhome/5752887/proceeding",

}

Schoeberl, M 2011, A Time-predictable Object Cache. in Proceedings of the 14th IEEE International Symposium on Object/component/service-oriented Real-time distributed Computing (ISORC 2011). 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, Newport Beach, California, United States, 28/03/2011. https://doi.org/10.1109/ISORC.2011.22

TY - GEN

T1 - A Time-predictable Object Cache

AU - Schoeberl, Martin

N1 - Conference code: 14

PY - 2011

Y1 - 2011

N2 - Static cache analysis for data allocated on the heap is practically impossible for standard data caches. We propose a distinct object cache for heap allocated data. The cache is highly associative to track symbolic object addresses in the static analysis. Cache lines are organized to hold single objects and individual fields are loaded on a miss. This cache organization is statically analyzable and improves the performance. In this paper we present the design and implementation of the object cache in a uniprocessor and chip-multiprocessor version of the Java processor JOP.

AB - Static cache analysis for data allocated on the heap is practically impossible for standard data caches. We propose a distinct object cache for heap allocated data. The cache is highly associative to track symbolic object addresses in the static analysis. Cache lines are organized to hold single objects and individual fields are loaded on a miss. This cache organization is statically analyzable and improves the performance. In this paper we present the design and implementation of the object cache in a uniprocessor and chip-multiprocessor version of the Java processor JOP.

U2 - 10.1109/ISORC.2011.22

DO - 10.1109/ISORC.2011.22

M3 - Article in proceedings

BT - Proceedings of the 14th IEEE International Symposium on Object/component/service-oriented Real-time distributed Computing (ISORC 2011)

T2 - 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing

Y2 - 28 March 2011 through 31 March 2011

ER -

A Time-predictable Object Cache

Abstract

Conference

Access to Document

OpenUrl availability

Fingerprint

Cite this