ACM Home Page
Please provide us with feedback. Feedback
Improved effectiveness from a real time LISP garbage collector
Full text PdfPdf (564 KB)
Source Conference on LISP and Functional Programming archive
Proceedings of the 1982 ACM symposium on LISP and functional programming table of contents
Pittsburgh, Pennsylvania, United States
Pages: 159 - 167  
Year of Publication: 1982
ISBN:0-89791-082-6
Author
Sponsors
ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 23,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/800068.802146
What is a DOI?

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