Bounding worst case garbage collection time for embedded real-time systems

Real-Time Technology and Applications - Proceedings

Volumn , Issue , 2000, Pages 46-55

  Kim, Taehyoun ^a   Chang, Naehyuck ^a   Shin, Heonshik ^a  

^a Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION TASKS; COMPUTATION TIME; DYNAMIC MEMORY MANAGEMENT; EMBEDDED REAL TIME SYSTEMS; GARBAGE COLLECTION; GARBAGE COLLECTORS; MEMORY REQUIREMENTS; REAL-TIME OPERATION;

ALGORITHMS; REAL TIME SYSTEMS; COMPUTER SYSTEMS PROGRAMMING; DATA ACQUISITION; DATA STORAGE EQUIPMENT; DATA STRUCTURES; EMBEDDED SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS); STORAGE ALLOCATION (COMPUTER);

REFUSE COLLECTION; REAL TIME SYSTEMS;

WORST CASE GARBAGE COLLECTION;

EID: 0033687106     PISSN: 10801812     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTTAS.2000.852450     Document Type: Conference Paper

References (19)

1. A. W. Appel. Garbage collection can be faster than stack allocation. Information Processing Letters, 25(4):275-279, 1987.
2. H. G. Baker. List processing in real time on a serial computer. Communications of the ACM, 21(4):280-294, Apr. 1978.
3. D. A. Barrett and B. G. Zorn. Using lifetime predictors to improve memory allocation performance. In Proceedings of SIGPLAN'93 Conference on Programming Languages Design and Implementation, pages 187-196, Jun 1993.
4. R. A. Brooks. Trading data space for reduced time and code space in real-time collection on stock hardware. In Conference Record of the 1984 ACM Symposium on LISP and Functional Programming, pages 256-262, 1984.
5. S. Dieckmann and U. Holzle. A study of the allocation behavior of the specjvm98 java benchmarks. In Proceedings of the 13th European Conference on Object-Oriented Programming, Jun 1999.
6. P. M. Embree. C Algorithms for Real-Time DSP. Prentice Hall PTR, 1995.
7. R. Gerber, S. Hong, and M. Saksena. Guaranteeing endto-end timing constraints by calibrating intermediate processes. In Proceedings of Real-Time Systems Symposium, pages 192-203, Dec 1994.
8. R. Henriksson. Scheduling Garbage Collection in Embedded Systems. PhD thesis, Lund University, July 1998.
9. Java Virtual Machine Profiler Interface (JVMPI). http://java.sun.com/ products/jdk/1.2/docs/guide/jvmpi/jvmpi.html.
10. T. Kim, N. Chang, N. Kim, and H. Shin. Scheduling garbage collector for embedded real-time systems. In Proceedings of the ACM SIGPLAN 1999 Workshop on Languages, Compilers and Tools for Embedded Systems, pages 55-64, May 1999.
11. J. P. Lehoczky, L. Sha, and Y. Ding. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. In Proceedings of the Real-Time Systems Symposium, pages 166-171, Dec. 1989.
12. C. L. Liu and J.W. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 20(1):46-61, 1973.
13. K. D. Nilsen and W. J. Schmidt. A high-performance hardware-assisted real time garbage collection system. Journal of Programming Languages, 2(1), 1994.
14. P. Persson. Live memory analysis for garbage collection in embedded systems. In Proceedings of the ACM SIGPLAN 1999 Workshop on Languages, Compilers and Tools for Embedded Systems, pages 45-54, May 1999.
15. R. Rugina andM. Rinard. Pointer analysis for multithreaded programs. In Proceedings of the ACM SIGPLAN '99 Conference on Programming Language Design and Implementation, pages 77-90, May 1999.
16. B. Sprunt, L. Sha, and J. P. Lehoczky. Aperiodic task scheduling for hard-real-time systems. Journal of Real-Time Systems, 1:27-60, 1989.
17. P. R. Wilson. Uniprocessor garbage collection techniques. Technical report, University of Texas, Jan 1994.
18. S. H. Yong, S. Horwitz, and T. Reps. Pointer analysis for programs with structures and casting. In Proceedings of the ACM SIGPLAN '99 Conference on Programming Language Design and Implementation, pages 91-103, May 1999.
19. T. Yuasa. Real-time garbage collection on general-purpose machines. Journal of Software and Systems, 11(3):181-198, 1990.