Time - and Space - Efficient Garbage Collection Based on Sliding Compaction

• Item type: Journal(1)
• 公開日: 1995-04-15
• タイトル: Time - and Space - Efficient Garbage Collection Based on Sliding Compaction
• タイトル / 言語: en
• タイトル: Time - and Space - Efficient Garbage Collection Based on Sliding Compaction
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: 論文
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• その他タイトル / その他のタイトル: ソフトウェア
• 著者所属: Department of Computer Science University of Electro - Communications
• 著者所属: Graduate School of Information Systems University of Electro - Communications
• 著者所属(英): en
• 著者所属(英): Department of Computer Science, University of Electro - Communications
• 著者所属(英): en
• 著者所属(英): Graduate School of Information Systems, University of Electro - Communications
• 著者名: Mitsugu, Suzuki; Motoaki, Terashima
• 著者名(英): Mitsugu, Suzuki; Motoaki, Terashima
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: A new type of garbage collecti.on (GC) based on sliding compaction is presented. It is called LLGC and performs sliding compaction in a time proportional to A plus Nf(N) where A is the total size of data objects in use N is the number of clusters of such objects (NA) and 10g N_:f(N)_N. It requires an additional space whose size is less than A. The time cost of Nf(N) and the additional space cost result from a sorting scheme adopted in LLGC. When the load factor is small the time cost is far less than that of conventional sliding compaction GC which is proportional to the total storage space size and the space cost is of no importance. Therefore LLGC has a great advantage of time economy in such a case. When the load factor is large it carries out conventional sliding compaction using no additional space. The advantages of LLGC are shown by experimental data for a successful implementation on PLisp a dialect of Lisp.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: A new type of garbage collecti.on (GC) based on sliding compaction is presented. It is called LLGC, and performs sliding compaction in a time proportional to A plus Nf(N), where A is the total size of data objects in use, N is the number of clusters of such objects (NA), and 10g N_:f(N)_N. It requires an additional space whose size is less than A. The time cost of Nf(N) and the additional space cost result from a sorting scheme adopted in LLGC. When the load factor is small, the time cost is far less than that of conventional sliding compaction GC, which is proportional to the total storage space size, and the space cost is of no importance. Therefore, LLGC has a great advantage of time economy in such a case. When the load factor is large, it carries out conventional sliding compaction using no additional space. The advantages of LLGC are shown by experimental data for a successful implementation on PLisp, a dialect of Lisp.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN00116647
• 書誌情報: 情報処理学会論文誌; 巻 36, 号 4, p. 925-931, 発行日 1995-04-15
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7764