|
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
|
Laurie J. Hendren , Joseph Hummell , Alexandru Nicolau, Abstractions for recursive pointer data structures: improving the analysis and transformation of imperative programs, Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation, p.249-260, June 15-19, 1992, San Francisco, California, United States
|
| |
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
|
Mooly Sagiv , Thomas Reps , Reinhard Wilhelm, Solving shape-analysis problems in languages with destructive updating, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.16-31, January 21-24, 1996, St. Petersburg Beach, Florida, United States
[doi> 10.1145/237721.237725]
|
| |
24
|
|
CITED BY 7
|
|
|
|
|
Surupa Biswas , Matthew Simpson , Rajeev Barua, Memory overflow protection for embedded systems using run-time checks, reuse and compression, Proceedings of the 2004 international conference on Compilers, architecture, and synthesis for embedded systems, September 22-25, 2004, Washington DC, USA
|
|
Surupa Biswas , Thomas Carley , Matthew Simpson , Bhuvan Middha , Rajeev Barua, Memory overflow protection for embedded systems using run-time checks, reuse, and compression, ACM Transactions on Embedded Computing Systems (TECS), v.5 n.4, p.719-752, November 2006
|
|
|
|
|
|
|
|
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE conference on Design automation
Gwo-Dong Chen
, Daniel D. Gajski
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
|