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

スポンサーリンク

概要

• 論文の詳細を見る

• A new type of garbage collection (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(N≤A), and log 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.

• 社団法人情報処理学会の論文
• 1995-04-15

著者

• Suzuki Mitsugu

  Department Of Computer Science University Of Electro-communications

• Suzuki Mitsugu

  Department Of Computer Science University O Electro-communications

• Terashima Motoaki

  Graduate School of Information Systems, University of Electro-Communications

• Terashima Motoaki

  Graduate School Of Information Systems University Of Electro-communications

関連論文

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

スポンサーリンク