A single-trace cycle collection for reference counting systems

Ting-Wei Hou, Chin Yang Lin, Tien Yan Ma

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

The lack of collecting cyclic garbage is generally considered the major weakness of reference counting. Reference counted systems handle this problem by incorporating either a global tracing collector or a partial tracing collector that considers only the cycle candidates. The latter has become a preferred one as it has better scalability and locality. Most of the partial tracing collectors are based on a classical tracing scheme, called trial deletion, which needs several traces over objects and thus may impose more overhead on tracing. Though lots of works have focused on reducing unnecessary candidates for tracing, few studies resort to the cycle collection procedure. This paper presents a novel cycle collection algorithm which can detect garbage cycles in a single trace over cycle candidates. The algorithm and the correctness proof are described in detail.

Original languageEnglish
Title of host publicationI-SPAN 2009 - The 10th International Symposium on Pervasive Systems, Algorithms, and Networks
Pages40-45
Number of pages6
DOIs
Publication statusPublished - 2009 Dec 1
Event10th International Symposium on Pervasive Systems, Algorithms, and Networks, I-SPAN 2009 - Kaohsiung, Taiwan
Duration: 2009 Dec 142009 Dec 16

Publication series

NameI-SPAN 2009 - The 10th International Symposium on Pervasive Systems, Algorithms, and Networks

Other

Other10th International Symposium on Pervasive Systems, Algorithms, and Networks, I-SPAN 2009
CountryTaiwan
CityKaohsiung
Period09-12-1409-12-16

Fingerprint

Scalability

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Software

Cite this

Hou, T-W., Lin, C. Y., & Ma, T. Y. (2009). A single-trace cycle collection for reference counting systems. In I-SPAN 2009 - The 10th International Symposium on Pervasive Systems, Algorithms, and Networks (pp. 40-45). [5381976] (I-SPAN 2009 - The 10th International Symposium on Pervasive Systems, Algorithms, and Networks). https://doi.org/10.1109/I-SPAN.2009.41
Hou, Ting-Wei ; Lin, Chin Yang ; Ma, Tien Yan. / A single-trace cycle collection for reference counting systems. I-SPAN 2009 - The 10th International Symposium on Pervasive Systems, Algorithms, and Networks. 2009. pp. 40-45 (I-SPAN 2009 - The 10th International Symposium on Pervasive Systems, Algorithms, and Networks).
@inproceedings{ce8b4c9a3fec4a77bf72bedd789dd771,
title = "A single-trace cycle collection for reference counting systems",
abstract = "The lack of collecting cyclic garbage is generally considered the major weakness of reference counting. Reference counted systems handle this problem by incorporating either a global tracing collector or a partial tracing collector that considers only the cycle candidates. The latter has become a preferred one as it has better scalability and locality. Most of the partial tracing collectors are based on a classical tracing scheme, called trial deletion, which needs several traces over objects and thus may impose more overhead on tracing. Though lots of works have focused on reducing unnecessary candidates for tracing, few studies resort to the cycle collection procedure. This paper presents a novel cycle collection algorithm which can detect garbage cycles in a single trace over cycle candidates. The algorithm and the correctness proof are described in detail.",
author = "Ting-Wei Hou and Lin, {Chin Yang} and Ma, {Tien Yan}",
year = "2009",
month = "12",
day = "1",
doi = "10.1109/I-SPAN.2009.41",
language = "English",
isbn = "9780769539089",
series = "I-SPAN 2009 - The 10th International Symposium on Pervasive Systems, Algorithms, and Networks",
pages = "40--45",
booktitle = "I-SPAN 2009 - The 10th International Symposium on Pervasive Systems, Algorithms, and Networks",

}

Hou, T-W, Lin, CY & Ma, TY 2009, A single-trace cycle collection for reference counting systems. in I-SPAN 2009 - The 10th International Symposium on Pervasive Systems, Algorithms, and Networks., 5381976, I-SPAN 2009 - The 10th International Symposium on Pervasive Systems, Algorithms, and Networks, pp. 40-45, 10th International Symposium on Pervasive Systems, Algorithms, and Networks, I-SPAN 2009, Kaohsiung, Taiwan, 09-12-14. https://doi.org/10.1109/I-SPAN.2009.41

A single-trace cycle collection for reference counting systems. / Hou, Ting-Wei; Lin, Chin Yang; Ma, Tien Yan.

I-SPAN 2009 - The 10th International Symposium on Pervasive Systems, Algorithms, and Networks. 2009. p. 40-45 5381976 (I-SPAN 2009 - The 10th International Symposium on Pervasive Systems, Algorithms, and Networks).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - A single-trace cycle collection for reference counting systems

AU - Hou, Ting-Wei

AU - Lin, Chin Yang

AU - Ma, Tien Yan

PY - 2009/12/1

Y1 - 2009/12/1

N2 - The lack of collecting cyclic garbage is generally considered the major weakness of reference counting. Reference counted systems handle this problem by incorporating either a global tracing collector or a partial tracing collector that considers only the cycle candidates. The latter has become a preferred one as it has better scalability and locality. Most of the partial tracing collectors are based on a classical tracing scheme, called trial deletion, which needs several traces over objects and thus may impose more overhead on tracing. Though lots of works have focused on reducing unnecessary candidates for tracing, few studies resort to the cycle collection procedure. This paper presents a novel cycle collection algorithm which can detect garbage cycles in a single trace over cycle candidates. The algorithm and the correctness proof are described in detail.

AB - The lack of collecting cyclic garbage is generally considered the major weakness of reference counting. Reference counted systems handle this problem by incorporating either a global tracing collector or a partial tracing collector that considers only the cycle candidates. The latter has become a preferred one as it has better scalability and locality. Most of the partial tracing collectors are based on a classical tracing scheme, called trial deletion, which needs several traces over objects and thus may impose more overhead on tracing. Though lots of works have focused on reducing unnecessary candidates for tracing, few studies resort to the cycle collection procedure. This paper presents a novel cycle collection algorithm which can detect garbage cycles in a single trace over cycle candidates. The algorithm and the correctness proof are described in detail.

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

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

U2 - 10.1109/I-SPAN.2009.41

DO - 10.1109/I-SPAN.2009.41

M3 - Conference contribution

AN - SCOPUS:77949849865

SN - 9780769539089

T3 - I-SPAN 2009 - The 10th International Symposium on Pervasive Systems, Algorithms, and Networks

SP - 40

EP - 45

BT - I-SPAN 2009 - The 10th International Symposium on Pervasive Systems, Algorithms, and Networks

ER -

Hou T-W, Lin CY, Ma TY. A single-trace cycle collection for reference counting systems. In I-SPAN 2009 - The 10th International Symposium on Pervasive Systems, Algorithms, and Networks. 2009. p. 40-45. 5381976. (I-SPAN 2009 - The 10th International Symposium on Pervasive Systems, Algorithms, and Networks). https://doi.org/10.1109/I-SPAN.2009.41