{"id":35212,"updated":"2025-01-22T14:47:41.975265+00:00","links":{},"created":"2025-01-18T23:03:36.330896+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00035212","sets":["1164:2836:2894:2899"]},"path":["2899"],"owner":"1","recid":"35212","title":["共有プロセスを含むグループ間の分散資源割り当て"],"pubdate":{"attribute_name":"公開日","attribute_value":"1998-01-29"},"_buckets":{"deposit":"9b47e165-9a1a-4d69-8dba-3c338efb21d8"},"_deposit":{"id":"35212","pid":{"type":"depid","value":"35212","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":"Distributed Allocation of Resources to Overlapping Process Groups","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1998-01-29","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":"Department of Computer Software, University of Aizu","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Software, University of Aizu","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Software, University of Aizu","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/35212/files/IPSJ-DPS97086002.pdf"},"date":[{"dateType":"Available","dateValue":"2000-01-29"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DPS97086002.pdf","filesize":[{"value":"645.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":"34"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"c74e49b3-21e7-4216-960c-aae801c15ee8","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1998 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":"Zixue, Cheng","creatorNameLang":"en"},{"creatorName":"Yukiko, Inoue","creatorNameLang":"en"},{"creatorName":"Yutaka, Wada","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10116224","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":"The distributed resource allocation problem is a well known fundamental problem in distributed systems. Many solutions which avoid the deadlock and starvation have been developed. With the progress of computer networks, however, distributed cooperative group activities in a network environment have been increasing, so that several groups may compete for some resources in the network environment and deadlock among groups and starvation of a group may happen. Since previous allocation models are mainly for representation of competition for resources among processes, they can't reflect clearly the competition for resources among groups of processes. Moreover, though the previous solutions to the distributed resource allocation problem can avoid the deadlock and starvation, they can't deal with the deadlock among groups and starvation of a group. In this paper, we propose a solution which allocates resources to groups of processes with deadlock among groups and starvation of a group never happening, by extending an acyclic graph approach to the dining philosopher problem. In addition, our solution guarantees that more than one group work mutual exclusively, if a common process belongs to these groups.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"12","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告マルチメディア通信と分散処理（DPS）"}],"bibliographicPageStart":"7","bibliographicIssueDates":{"bibliographicIssueDate":"1998-01-29","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"8(1997-DPS-086)","bibliographicVolumeNumber":"1998"}]},"relation_version_is_last":true,"weko_creator_id":"1"}}