Schedulability Analysis for Java Finalizers

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

doi:10.1145/1850771.1850772

Schedulability Analysis for Java Finalizers

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

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-review

2 Citations (Scopus)

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.

Original language	English
Title of host publication	Proceedings of the 8th International Workshop on Java Technologies for Real-Time and Embedded Systems : ACM International Conference Proceeding Series
Number of pages	7
Publisher	Association for Computing Machinery
Publication date	2010
ISBN (Electronic)	978-1-4503-0122-0
DOIs	https://doi.org/10.1145/1850771.1850772
Publication status	Published - 2010

Keywords

Java
finalizers
schedulability
real-time
model checking

Access to Document

10.1145/1850771.1850772

AUB Link

Search for the material in Aalborg University Library's search engine

Cite this

@inproceedings{090c036278ff4d4c878a25769407554c,

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 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.",

keywords = "Java, finalizers, schedulability, real-time, model checking",

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

year = "2010",

doi = "10.1145/1850771.1850772",

language = "English",

booktitle = "Proceedings of the 8th International Workshop on Java Technologies for Real-Time and Embedded Systems",

publisher = "Association for Computing Machinery",

address = "United States",

}

Schedulability Analysis for Java Finalizers. / Bøgholm, Thomas; Hansen, Rene Rydhof; Søndergaard, Hans et al.
Proceedings of the 8th International Workshop on Java Technologies for Real-Time and Embedded Systems: ACM International Conference Proceeding Series. Association for Computing Machinery, 2010.

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-review

TY - GEN

T1 - Schedulability Analysis for Java Finalizers

AU - Bøgholm, Thomas

AU - Hansen, Rene Rydhof

AU - Søndergaard, Hans

AU - Ravn, Anders Peter

AU - Thomsen, Bent

PY - 2010

Y1 - 2010

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 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.

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 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.

KW - Java

KW - finalizers

KW - schedulability

KW - real-time

KW - model checking

U2 - 10.1145/1850771.1850772

DO - 10.1145/1850771.1850772

M3 - Article in proceeding

BT - Proceedings of the 8th International Workshop on Java Technologies for Real-Time and Embedded Systems

PB - Association for Computing Machinery

ER -

Schedulability Analysis for Java Finalizers

Abstract

Keywords

Access to Document

AUB Link

Fingerprint

Cite this