{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032471","sets":["1164:2592:2693:2697"]},"path":["2697"],"owner":"1","recid":"32471","title":["分散共有メモリに対するオンラインアルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"1993-05-28"},"_buckets":{"deposit":"2132c0c3-e056-4b11-90bf-6d41ede8c2e3"},"_deposit":{"id":"32471","pid":{"type":"depid","value":"32471","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"分散共有メモリに対するオンラインアルゴリズム","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"分散共有メモリに対するオンラインアルゴリズム"},{"subitem_title":"On - line Algorithms for Distributed Shared Memory","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1993-05-28","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京大学理学部情報科学科今井研究室"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Information Science, Faculty of Science, University of Tokyo","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/32471/files/IPSJ-AL93033007.pdf"},"date":[{"dateType":"Available","dateValue":"1995-05-28"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL93033007.pdf","filesize":[{"value":"1.0 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":"99fd2ad3-ba85-4b76-b0aa-6c1a58facb6c","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1993 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"古賀, 久志"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hisashi, Koga","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":"ローカルメモリを持った複数のプロセッサーからなる分散共有メモリシステムにおいては、各ページはメモリアクセス要求列に対してコストが低くなるように、適宜移動または複写されて適当なプロセッサーに配置される必要がある。本研究では、こうした低いコストのページ配置を実現するオンラインアルゴリズムをコンペティティブ比（最適オフラインアルゴリズムとのコスト比）の面から考える。特に本研究では、ページ移動問題に対しての確率的アルゴリズムをページ複写問題用に改良して木やリングのネットワークに対して既存の決定的アルゴリズムよりコンペティティブ比の面で強い結果が得た。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In distributed shared memory system consisting of multiple processor s, each of which has its own local memory, each page needs to be located at a proper processor by migration or replication so at to make the total cost for memory-access lower. In this paper, on-line algorithms attempting to implement this low-cost locating are considered in terms of competitiveness, the ratio of the cost of the on-line algorithms to that of the off-line optimal algorithm. Especially in this paper, we show that the application of algorithms base on randomized algorithms for page migration problem to page replication problem can acquire more powerful result than existing deterministic algorithms about competitive ratio.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"55","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"49","bibliographicIssueDates":{"bibliographicIssueDate":"1993-05-28","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"48(1993-AL-033)","bibliographicVolumeNumber":"1993"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T23:01:33.142775+00:00","updated":"2025-01-22T16:09:23.224159+00:00","id":32471}