{"id":17006,"updated":"2025-01-22T23:34:27.036056+00:00","links":{},"created":"2025-01-18T22:50:07.260313+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00017006","sets":["934:935:982:985"]},"path":["985"],"owner":"1","recid":"17006","title":["Snapshot型並列GCにおけるルート挿入時間の削減"],"pubdate":{"attribute_name":"公開日","attribute_value":"1999-05-15"},"_buckets":{"deposit":"1cf1f406-9d14-414b-9034-9af15d13fe60"},"_deposit":{"id":"17006","pid":{"type":"depid","value":"17006","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"Snapshot型並列GCにおけるルート挿入時間の削減","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Snapshot型並列GCにおけるルート挿入時間の削減"},{"subitem_title":"Reduction of Pause Time due to Snapshot Parallel GC","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"通常論文","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"1999-05-15","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"慶應義塾大学大学院理工学研究科"},{"subitem_text_value":"慶應義塾大学理工学部情報工学科"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Science and Technology, Keio University","subitem_text_language":"en"},{"subitem_text_value":"Department of Information and Computer Science, Faculty of Science and Technology, Keio University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/17006/files/IPSJ-TPRO4004007.pdf"},"date":[{"dateType":"Available","dateValue":"2001-05-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TPRO4004007.pdf","filesize":[{"value":"999.4 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"15"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"19eab54e-b928-48db-b773-5868e0485b72","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1999 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"岩井, 輝男"},{"creatorName":"中西, 正和"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Teruo, Iwai","creatorNameLang":"en"},{"creatorName":"Masakazu, Nakanishi","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464814","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7802","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"並列GCは  リスト処理の実時間処理 (無停止処理) の実現が可能なGC方法である. snapshot 型アルゴリズムの並列GCでは  ルート挿入時点で生きていたオブジェクトのsnapshotをとるため  ルート挿入時にはmutatorとcollectorとで同期を取り  mutatorのリスト処理を一時中断してmutatorのルート挿入を行わなければならない. 1回の停止時間をできるだけ小さくするためには  同期の時間を削減するか  mutatorのルート挿入時間を削減するかのいずれかである. 同期の時間はハードウェアとオペレーティングシステムの機能に関係し  停止時間を減少させる事が難しい. 我々はsnapshotを取るためのルート挿入は  mutatorがルートを書き換えるまで行う必要がない事に着目した. 書き換えの起こったルートの含まれるぺージだけのルート挿入を行うことで  一般的なsnapshot型並列GCのルート挿入によるmutatorの停止時間を減らすアルゴリズムを提案する. 並列Lispへの拡張性を考えこの並列GCの手法を用いて実装し実験した結果  GC時のルート挿入による停止時間が一定時間内に抑えられることが確認された. この結果は  実時間GCの実用化に大きく貢献すると考えられる.","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Parallel garbage collection enables list processing in realtime (non stop processing). The garbage collection (GC) of snapshot algorithm is one of parallel GC. It is necessary for this GC to use the mutual exclusion between mutator and collector for taking the snapshot at root insertion, and to pause temporarily the mutator, and to make mutator do root insertion. For one pause time is as short as possible, it is necessary to shorten each the time of mutual exclusion or root insertion. The time of the mutual exclusion depends on hardwire and operating system, and it is difficult to shorten the pause time. We note that the root insertion is not necessary until the mutator rewrites root area. We propose the method of decreasing pause time that approaches that only pages that is rewritten are copied. For the expansion to parallel Lisp we implement this method, experiment, and obtain that the pause time of mutator is less than certain constant time. The GC with this method contributes to practical use realtime GC.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"66","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌プログラミング（PRO）"}],"bibliographicPageStart":"58","bibliographicIssueDates":{"bibliographicIssueDate":"1999-05-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"SIG04(PRO3)","bibliographicVolumeNumber":"40"}]},"relation_version_is_last":true,"weko_creator_id":"1"}}