Moa — a fast sliding compaction scheme for a large storage space

Mitsugu Suzuki, Hiroshi Koide, Motoaki Terashima

研究成果: 著書/レポートタイプへの貢献会議での発言

抄録

The design and analysis of a new GC scheme called MOA is presented with its implementation on PLisp (Portable Lisp). MOA is "stop-and-collect" type GC and is based on a Morris's sliding compaction scheme. MOA has the excellent features such as: (1) it can perform sliding compaction with a time proportional nearly to the size of all data objects in use, (2) it requires an additional space of a small size to achieve such a time cost saving, (3) it can skip a GC process for a special cluster called an "anchor", reducing the total GC processing time considerably. MOA has been successfully implemented on PLisp which provides a large amount of storage space. MOA is superior to other GC based on conventional sliding compaction and copying collection, as shown in several experiments.

元の言語英語
ホスト出版物のタイトルMemory Management - International Workshop IWMM 1995, Proceedings
編集者Henry G. Baker
出版者Springer Verlag
ページ197-210
ページ数14
ISBN(印刷物)3540603689, 9783540603689
DOI
出版物ステータス出版済み - 1 1 1995
イベントInternational Workshop on Memory Management, IWMM 1995 - Kinross, 英国
継続期間: 9 27 19959 29 1995

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
986
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

その他

その他International Workshop on Memory Management, IWMM 1995
英国
Kinross
期間9/27/959/29/95

Fingerprint

Compaction
Copying
Anchors
Directly proportional
Costs
Processing
Experiment
Experiments

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

Suzuki, M., Koide, H., & Terashima, M. (1995). Moa — a fast sliding compaction scheme for a large storage space. : H. G. Baker (版), Memory Management - International Workshop IWMM 1995, Proceedings (pp. 197-210). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 986). Springer Verlag. https://doi.org/10.1007/3-540-60368-9_25

Moa — a fast sliding compaction scheme for a large storage space. / Suzuki, Mitsugu; Koide, Hiroshi; Terashima, Motoaki.

Memory Management - International Workshop IWMM 1995, Proceedings. 版 / Henry G. Baker. Springer Verlag, 1995. p. 197-210 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻 986).

研究成果: 著書/レポートタイプへの貢献会議での発言

Suzuki, M, Koide, H & Terashima, M 1995, Moa — a fast sliding compaction scheme for a large storage space. : HG Baker (版), Memory Management - International Workshop IWMM 1995, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 巻. 986, Springer Verlag, pp. 197-210, International Workshop on Memory Management, IWMM 1995, Kinross, 英国, 9/27/95. https://doi.org/10.1007/3-540-60368-9_25
Suzuki M, Koide H, Terashima M. Moa — a fast sliding compaction scheme for a large storage space. : Baker HG, 編集者, Memory Management - International Workshop IWMM 1995, Proceedings. Springer Verlag. 1995. p. 197-210. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-60368-9_25
Suzuki, Mitsugu ; Koide, Hiroshi ; Terashima, Motoaki. / Moa — a fast sliding compaction scheme for a large storage space. Memory Management - International Workshop IWMM 1995, Proceedings. 編集者 / Henry G. Baker. Springer Verlag, 1995. pp. 197-210 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{97e7be2488924e65a83981b4c4d03dc1,
title = "Moa — a fast sliding compaction scheme for a large storage space",
abstract = "The design and analysis of a new GC scheme called MOA is presented with its implementation on PLisp (Portable Lisp). MOA is {"}stop-and-collect{"} type GC and is based on a Morris's sliding compaction scheme. MOA has the excellent features such as: (1) it can perform sliding compaction with a time proportional nearly to the size of all data objects in use, (2) it requires an additional space of a small size to achieve such a time cost saving, (3) it can skip a GC process for a special cluster called an {"}anchor{"}, reducing the total GC processing time considerably. MOA has been successfully implemented on PLisp which provides a large amount of storage space. MOA is superior to other GC based on conventional sliding compaction and copying collection, as shown in several experiments.",
author = "Mitsugu Suzuki and Hiroshi Koide and Motoaki Terashima",
year = "1995",
month = "1",
day = "1",
doi = "10.1007/3-540-60368-9_25",
language = "English",
isbn = "3540603689",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "197--210",
editor = "Baker, {Henry G.}",
booktitle = "Memory Management - International Workshop IWMM 1995, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Moa — a fast sliding compaction scheme for a large storage space

AU - Suzuki, Mitsugu

AU - Koide, Hiroshi

AU - Terashima, Motoaki

PY - 1995/1/1

Y1 - 1995/1/1

N2 - The design and analysis of a new GC scheme called MOA is presented with its implementation on PLisp (Portable Lisp). MOA is "stop-and-collect" type GC and is based on a Morris's sliding compaction scheme. MOA has the excellent features such as: (1) it can perform sliding compaction with a time proportional nearly to the size of all data objects in use, (2) it requires an additional space of a small size to achieve such a time cost saving, (3) it can skip a GC process for a special cluster called an "anchor", reducing the total GC processing time considerably. MOA has been successfully implemented on PLisp which provides a large amount of storage space. MOA is superior to other GC based on conventional sliding compaction and copying collection, as shown in several experiments.

AB - The design and analysis of a new GC scheme called MOA is presented with its implementation on PLisp (Portable Lisp). MOA is "stop-and-collect" type GC and is based on a Morris's sliding compaction scheme. MOA has the excellent features such as: (1) it can perform sliding compaction with a time proportional nearly to the size of all data objects in use, (2) it requires an additional space of a small size to achieve such a time cost saving, (3) it can skip a GC process for a special cluster called an "anchor", reducing the total GC processing time considerably. MOA has been successfully implemented on PLisp which provides a large amount of storage space. MOA is superior to other GC based on conventional sliding compaction and copying collection, as shown in several experiments.

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

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

U2 - 10.1007/3-540-60368-9_25

DO - 10.1007/3-540-60368-9_25

M3 - Conference contribution

AN - SCOPUS:84958667942

SN - 3540603689

SN - 9783540603689

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 197

EP - 210

BT - Memory Management - International Workshop IWMM 1995, Proceedings

A2 - Baker, Henry G.

PB - Springer Verlag

ER -