Garbage collection with hard real-time requirements
暂无分享,去创建一个
[1] Paul R. Wilson,et al. Uniprocessor Garbage Collection Techniques , 1992, IWMM.
[2] Rick Thomas,et al. A simplified recombination scheme for the Fibonacci buddy system , 1975, CACM.
[3] R WilsonPaul,et al. The memory fragmentation problem , 1998 .
[4] Benjamin Goldberg,et al. Escape analysis on lists , 1992, PLDI '92.
[5] Donald E. Knuth,et al. The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .
[6] Wolfram Schulte,et al. Deriving Residual Reference Count Garbage Collectors , 1994, PLILP.
[7] Kelvin D. Nilsen,et al. High-level dynamic memory management for object-oriented real-time systems , 1996, OOPS.
[8] Tobias Ritzau,et al. Memory Efficient Hard Real-Time Garbage Collection , 2003 .
[9] Scott Nettles,et al. Real-time replication garbage collection , 1993, PLDI '93.
[10] Fridtjof Siebert. Hard real-time garbage collection in modern object oriented programming languages , 2002 .
[11] Fridtjof Siebert,et al. Real-time garbage collection in multi-threaded systems on a single processor , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).
[12] Daniel S. Hirschberg,et al. A class of dynamic memory allocation algorithms , 1973, CACM.
[13] Martin C. Rinard,et al. Pointer and escape analysis for multithreaded programs , 2001, PPoPP '01.
[14] Alexandru Nicolau,et al. Comparison of Compacting Algorithms for Garbage Collection , 1983, TOPL.
[15] Benjamin Goldberg,et al. Static Analysis for Optimizing Reference Counting , 1995, Inf. Process. Lett..
[16] James L. Peterson,et al. A weighted buddy method for dynamic storage allocation , 1974, CACM.
[17] James L. Peterson,et al. Buddy systems , 1977, CACM.
[18] Roger Henriksson,et al. Scheduling Garbage Collection in Embedded Systems , 1998 .
[19] Paul R. Wilson,et al. The memory fragmentation problem: solved? , 1998, ISMM '98.