{"updated":"2025-01-22T02:53:25.384332+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00061009","sets":["1164:2592:5623:5624"]},"path":["5624"],"owner":"10","recid":"61009","title":["共有メモリシステムにおける調停木スキップ相互排除アルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"2009-01-23"},"_buckets":{"deposit":"d4543737-4208-459b-84e9-ad121fbdf345"},"_deposit":{"id":"61009","pid":{"type":"depid","value":"61009","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"共有メモリシステムにおける調停木スキップ相互排除アルゴリズム","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"共有メモリシステムにおける調停木スキップ相互排除アルゴリズム"},{"subitem_title":"Mutual Exclusion Algorithm with Skipping Arbitration Tree","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2009-01-23","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"奈良先端科学技術大学院大学情報科学研究科"},{"subitem_text_value":"奈良先端科学技術大学院大学情報科学研究科"},{"subitem_text_value":"奈良先端科学技術大学院大学情報科学研究科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Nara Institute of Science and Technology","subitem_text_language":"en"},{"subitem_text_value":"Nara Institute of Science and Technology","subitem_text_language":"en"},{"subitem_text_value":"Nara Institute of Science and Technology","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/61009/files/IPSJ-AL09122002.pdf"},"date":[{"dateType":"Available","dateValue":"2011-01-23"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL09122002.pdf","filesize":[{"value":"1.3 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"e00208b6-37fb-4388-abe1-818b80793f09","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2009 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"鈴木, 健司"},{"creatorName":"井上, 美智子"},{"creatorName":"藤原, 秀雄"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Tsuyoshi, Suzuki","creatorNameLang":"en"},{"creatorName":"Michiko, Inoue","creatorNameLang":"en"},{"creatorName":"Hideo, Fujiwara","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"共有メモリへの遠隔操作の回数を評価尺度とする RMR (Remote Memory Reference) 計算量に関して効率の良い相互排除アルゴリズムを提案する．相互排除の最悪 RMR 計算量は 1 回の共有資源の獲得のためにプロセスが行う RMR の回数である． N プロセス相互排除アルゴリズムの最悪 RMR 計算量は O (log N) であることが知られている．我々は最悪時計算量が O (logN)であるが，多くのプロセスが同時に資源獲得を行う場合に効率の良いアルゴリズムを提案し，その効率性を待ち行列理論とシミュレーションの二つの手法を用いて示す．さらにアルゴリズムを計算処理時間に関して改善を行う．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We propose an efficient mutual exclusion algorithm with respect to remote memory reference (RMR) complexity that measures remote accesses to shared memory. The worst-case RMR complexity for one access to a critical section with N processes has been proven to be O (logN). Though our algorithm has the same worst case RMR complexity, the algorithm becomes efficient with increasing the number of processes executing concurrently. We show the efficiency using queueing theory and simulation. Furthermore, we improve the algorithm so that the elapsed time from some process exits its critical section to the next wanting process enters its critical section is reduced.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"16","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"9","bibliographicIssueDates":{"bibliographicIssueDate":"2009-01-23","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"9(2009-AL-122)","bibliographicVolumeNumber":"2009"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"created":"2025-01-18T23:23:18.001120+00:00","id":61009,"links":{}}