Adaptive scheduling of incremental copying garbage collection for interactive applications (1996) [2 citations — 0 self]
by Roger Henriksson, Roger Henriksson
http://www.dna.lth.se/Research/ProgEnv/Papers/LU-CS-TR:96-174.ps
Add To MetaCart
Abstract:
Abstract. Incremental algorithms are often used to interleave the work of a garbage collector with the execution of an application program, the intention being to avoid long pauses. However, overestimating the worst-case storage needs of the program often causes all the garbage collection work to be performed in the beginning of the garbage collection cycles, slowing down the application program to an unwanted degree. This paper explores an approach to distributing the work more evenly over the garbage collection cycle. 1
Citations
| 280 | Generation scavenging: A non-disruptive high performance storage reclamation algorithm – Ungar - 1984 |
| 216 | A Real-Time Garbage Collector Based on the Lifetimes of Objects – Lieberman, Hewitt - 1983 |
| 201 | List Processing in Real Time on a Serial Computer,’’ A.I. Working Paper 139 – Baker - 1977 |
| 76 | Trading data space for reduced time and code space in real-time garbage collection on stock hardware – Brooks - 1984 |
| 32 | Incremental Mature Garbage Collection using the Train Algorithm – Seligmann, Grarup - 1995 |
| 26 | Incremental collection of mature objects – Hudson, Moss |
| 4 | Scheduling Real-Time Garbage Collection. Licentiate thesis – Henriksson - 1996 |
| 1 | Real-Time Garbage Collection Algorithms. Licentiate thesis – Bengtsson - 1990 |
