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 proceedingArticle in proceedingResearchpeer-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 languageEnglish
Title of host publicationProceedings of the 8th International Workshop on Java Technologies for Real-Time and Embedded Systems : ACM International Conference Proceeding Series
Number of pages7
PublisherAssociation for Computing Machinery
Publication date2010
ISBN (Electronic)978-1-4503-0122-0
DOIs
Publication statusPublished - 2010

Keywords

  • Java
  • finalizers
  • schedulability
  • real-time
  • model checking

Fingerprint Dive into the research topics of 'Schedulability Analysis for Java Finalizers'. Together they form a unique fingerprint.

Cite this