HEAP GARBAGE COLLECTION WITH REFERENCE COUNTING

檔案

本條目沒有附加檔案。

日期

2010

期刊名稱

ICSOFT 2010: PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON SOFTWARE AND DATA TECHNOLOGIES, VOL 2

卷期與頁次

頁 267–270

ISBN

978-989-8425-23-2

語言

英文

摘要

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 counters, 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.

所屬典藏

會議論文
顯示完整詮釋資料 統計資料

引用此條目

Yang, W., Tseng, H.-R., & Jan, R.-H. (2010). HEAP GARBAGE COLLECTION WITH REFERENCE COUNTING. ICSOFT 2010: PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON SOFTWARE AND DATA TECHNOLOGIES, VOL 2, 267–270. https://ir.lib.nycu.edu.tw/handle/11536/135570

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/135570