MURAL - Maynooth University Research Archive Library



    Garbage Collection with Pointers to Individual Cells


    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

    [img]
    Preview
    Download (157kB) | Preview


    Share your research

    Twitter Facebook LinkedIn GooglePlus Email more...



    Add this article to your Mendeley library


    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: https://doi.org/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
    URI:

    Repository Staff Only(login required)

    View Item Item control page

    Downloads

    Downloads per month over past year