• DocumentCode
    959749
  • Title

    A Space-Efficient List Structure Tracing Algorithm

  • Author

    Wegbreit, Ben

  • Author_Institution
    Center for Research in Computing Technology, Harvard University, Cambridge, Mass.
  • Issue
    9
  • fYear
    1972
  • Firstpage
    1009
  • Lastpage
    1010
  • Abstract
    An algorithm for tracing during garbage collection of list structure is presented. It requires only one bit for each level of doubly branching structure traced. Compared to existing trace algorithms, it generally requires less storage¿often, substantially less.
  • Keywords
    Boolean functions; Contracts; Counting circuits; Electrons; Minimization methods; Switching circuits; Free storage management; garbage collection; list processing; list tracing; storage reclamation; storage regeneration;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1972.5009079
  • Filename
    5009079
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=959749