research-article

On transforming Java-like programs into memory-predictable code

Authors:

Diego Garbervetsky,

Víctor Braberman,

Martín Rouaux,

Alejandro TaboadaAuthors Info & Claims

JTRES '09: Proceedings of the 7th International Workshop on Java Technologies for Real-Time and Embedded Systems

Pages 140 - 149

https://doi.org/10.1145/1620405.1620426

Published: 23 September 2009 Publication History

Abstract

The ScopedMemory class of the RTSJ enables the organization of objects into regions. This ensures time-predictable management of dynamic memory. Using scopes forces the programmer to reason in terms of locality, to comply with RTSJ restrictions. The programmer is also faced with the problem of providing upper-bounds for regions. Without appropriate compile-time support, scoped-memory management may lead to unexpected runtime errors.

This work presents the integration of a series of compile-time analysis techniques to help identifying memory regions, their sizes, and overall memory usage. First, the tool synthesizes a scoped-based memory organization where regions are associated with methods. Second, it infers their sizes in parametric forms in terms of relevant program variables. Third, it exhibits a parametric upper-bound on the total amount of memory required to run a method. We present some preliminary results showing that semi-automatic, tool-assisted generation of scoped-based code is both helpful and doable.

References

[1]

E. Albert, P. Arenas, S. Genaim, G. Puebla, and D. Zanardini. Cost analysis of java bytecode. ESOP, volume 4421 of LNCS, pages 157--172. Springer, 2007.

Digital Library

[2]

E. Albert, S. Genaim, and M. Gómez-Zamalloa. Live heap space analysis for languages with garbage collection. In ISMM, pages 129--138, 2009.

Digital Library

[3]

B. Alpern, S. Augart, S. M. Blackburn, M. Butrico, A. Cocchi, P. Cheng, J. Dolby, S. Fink, D. Grove, M. Hind, et al. The Jikes research virtual machine project: building an open-source research community. IBM Systems Journal, 44(2):399--417, 2005.

Digital Library

[4]

D. Bacon, P. Cheng, and V. T. Rajan. Controlling fragmentation and space consumption in the metronome, a real-time garbage collector for java. In LCTES '03, pages 81--92.

Digital Library

[5]

V. Braberman, F. Fernández, D. Garbervetsky, and S. Yovine. Parametric prediction of heap memory requirements. In ISMM '08, pages 141--150.

Digital Library

[6]

V. Braberman, D. Garbervetsky, and S. Yovine. A static analysis for synthesizing parametric specifications of dynamic memory consumption. Journal of Object Technology, 5(5):31--58, 2006.

[7]

B. Cahoon and K. S. McKinley. Data flow analysis for software prefetching linked data structures in java controller. In PACT 2001, pages 280--291, 2001.

Digital Library

[8]

S. Cherem and R. Rugina. Region analysis and transformation for Java programs. ISMM'04, 2004.

Digital Library

[9]

W. Chin, H. H. Nguyen, S. Qin, and M. Rinard. Memory usage verification for oo programs. In SAS 05, 2005.

Digital Library

[10]

W. N. Chin, H. H. Nguyen, C. Popeea, and S. Qin. Analysing Memory Resource Bounds for Low-Level Programs. In ISMM '08), pages 151--160.

Digital Library

[11]

P. Clauss. Counting solutions to linear and nonlinear constraints through ehrhart polynomials: Applications to analyze and transform scientific programs. In ICS'96, pages 278--285, 1996.

Digital Library

[12]

Ph. Clauss and I. Tchoupaeva. A symbolic approach to bernstein expansion for program analysis and optimization. In CC 04, LNCS, pages 120--133.

[13]

M. Deters and R. K. Cytron. Automated discovery of scoped memory regions for real-time java. In ISMM 02, pages 25--35, 2002.

Digital Library

[14]

M. Ernst, J. Perkins, P. Guo, S. McCamant, C. Pacheco, M. Tschantz, and Ch. Xiao. The Daikon system for dynamic detection of likely invariants. Science of Computer Programming, 2007.

Digital Library

[15]

A. Ferrari, D. Garbervetsky, V. Braberman, P. Listingart, and S. Yovine. Jscoper: Eclipse support for research on scoping and instrumentation for real time java applications. In eTx '05, pages 50--54.

Digital Library

[16]

D. Garbervetsky. Parametric specification of dymamic memory utilization. PhD thesis, DC, FCEyN, UBA, November 2007.

[17]

D. Garbervetsky, Ch. Nakhli, S. Yovine, and H. Zorgati. Program instrumentation and run-time analysis of scoped memory in Java. RV 04, ENTCS, Spain.

Digital Library

[18]

D. Gay and A. Aiken. Language support for regions. In PLDI 01, pages 70--80, 2001.

Digital Library

[19]

James Gosling and Greg Bollella. The Real-Time Specification for Java. Addison-Wesley Longman Publishing Co., Inc., 2000.

Digital Library

[20]

R. Henriksson. Scheduling garbage collection in embedded systems. PhD. Thesis, Lund Institute of Technology, 1998.

[21]

F. Nielson, H. Nielson, and Ch. Hankin. Principles of Program Analysis. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 1999.

Digital Library

[22]

K. Nilsen. Improving abstraction, encapsulation, and performance within mixed-mode real-time Java applications. In JTRES 2007, pages 13--22.

Digital Library

[23]

F. Pizlo, J. Fox, D. Holmes, and J. Vitek. Real-time Java scoped memory: design patterns and semantics. In ISORC '04, Austria.

[24]

G. Salagnac, Ch. Rippert, and S. Yovine. Semi-automatic region-based memory management for real-time java embedded systems. In RTCSA '07, 2007.

Digital Library

[25]

G. Salagnac, S. Yovine, and D. Garbervetsky. Fast escape analysis for region-based memory management. ENTCS, 131:99--110, 2005.

Digital Library

[26]

A. Salcianu and M. Rinard. Pointer and escape analysis for multithreaded programs. In PPoPP 01, volume 36, pages 12--23, 2001.

Digital Library

[27]

Fridtjof Siebert. Hard real-time garbage-collection in the jamaica virtual machine. rtcsa, 00:96, 1999.

[28]

M. Tofte and J. P. Talpin. Region-based memory management. Information and Computation, 1997.

Digital Library

[29]

R. Vallée-Rai, L. Hendren, V. Sundaresan, P. Lam, E. Gagnon, and P. Co. Soot - A java optimization framework. In CASCON'99, pages 125--135, 1999.

Cited By

Geldenhuys JDwyer MVisser WHeimdahl MSu Z(2012)Probabilistic symbolic executionProceedings of the 2012 International Symposium on Software Testing and Analysis10.1145/2338965.2336773(166-176)Online publication date: 15-Jul-2012
https://dl.acm.org/doi/10.1145/2338965.2336773
Sundararaman SZhang YSubramanian SArpaci-Dusseau AArpaci-Dusseau R(2012)Making the common case the only case with anticipatory memory allocationACM Transactions on Storage10.1145/2078861.20788637:4(1-24)Online publication date: 2-Feb-2012
https://dl.acm.org/doi/10.1145/2078861.2078863
Sundararaman SZhang YSubramanian SArpaci-Dusseau AArpaci-Dusseau RGanger GWilkes J(2011)Making the common case the only case with anticipatory memory allocationProceedings of the 9th USENIX conference on File and stroage technologies10.5555/1960475.1960492(17-17)Online publication date: 15-Feb-2011
https://dl.acm.org/doi/10.5555/1960475.1960492
Show More Cited By

Index Terms

On transforming Java-like programs into memory-predictable code
1. Computer systems organization
  1. Embedded and cyber-physical systems
    1. Embedded systems
2. Software and its engineering
  1. Software notations and tools
    1. Compilers
    2. General programming languages
      1. Language types
  2. Software organization and properties
    1. Software system structures
      1. Embedded software
      2. Real-time systems software

Recommendations

A study of Java's non-Java memory
OOPSLA '10: Proceedings of the ACM international conference on Object oriented programming systems languages and applications

A Java application sometimes raises an out-of-memory ex-ception. This is usually because it has exhausted the Java heap. However, a Java application can raise an out-of-memory exception when it exhausts the memory used by Java that is not in the Java ...
A study of Java's non-Java memory
OOPSLA '10

A Java application sometimes raises an out-of-memory ex-ception. This is usually because it has exhausted the Java heap. However, a Java application can raise an out-of-memory exception when it exhausts the memory used by Java that is not in the Java ...
Write-once-memory-code phase change memory
DATE '14: Proceedings of the conference on Design, Automation & Test in Europe

This paper describes a write-once-memory-code phase change memory (WOM-code PCM) architecture for next-generation non-volatile memory applications. Specifically, we address the long latency of the write operation in PCM --- attributed to PCM SET --- by ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

JTRES '09: Proceedings of the 7th International Workshop on Java Technologies for Real-Time and Embedded Systems

September 2009

194 pages

ISBN:9781605587325

DOI:10.1145/1620405

Conference Chair:
M. Teresa Higuera-Toledano
Universidad Complutense de Madrid
,
Program Chair:
Martin Schoeberl
Vienna University of Technology

Copyright © 2009 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Universidad Complutense de Madrid
aicas GmbH
Sun: Sun

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 September 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Funding Sources

Agencia Nacional de Promoción Científica y Tecnológica

Conference

JTRES '09

Sponsor:

Sun

JTRES '09: JTRES '09 -Proceedings of the 7th International Workshop on Java Technologies for Real-time and Embedded Systems

September 23 - 25, 2009

Madrid, Spain

Acceptance Rates

Overall Acceptance Rate 50 of 70 submissions, 71%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
121
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Geldenhuys JDwyer MVisser WHeimdahl MSu Z(2012)Probabilistic symbolic executionProceedings of the 2012 International Symposium on Software Testing and Analysis10.1145/2338965.2336773(166-176)Online publication date: 15-Jul-2012
https://dl.acm.org/doi/10.1145/2338965.2336773
Sundararaman SZhang YSubramanian SArpaci-Dusseau AArpaci-Dusseau R(2012)Making the common case the only case with anticipatory memory allocationACM Transactions on Storage10.1145/2078861.20788637:4(1-24)Online publication date: 2-Feb-2012
https://dl.acm.org/doi/10.1145/2078861.2078863
Sundararaman SZhang YSubramanian SArpaci-Dusseau AArpaci-Dusseau RGanger GWilkes J(2011)Making the common case the only case with anticipatory memory allocationProceedings of the 9th USENIX conference on File and stroage technologies10.5555/1960475.1960492(17-17)Online publication date: 15-Feb-2011
https://dl.acm.org/doi/10.5555/1960475.1960492
Kalibera TPizlo FHosking AVitek J(2011)Scheduling real-time garbage collection on uniprocessorsACM Transactions on Computer Systems10.1145/2003690.200369229:3(1-29)Online publication date: 30-Aug-2011
https://dl.acm.org/doi/10.1145/2003690.2003692

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten