The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]
Communications of the ACM
A note on storage fragmentation and program segmentation
Communications of the ACM
A LISP garbage-collector for virtual-memory computer systems
Communications of the ACM
A contribution to the development of ALGOL
Communications of the ACM
Communications of the ACM
Comparing mark-and sweep and stop-and-copy garbage collection
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Garbage collecting the Internet: a survey of distributed garbage collection
ACM Computing Surveys (CSUR)
Garbage Collection of Linked Data Structures
ACM Computing Surveys (CSUR)
ACM SIGPLAN Notices
Garbage collection without paging
Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
Index-compact garbage collection
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Waste not, want not: resource-based garbage collection in a shared environment
Proceedings of the international symposium on Memory management
| Hi-index | 48.23 |
In list processing there is typically a growing demand for space during program execution. This paper examines the practical implications of this growth within a virtual memory computer system, proposes two new garbage collection techniques for virtual memory systems, and compares them with traditional methods by discussion and by simulation.