Simple generational garbage collection and fast allocation
- 1 February 1989
- journal article
- research article
- Published by Wiley in Software: Practice and Experience
- Vol. 19 (2), 171-183
- https://doi.org/10.1002/spe.4380190206
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Real-time concurrent collection on stock multiprocessorsACM SIGPLAN Notices, 1988
- A micro-kernel for concurrency in CSoftware: Practice and Experience, 1988
- Garbage collection can be faster than stack allocationInformation Processing Letters, 1987
- A standard ML compilerLecture Notes in Computer Science, 1987
- Garbage collection in a large LISP systemPublished by Association for Computing Machinery (ACM) ,1984
- Generation ScavengingPublished by Association for Computing Machinery (ACM) ,1984
- A real-time garbage collector based on the lifetimes of objectsCommunications of the ACM, 1983
- A nonrecursive list compacting algorithmCommunications of the ACM, 1970
- A LISP garbage-collector for virtual-memory computer systemsCommunications of the ACM, 1969
- Recursive functions of symbolic expressions and their computation by machine, Part ICommunications of the ACM, 1960