Generational reference counting

a reduced-communication distributed storage reclamation scheme

Research output: Contribution to journalArticle

Abstract

This paper describes generational reference counting, a new distributed storage reclamation scheme for loosely-coupled multiprocessors. It has a significantly lower communication overhead than distributed versions of conventional reference counting. Although generational reference counting has greater computational and space requirements than ordinary reference counting, it may provide a significant saving in overall execution time on machines in which message passing is expensive. In this paper, we present the generational reference counting algorithm, prove it correct, and discuss some refinements that make it more efficient. We also compare it with weighted reference counting, another distributed reference counting scheme described in the literature.

Original languageEnglish (US)
Pages (from-to)313-321
Number of pages9
JournalSIGPLAN Notices (ACM Special Interest Group on Programming Languages)
Volume24
Issue number7
StatePublished - Jul 1989

Fingerprint

Reclamation
Message passing
Communication

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

@article{a9e9d0af1b704f67b434c14a788c75d6,
title = "Generational reference counting: a reduced-communication distributed storage reclamation scheme",
abstract = "This paper describes generational reference counting, a new distributed storage reclamation scheme for loosely-coupled multiprocessors. It has a significantly lower communication overhead than distributed versions of conventional reference counting. Although generational reference counting has greater computational and space requirements than ordinary reference counting, it may provide a significant saving in overall execution time on machines in which message passing is expensive. In this paper, we present the generational reference counting algorithm, prove it correct, and discuss some refinements that make it more efficient. We also compare it with weighted reference counting, another distributed reference counting scheme described in the literature.",
author = "Benjamin Goldberg",
year = "1989",
month = "7",
language = "English (US)",
volume = "24",
pages = "313--321",
journal = "ACM SIGPLAN Notices",
issn = "1523-2867",
publisher = "Association for Computing Machinery (ACM)",
number = "7",

}

TY - JOUR

T1 - Generational reference counting

T2 - a reduced-communication distributed storage reclamation scheme

AU - Goldberg, Benjamin

PY - 1989/7

Y1 - 1989/7

N2 - This paper describes generational reference counting, a new distributed storage reclamation scheme for loosely-coupled multiprocessors. It has a significantly lower communication overhead than distributed versions of conventional reference counting. Although generational reference counting has greater computational and space requirements than ordinary reference counting, it may provide a significant saving in overall execution time on machines in which message passing is expensive. In this paper, we present the generational reference counting algorithm, prove it correct, and discuss some refinements that make it more efficient. We also compare it with weighted reference counting, another distributed reference counting scheme described in the literature.

AB - This paper describes generational reference counting, a new distributed storage reclamation scheme for loosely-coupled multiprocessors. It has a significantly lower communication overhead than distributed versions of conventional reference counting. Although generational reference counting has greater computational and space requirements than ordinary reference counting, it may provide a significant saving in overall execution time on machines in which message passing is expensive. In this paper, we present the generational reference counting algorithm, prove it correct, and discuss some refinements that make it more efficient. We also compare it with weighted reference counting, another distributed reference counting scheme described in the literature.

UR - http://www.scopus.com/inward/record.url?scp=0024702288&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024702288&partnerID=8YFLogxK

M3 - Article

VL - 24

SP - 313

EP - 321

JO - ACM SIGPLAN Notices

JF - ACM SIGPLAN Notices

SN - 1523-2867

IS - 7

ER -