loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Wuu Yang ; Huei-Ru Tseng and Rong-Hong Jan

Affiliation: National Chiao-Tung University, China

ISBN: 978-989-8425-23-2

Keyword(s): Closed cluster, Cyclic garbage, Depth-first search, Graph theory, Garbage collection, Reference count.

Related Ontology Subjects/Areas/Topics: Algorithms and Data Structures ; Embedded Communications Systems ; Programming Languages ; Software Architectures ; Software Engineering ; Telecommunications

Abstract: In algorithms based on reference counting, a garbage-collection decision has to be made whenever a pointer x !y is about to be destroyed. At this time, the node y may become dead even if y’s reference count is not zero. This is because y may belong to a piece of cyclic garbage. Some aggressive collection algorithms will put y on the list of potential garbage regardless of y’s reference count. Later a trace procedure starting from y will be initiated. Other algorithms, less aggressive, will put y on the list of potential garbage only if y’s reference count falls below a threshold, such as 3. The former approach may waste time on tracing live nodes and the latter may leave cyclic garbage uncollected indefinitely. The problem with the above two approaches (and with reference counting in general) is that it is difficult to decide if y is dead when the pointer x ! y is destroyed. We propose a new garbage-collection algorithm in which each node maintains two, rather than one, reference coun ters, gcount and hcount. Gcount is the number of references from the global variables and from the run-time stack. Hcount is the number of references from the heap. Our algorithm will put node y on the list of potential garbage if and only if y’s gcount becomes 0. The better prediction made by our algorithm results in more efficient garbage collectors. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.81.29.254

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Yang W.; Tseng H.; Jan R. and (2010). HEAP GARBAGE COLLECTION WITH REFERENCE COUNTING.In Proceedings of the 5th International Conference on Software and Data Technologies - Volume 2: ICSOFT, ISBN 978-989-8425-23-2, pages 267-270. DOI: 10.5220/0002917502670270

@conference{icsoft10,
author={Wuu Yang and Huei{-}Ru Tseng and Rong{-}Hong Jan},
title={HEAP GARBAGE COLLECTION WITH REFERENCE COUNTING},
booktitle={Proceedings of the 5th International Conference on Software and Data Technologies - Volume 2: ICSOFT,},
year={2010},
pages={267-270},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002917502670270},
isbn={978-989-8425-23-2},
}

TY - CONF

JO - Proceedings of the 5th International Conference on Software and Data Technologies - Volume 2: ICSOFT,
TI - HEAP GARBAGE COLLECTION WITH REFERENCE COUNTING
SN - 978-989-8425-23-2
AU - Yang, W.
AU - Tseng, H.
AU - Jan, R.
PY - 2010
SP - 267
EP - 270
DO - 10.5220/0002917502670270

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.