WEKO3
アイテム
Improvement of Garbage Collection by Aid of Compiler
https://ipsj.ixsq.nii.ac.jp/records/59977
https://ipsj.ixsq.nii.ac.jp/records/59977ffab1020-b440-4e8c-8ea9-39a48f7cd3df
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JIP0401003.pdf (1.1 MB)
|
Copyright (c) 1981 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | JInfP(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 1981-03-15 | |||||||
| タイトル | ||||||||
| タイトル | Improvement of Garbage Collection by Aid of Compiler | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | Improvement of Garbage Collection by Aid of Compiler | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| 著者所属 | ||||||||
| Department of Information Science Faculty of Science University of Tokyo | ||||||||
| 著者所属 | ||||||||
| Department of Information Science Faculty of Science University of Tokyo | ||||||||
| 著者所属 | ||||||||
| Department of Information Science Faculty of Science University of Tokyo/Institute of Physical and Ch | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Information Science, Faculty of Science, University of Tokyo | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Information Science, Faculty of Science, University of Tokyo | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Information Science, Faculty of Science, University of Tokyo/Institute of Physical and Ch | ||||||||
| 著者名 |
Kiyoshi, Ono
Masayuki, Suzuki
Eiichi, Goto
× Kiyoshi, Ono Masayuki, Suzuki Eiichi, Goto
|
|||||||
| 著者名(英) |
Kiyoshi, Ono
Masayuki, Suzuki
Eiichi, Goto
× Kiyoshi, Ono Masayuki, Suzuki Eiichi, Goto
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | Run time garbage collection schemes such as those used in Lisp can be aided by a compiler to reclaim more garbage. An additional phase in a Lisp compiler for dead access path elimination (by setting dead variables to NIL) together with a strategy for choosing an appropriate order of evaluation (forcing as many variables as possible into becoming dead before allocating new storage space with cons) can increase the amount of reclaimable garbage at run time thereby reducing the storage space requirement considerably. Experimental results with our Lisp compiler show that the space requirement is reduced to 61% for a polynomial multiplying program and to 45% for the compiler itself. For a bubble-sort program the reduction is from 0(n^3) to 0(n). | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | Run time garbage collection schemes, such as those used in Lisp, can be aided by a compiler to reclaim more garbage. An additional phase, in a Lisp compiler, for dead access path elimination (by setting dead variables to NIL) together with a strategy for choosing an appropriate order of evaluation (forcing as many variables as possible into becoming dead before allocating new storage space with cons) can increase the amount of reclaimable garbage at run time, thereby reducing the storage space requirement considerably. Experimental results with our Lisp compiler show that the space requirement is reduced to 61% for a polynomial multiplying program, and to 45% for the compiler itself. For a bubble-sort program, the reduction is from 0(n^3) to 0(n). | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA00700121 | |||||||
| 書誌情報 |
Journal of Information Processing 巻 4, 号 1, p. 26-34, 発行日 1981-03-15 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-6652 | |||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
