Region-based memory management for real-time Java

Higuera, Teresa; Issarny, Valérie; Banâtre, Michel; Cabillic, Gilbert; Lesot, Jean-Philippe; Parain, Frédéric

doi:10.1109/isorc.2001.922863

Cited by 16 publications

(9 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Beebe and Rinard use this approach [11], and their implementation uses ve runtime heap checks to ensure that a critical real-time thread does not manipulate heap references. Alternatively, the solution proposed in [6] instruments the bytecode interpreter, avoiding space problems, but this still requires a complementary solution to handle native code.…”

Section: Related Workmentioning

confidence: 99%

“…The IllegalAssignment() exception throws when detecting an attempt to make an illegal pointer. Since assignment rules cannot be fully enforced by the compiler, some dangling pointers must be detected at runtime, which requires the introduction of write barriers [6]. That is, to introduce a code checking for dangling pointers when creating an assignment.…”

Section: The Rtsj Memory Modelmentioning

confidence: 99%

See 1 more Smart Citation

Towards an analysis of race carrier conditions in real-time Java

Higuera-Toledano

2006

Proceedings 20th IEEE International Parallel &Amp; Distributed Processing Symposium

View full text Add to dashboard Cite

The RTSJ memory model propose a mechanism based on a scope three containing all region-stacks in the system and a reference-counter collector. In order to avoid reference cycles among regions on the region-stack, RTSJ defines the single parent rule. The given algorithms to maintain the region-stack structure are not compliant with the defined parentage relation. More over, the suggested algorithms to maintain the single parent rule introduces race carrier conditions on the application behaviour. This paper proposes alternative approaches in order to avoid this problem.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: The Rtsj Memory Modelmentioning

confidence: 99%

Towards an analysis of race carrier conditions in real-time Java

Higuera-Toledano

2006

Proceedings 20th IEEE International Parallel &Amp; Distributed Processing Symposium

View full text Add to dashboard Cite

show abstract

“…However, static and dynamic techniques can be combined to provide more robustness and predictability of RTSJ applications. The idea of using both write barrier and a stack of scoped areas ordered by life-times to detect illegal inter-area assignments was first introduced in [4]. The most common approach to implement read/write barriers is by inline code, consisting in generating the instructions executing barrier events for every load/store operation.…”

Section: Related Workmentioning

confidence: 99%

Studying the Behaviour of the Single Parent Rule in Real-Time Java

Higuera-Toledano

2004

On the Move to Meaningful Internet Systems 2004: OTM 2004 Workshops

View full text Add to dashboard Cite

Abstract. This paper addresses the issue of improving the performance of memory management for real-time Java applications, building upon the RealTime Specification for Java (RTSJ). This specification imposes strict assignment rules to or from memory areas preventing the creation of dangling pointers, and thus maintaining the pointer safety of Java. The dynamic issues that Java presents, requires for some cases ensuring the checking of these rules at run-time, which adversely affects both the performance and predictability of the RTSJ application. This paper presents an efficient algorithm for managing scoped areas which requires some modifications in the current RTSJ specification.

show abstract

“…In order to avoid the garbage collector's affection on the execution time and ensure real-time performance, RTSJ provides a more complex memory management system which is different from general Java [10][11]. Four different types of memory are defined in RTSJ, and they are HeapMemory, ScopedMemory, ImmortalMemory and ImmortalPhysicalMemory.…”

Section: Introductionmentioning

confidence: 99%

Optimizing object reference checks on real-time Java virtual machine

Feng

Shi

2015

2015 6th IEEE International Conference on Software Engineering and Service Science (ICSESS)

View full text Add to dashboard Cite

Thanks to Real-Time Specification for Java (RTSJ), Java now can be applied in real-time systems. However, in RTSJ's memory management system, assignment rules which aimed to prevent the creation of dangling references must be checked by real-time Java virtual machines (JVMs) at runtime. These frequent runtime object reference checks lead to additional time overhead and unpredictable running time, which has great impact on real-time systems. This paper presents an equivalence class based, context sensitive and flow insensitive escape analysis algorithm which could eliminate unnecessary runtime reference checkpoints. This optimization framework has been implemented in an open-source real-time JVM jRate 0.3.7.2-3.3.3 and evaluated by CD x , a relative authority real-time Java benchmark suite. The results show that this optimization algorithm eliminates 94.92% static reference checkpoints, on average removes 42.28%~54.44% runtime reference checkpoints, and improves the runtime performance of average 3.13%, max 8.93%.

show abstract

Region-based memory management for real-time Java

Cited by 16 publications

References 7 publications

Towards an analysis of race carrier conditions in real-time Java

Towards an analysis of race carrier conditions in real-time Java

Studying the Behaviour of the Single Parent Rule in Real-Time Java

Optimizing object reference checks on real-time Java virtual machine

Contact Info

Product

Resources

About