{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00019209","sets":["1164:1165:1184:1185"]},"path":["1185"],"owner":"1","recid":"19209","title":["P2Pにおける静的負荷分散方式の提案"],"pubdate":{"attribute_name":"公開日","attribute_value":"2004-07-15"},"_buckets":{"deposit":"b39d87dd-90ca-40d6-93f2-1fe61713c2d7"},"_deposit":{"id":"19209","pid":{"type":"depid","value":"19209","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"P2Pにおける静的負荷分散方式の提案","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"P2Pにおける静的負荷分散方式の提案"},{"subitem_title":"A Proposal of a Static Load Distribution Technique on P2P Network","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2004-07-15","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京都立大学大学院工学研究科"},{"subitem_text_value":"東京都立大学大学院工学研究科"},{"subitem_text_value":"東京都立大学大学院工学研究科"},{"subitem_text_value":"東京都立大学大学院工学研究科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Engineering, Tokyo Metropolitan University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Engineering, Tokyo Metropolitan University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Engineering, Tokyo Metropolitan University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Engineering, Tokyo Metropolitan 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/19209/files/IPSJ-DBS04134091.pdf"},"date":[{"dateType":"Available","dateValue":"2006-07-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DBS04134091.pdf","filesize":[{"value":"174.2 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":"13"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"eff2b4a2-25cf-4a07-9feb-d980b7a8a526","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2004 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"塩谷, 康夫"},{"creatorName":"太田, 学"},{"creatorName":"片山, 薫"},{"creatorName":"石川, 博"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yasuo, Shioya","creatorNameLang":"en"},{"creatorName":"Manabu, Ohta","creatorNameLang":"en"},{"creatorName":"Kaoru, Katayama","creatorNameLang":"en"},{"creatorName":"Hiroshi, Ishikawa","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10112482","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 computing, when a load is distributed uniformly , the processing time varies with node, and the total processing time will be dependent on the maximum processing time on each node. Therefore distributing load according to the capability of each node can make us expect more efficient total processing by equalization of load processing time on each node. This paper defines a “rank” as a metric which indicates the throughput of each node, and shows how to determine the “rank” of each node from “ranks” of adjoining node. Moreover, this paper proposes a technique to distribute load based on a “rank” of a node.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"682","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告データベースシステム（DBS）"}],"bibliographicPageStart":"675","bibliographicIssueDates":{"bibliographicIssueDate":"2004-07-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"72(2004-DBS-134)","bibliographicVolumeNumber":"2004"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":19209,"updated":"2025-01-22T22:21:56.886003+00:00","links":{},"created":"2025-01-18T22:51:44.211311+00:00"}