|
ABSTRACT
This paper describes a real-time garbage collection algorithm for list processing systems. We identify two efficiency problems inherent to real-time garbage collectors, and give some evidence that the proposed algorithm tends to reduce these problems. In a virtual memory implementation, the algorithm restructures the cell storage area more compactly, thus reducing working sets. The algorithm also may provide a more garbage-free storage area at the end of the collection cycle, although this claim really must await empirical verification.
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
|
|
 |
2
|
|
 |
3
|
|
 |
4
|
|
| |
5
|
Clark, D.W., "Measurements of dynamic list structure use in LISP," IEEE Transactions on Software Engineering, Vol. SE-5, No. 1, January 1979, pp. 51-59.
|
 |
6
|
|
 |
7
|
|
| |
8
|
Hood, R. and R. Melville, "Real-time queue operations in pure LISP," Information Processing Letters, Vol. 13, No. 2, November 1981, pp. 50-54.
|
 |
9
|
|
 |
10
|
|
|