Scoped types and aspects for real-time Java memory management

Andreae, Chris; Coady, Yvonne; Gibbs, Celina; Noble, James; Vítek, Jan; Zhao, Tian

doi:10.1007/s11241-007-9024-3

Cited by 23 publications

(17 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Pizlo et al [42] presented an informal introduction to the semantics of the scoped management rules of the RTSJ, and it also provided a group of design patterns which can be applied to achieve a higher efficiency of scoped memory. Andreae [43] provided a complete programming model of the scoped memory model to simplify the memory analysis that has to be done by developers. Bypassing GC is proved to be easy to apply to existing JVMs and brings small overhead to runtime memory management.…”

Section: A Bypassing Garbage Collectionmentioning

confidence: 99%

Overview of Real-Time Java Computing

Sun¹,

Zhang²

2013

Journal of Computing Science and Engineering

View full text Add to dashboard Cite

This paper presents a complete survey of recent techniques that are applied in the field of real-time Java computing. It focuses on the issues that are especially important for hard real-time applications, which include time predictable garbage collection, worst-case execution time analysis of Java programs, real-time Java threads scheduling and compiler techniques designed for real-time purpose. It also evaluates experimental frameworks that can be used for researching real-time Java. This overview is expected to help researchers understand the state-of-the-art and advance the research in real-time Java computing.

show abstract

Section: A Bypassing Garbage Collectionmentioning

confidence: 99%

Overview of Real-Time Java Computing

Sun¹,

Zhang²

2013

Journal of Computing Science and Engineering

View full text Add to dashboard Cite

show abstract

“…This language has already been adopted for real-time projects in industry and the military [23], [24], and it is becoming a more common topic in real-time systems research [25]- [29]. However, certain run-time characteristics of Java, such as dynamic class loading, make Java more difficult than other languages for conducting WCET analysis.…”

Section: B Software Assumptionsmentioning

confidence: 99%

Fast, Interactive Worst-Case Execution Time Analysis With Back-Annotation

Harmon

Schoeberl²,

Kirner

et al. 2012

IEEE Trans. Ind. Inf.

View full text Add to dashboard Cite

Abstract-For hard real-time systems, static code analysis is needed to derive a safe bound on the worst-case execution time (WCET). Virtually all prior work has focused on the accuracy of WCET analysis without regard to the speed of analysis. The resulting algorithms are often too slow to be integrated into the development cycle, requiring WCET analysis to be postponed until a final verification phase.In this paper we propose interactive WCET analysis as a new method to provide near-instantaneous WCET feedback to the developer during software programming. We show that interactive WCET analysis is feasible using tree-based WCET calculation. The feedback is realized with a plugin for the Java editor jEdit, where the WCET values are back-annotated to the Java source at the statement level. Comparison of this treebased approach with the implicit path enumeration technique (IPET) shows that tree-based analysis scales better with respect to program size and gives similar WCET values.

show abstract

“…It also provided a group of design patterns which can be applied to achieve higher efficiency of the scoped memory. [3] provided a complete programming model of scoped memory model in order to simplify the memory analysis that has to be done by developers. Bypassing GC is proved easy to apply to the existing JVMs and it brings a small overhead to the runtime memory management.…”

Section: Related Workmentioning

confidence: 99%

“…For instance, scoped memory [1][2][3][4] which is manually controlled by developers like in C/ C++, was proposed to take the place of automatic memory management. Instead of dynamic compilation, interpretation or ahead-of-time (AOT) compilation [5][6][7] is used to generate native code from Java byte code.…”

Section: Introductionmentioning

confidence: 99%

Time-Predictable Java Dynamic Compilation on Multicore Processors

Sun

Zhang

2012

Journal of Computing Science and Engineering

View full text Add to dashboard Cite

Java has been increasingly used in programming for real-time systems. However, some of Java's features such as automatic memory management and dynamic compilation are harmful to time predictability. If these problems are not solved properly then it can fundamentally limit the usage of Java for real-time systems, especially for hard real-time systems that require very high time predictability. In this paper, we propose to exploit multicore computing in order to reduce the timing unpredictability that is caused by dynamic compilation and adaptive optimization. Our goal is to retain high performance comparable to that of traditional dynamic compilation, while at the same time, obtain better time predictability for Java virtual machine (JVM). We have studied pre-compilation techniques to utilize another core more efficiently, preoptimization on another core (PoAC) scheme to replace the adaptive optimization system (AOS) in Jikes JVM and the counter based optimization (CBO). Our evaluation reveals that the proposed approaches are able to attain high performance while greatly reducing the variation of the execution time for Java applications.

show abstract

Scoped types and aspects for real-time Java memory management

Cited by 23 publications

References 38 publications

Overview of Real-Time Java Computing

Overview of Real-Time Java Computing

Fast, Interactive Worst-Case Execution Time Analysis With Back-Annotation

Time-Predictable Java Dynamic Compilation on Multicore Processors

Contact Info

Product

Resources

About