A note on compacting garbage collection
Open Access
- 1 January 1978
- journal article
- research article
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 21 (1) , 31-34
- https://doi.org/10.1093/comjnl/21.1.31
Abstract
A variation of the Haddon and Waite compacting garbage collector is presented that needs only bounded workspace, but which has typical runtime proportional to the size of the heap rather than n log n for a heap of size n. The algorithm has been measured in the context of a LISP system where it has been seen to behave close to its optimum. The relationship of this algorithm to one due to Lang and Weigbreit is also explained.Keywords
This publication has 0 references indexed in Scilit: