Pearlmutter, Barak A. (1996) Garbage Collection with Pointers to Individual Cells. Communications of the ACM - Electronic supplement to the December issue, 39 (12es). pp. 202-206. ISSN 0001-0782
Preview
BP-Garbage-Collection-1996.pdf
Download (157kB) | Preview
Abstract
In the heap model in which garbage collectors usually operate, the heap is an array of cells. Each cell contains
either a non-pointer, to be ignored, or a pointer to a block of cells somewhere in the heap, called an object. The
objects do not overlap. In addition, there are a bunch of cells not in the heap, called the root set. It is possible to
determine from a cell whether it contains a pointer or not, and it is possible to determine from a pointer how long
the object pointed to is.
Item Type: | Article |
---|---|
Keywords: | Garbage Collection; Pointers; Individual Cells; |
Academic Unit: | Faculty of Science and Engineering > Computer Science |
Item ID: | 8134 |
Identification Number: | 10.1145/272682.272712 |
Depositing User: | Barak Pearlmutter |
Date Deposited: | 07 Apr 2017 15:36 |
Journal or Publication Title: | Communications of the ACM - Electronic supplement to the December issue |
Publisher: | Association for Computing Machinery (ACM) |
Refereed: | Yes |
Related URLs: | |
URI: | https://mural.maynoothuniversity.ie/id/eprint/8134 |
Use Licence: | This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here |
Repository Staff Only (login required)
Downloads
Downloads per month over past year