{"updated":"2025-01-21T17:50:45.639807+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00086057","sets":["934:1119:6676:6895"]},"path":["6895"],"owner":"11","recid":"86057","title":["Starving Writerの解消によるLogTMの高速化"],"pubdate":{"attribute_name":"公開日","attribute_value":"2012-10-15"},"_buckets":{"deposit":"8b8d1c49-5b2b-4a6d-a112-25034a596170"},"_deposit":{"id":"86057","pid":{"type":"depid","value":"86057","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"Starving Writerの解消によるLogTMの高速化","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Starving Writerの解消によるLogTMの高速化"},{"subitem_title":"A Speed-up Technique for LogTM by Relieving Starving Writers","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[トランザクショナルメモリ] ハードウェア・トランザクショナル・メモリ，マルチスレッド，スケジューリング，メモリアクセス競合","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2012-10-15","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"名古屋工業大学"},{"subitem_text_value":"名古屋工業大学"},{"subitem_text_value":"名古屋工業大学／現在，株式会社デンソー"},{"subitem_text_value":"名古屋工業大学"},{"subitem_text_value":"名古屋工業大学"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Nagoya Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Nagoya Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Nagoya Institute of Technology／Presently with DENSO CORPORATION","subitem_text_language":"en"},{"subitem_text_value":"Nagoya Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Nagoya Institute of Technology","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/86057/files/IPSJ-TACS0505008.pdf"},"date":[{"dateType":"Available","dateValue":"2014-10-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TACS0505008.pdf","filesize":[{"value":"934.0 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":"16"},{"tax":["include_tax"],"price":"0","billingrole":"11"},{"tax":["include_tax"],"price":"0","billingrole":"14"},{"tax":["include_tax"],"price":"0","billingrole":"15"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"ee228bce-c7e8-4254-ac30-6f82049e140d","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2012 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"江藤, 正通"},{"creatorName":"堀場, 匠一朗"},{"creatorName":"浅井, 宏樹"},{"creatorName":"津邑, 公暁"},{"creatorName":"松尾, 啓志"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Masamichi, Eto","creatorNameLang":"en"},{"creatorName":"Shoichiro, Horiba","creatorNameLang":"en"},{"creatorName":"Hiroki, Asai","creatorNameLang":"en"},{"creatorName":"Tomoaki, Tsumura","creatorNameLang":"en"},{"creatorName":"Hiroshi, Matsuo","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11833852","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-7829","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"マルチコア環境における並列プログラミングでは，メモリアクセスの調停には一般にロックが用いられてきた．しかしロックを使用する場合，デッドロックの発生や並列性の低下などの問題がある．そこでロックを用いない並行性制御機構として LogTM が提案されている． LogTM では possible_cycle というフラグを用いて競合を解決する．しかし，この競合解決手法では starving writer が発生し，長期にわたるストールや競合の繰返しにより性能が大きく低下してしまう．そこで本稿では， starving writer の解決手法を提案する．提案手法の有効性を検証するためにシミュレーションによる評価を行った結果，既存の LogTM に比べて最大で 18.7%，平均で 6.6% の性能向上が得られることを確認した．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Lock-based thread synchronization techniques are commonly used in parallel programming on multi-core processors. However, lock can cause deadlocks and poor scalabilities. Hence, LogTM has been proposed and studied for lock-free synchronization. To solve conflicts, LogTM uses a flag called ‘possible_cycle.’ However, the performance can decline with some conflict patterns. This paper proposes a method for dynamically changing the priority of threads to solve the conflict patterns. Our model reduces the number of aborts and recurrence of aborts. The result of the experiment shows that the proposed method improves the performance 18.7% in maximum and 6.6% in average.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"65","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌コンピューティングシステム（ACS）"}],"bibliographicPageStart":"55","bibliographicIssueDates":{"bibliographicIssueDate":"2012-10-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicVolumeNumber":"5"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:37:29.876202+00:00","id":86057,"links":{}}