Schedulability Analysis for Java Finalizers

Thomas Bøgholm; Rene Rydhof Hansen; Anders P. Ravn; Bent Thomsen; Hans Søndergaard

Schedulability Analysis for Java Finalizers

Thomas Bøgholm, Rene Rydhof Hansen, Anders P. Ravn, Bent Thomsen, Hans Søndergaard

Publikation: Konferencebidrag uden forlag/tidsskrift › Paper/skriftligt oplæg › Forskning

Abstract

Java finalizers perform clean-up and finalisation of objects at garbage collection time. In real-time Java profiles the use of finalizers is either discouraged (RTSJ, Ravenscar Java) or even disallowed (JSR-302), mainly because of the unpredictability of finalizers and in particular their impact on the schedulability analysis. In this paper we show that a controlled scoped memory model results in a structured and predictable execution of finalizers, more reminiscent of
C++ destructors than Java finalizers. Furthermore, we incorporate finalizers into a (conservative) schedulability analysis for Predictable Java programs. Finally, we extend the SARTS tool for automated schedulability analysis of Java bytecode programs to handle finalizers in a fully automated way.

Originalsprog	Engelsk
Publikationsdato	aug. 2010
Antal sider	7
Status	Udgivet - aug. 2010
Begivenhed	The 8th International Workshop on Java Technologies for Real-time and Embedded Systems - Prag, Tjekkiet Varighed: 19 aug. 2010 → 21 aug. 2010 Konferencens nummer: 8

Konference

Konference	The 8th International Workshop on Java Technologies for Real-time and Embedded Systems
Nummer	8
Land	Tjekkiet
By	Prag
Periode	19/08/10 → 21/08/10

Emneord

it

Adgang til dokumentet

http://dl.acm.org/citation.cfm?id=1850772

Citationsformater

@conference{40b747fbafb34ef6afff7587b39248b5,

title = "Schedulability Analysis for Java Finalizers",

abstract = "Java finalizers perform clean-up and finalisation of objects at garbage collection time. In real-time Java profiles the use of finalizers is either discouraged (RTSJ, Ravenscar Java) or even disallowed (JSR-302), mainly because of the unpredictability of finalizers and in particular their impact on the schedulability analysis. In this paper we show that a controlled scoped memory model results in a structured and predictable execution of finalizers, more reminiscent ofC++ destructors than Java finalizers. Furthermore, we incorporate finalizers into a (conservative) schedulability analysis for Predictable Java programs. Finally, we extend the SARTS tool for automated schedulability analysis of Java bytecode programs to handle finalizers in a fully automated way.",

keywords = "it",

author = "Thomas B{\o}gholm and Hansen, {Rene Rydhof} and Ravn, {Anders P.} and Bent Thomsen and Hans S{\o}ndergaard",

year = "2010",

month = aug,

language = "English",

note = "The 8th International Workshop on Java Technologies for Real-time and Embedded Systems, JTRES 2010 ; Conference date: 19-08-2010 Through 21-08-2010",

}

TY - CONF

T1 - Schedulability Analysis for Java Finalizers

AU - Bøgholm, Thomas

AU - Hansen, Rene Rydhof

AU - Ravn, Anders P.

AU - Thomsen, Bent

AU - Søndergaard, Hans

N1 - Conference code: 8

PY - 2010/8

Y1 - 2010/8

N2 - Java finalizers perform clean-up and finalisation of objects at garbage collection time. In real-time Java profiles the use of finalizers is either discouraged (RTSJ, Ravenscar Java) or even disallowed (JSR-302), mainly because of the unpredictability of finalizers and in particular their impact on the schedulability analysis. In this paper we show that a controlled scoped memory model results in a structured and predictable execution of finalizers, more reminiscent ofC++ destructors than Java finalizers. Furthermore, we incorporate finalizers into a (conservative) schedulability analysis for Predictable Java programs. Finally, we extend the SARTS tool for automated schedulability analysis of Java bytecode programs to handle finalizers in a fully automated way.

AB - Java finalizers perform clean-up and finalisation of objects at garbage collection time. In real-time Java profiles the use of finalizers is either discouraged (RTSJ, Ravenscar Java) or even disallowed (JSR-302), mainly because of the unpredictability of finalizers and in particular their impact on the schedulability analysis. In this paper we show that a controlled scoped memory model results in a structured and predictable execution of finalizers, more reminiscent ofC++ destructors than Java finalizers. Furthermore, we incorporate finalizers into a (conservative) schedulability analysis for Predictable Java programs. Finally, we extend the SARTS tool for automated schedulability analysis of Java bytecode programs to handle finalizers in a fully automated way.

KW - it

M3 - Paper

T2 - The 8th International Workshop on Java Technologies for Real-time and Embedded Systems

Y2 - 19 August 2010 through 21 August 2010

ER -