A note on compacting garbage collection
Reference:
Fitch, J. P. and Norman, A. C., 1977. A note on compacting garbage collection. The Computer Journal, 21 (1), pp. 31-34.
Related documents:
This repository does not currently have the full-text of this item.You may be able to access a copy if URLs are provided below.
Official URL:
http://dx.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.
Details
| Item Type | Articles |
| Creators | Fitch, J. P.and Norman, A. C. |
| DOI | 10.1093/comjnl/21.1.31 |
| Departments | Faculty of Science > Computer Science |
| Refereed | Yes |
| Status | Published |
| ID Code | 25365 |
Export
Actions (login required)
| View Item |
