ACM Home Page
Please provide us with feedback. Feedback
Live memory analysis for garbage collection in embedded systems
Full text PdfPdf (1.15 MB)
Source Language, Compiler and Tool Support for Embedded Systems archive
Proceedings of the ACM SIGPLAN 1999 workshop on Languages, compilers, and tools for embedded systems table of contents
Atlanta, Georgia, United States
Pages: 45 - 54  
Year of Publication: 1999
ISBN:1-58113-136-4
Also published in ...
Author
Patrik Persson  Department of Computer Science, Lund University, Box 118, SE-221 00 Lund, Sweden
Sponsor
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 28,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/314403.314440
What is a DOI?

ABSTRACT

Real-time garbage collection is essential if object-oriented languages (in particular, Java) are to become predictable enough for real-time embedded systems. Although techniques for hard real-time garbage collection exist, they are based on estimations of the maximum amount of referenced (live) memory. Such estimations may be difficult to derive manually for complex programs.We present techniques for predicting the maximum amount of live memory in object-oriented languages with inheritance and virtual methods. Annotations are used to bound recursively defined data structures. The annotations may also be used for timing analysis of code traversing annotated structures.A prototype live memory analysis tool has been developed. The tool interactively provides predictions of the maximum amount of live memory referenced from an arbitrary reference or block in an object-oriented program.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
P. Altenbernd. On the False Path Problem in Hard Real-Time Programs. Proceedings of the 8th Euromicro Workshop on Real-Time Systems, 1996.
 
2
E. Bjarnason. Interactive Tool Support .for Domain-Specific Languages. Licentiate Thesis, Department of Computer Science, Lund University, December 1997.
 
3
4
 
5
 
6
 
7
 
8
G. Hedin. Reference Attributed Grammars. In D. Parigot and M. Mernik (editors): Proceedings o.f WAGA '99, Second Workshop on Attribute Grammars and their Applications, pages 153-172. Amsterdam, The Netherlands, March 1999. INRIA Rocquencourt.
9
 
10
R. Henriksson. Scheduling Garbage Collection in Embedded Systems. Ph. D. Thesis, Department of Computer Science, Lund University, September 1998. http ://www. cs.lth.se/-roger/thesis.html
11
 
12
S.-S. Lim, Y. H. Bae, G. T. Jang, B.-D. Rhee, S. L. Min, C. Y. Park, H. Shin, K. Park, and C. S. Kim. An Accurate Worst CaseTiming Analysis Technique for RISC Processors. Proceedings of the IEEE Real-Time Systems Symposium, December 1996.
13
14
 
15
 
16
 
17
 
18
P. Persson and G. Hedin. Interactive Execution Time Predictions using Reference Attributed Grammars. In D. Parigot and M. Mernik (editors): Proceedings of WAGA '99, Second Workshop on Attribute Grammars and their Applications, pages 173-184. Amsterdam, The Netherlands, March 1999. INRIA Rocquencourt.
 
19
Real-Time JavaTM Working Group. http ://www. newmonics, com/webroot/rtjwg, html
 
20
21
 
22
V. Sundaresan, C. Razafimahefa, R. Vall@e-Rai, and L. Hendren. Practical Virtual Method Call Resolution for Java. Sable Technical Report No. 1998-7, McGill University, Canada, 1998.
23
 
24



Peer to Peer - Readers of this Article have also read: