{"updated":"2025-01-21T22:00:26.541387+00:00","links":{},"id":73247,"created":"2025-01-18T23:31:19.779361+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00073247","sets":["1164:3925:6360:6361"]},"path":["6361"],"owner":"10","recid":"73247","title":["仮想デスクトップ配置アルゴリズムに関する検討"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-03-03"},"_buckets":{"deposit":"fc11d281-b5df-4626-825f-7e874c2438d6"},"_deposit":{"id":"73247","pid":{"type":"depid","value":"73247","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":"A Study on Virtual Desktop Allocation Algorithms","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"クラウドとセキュリティ","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2011-03-03","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"日立製作所システム開発研究所"},{"subitem_text_value":"日立製作所システム開発研究所"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Systems Development Laboratory, Hitachi, Ltd.","subitem_text_language":"en"},{"subitem_text_value":"Systems Development Laboratory, Hitachi, Ltd.","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/73247/files/IPSJ-CSEC11052047.pdf"},"date":[{"dateType":"Available","dateValue":"2013-03-03"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-CSEC11052047.pdf","filesize":[{"value":"752.8 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":"30"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"9fc2ad3a-fc25-4029-86e7-e85fcc179be8","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"カオ, レタンマン"},{"creatorName":"萱島, 信"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Cao, LeThanhMan","creatorNameLang":"en"},{"creatorName":"Makoto, Kayashima","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11235941","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":"仮想マシンを複数の仮想化サーバ上に最適に配置する問題は，NP 困難のビンパッキング問題に相当する．本研究は，仮想マシンをクライアント PC として利用する場合を対象として，同配置問題への有効な近似解を提案する．具体的には，各仮想デスクトップ （VD） の資源使用量は，一定周期でほぼ同一パターンの変化を繰り返す特性を利用して，各パターンの相関を考慮し，相関が低い VD 同士を同じサーバへ配置するアルゴリズムを検討した．提案アルゴリズムにより，同一サーバ上により多くの VD を搭載しても互いに資源を不足させず，従来アルゴリズムと比べてサーバ台数を削減しながら，資源不足による VD の再配置回数を抑えられる．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Finding optimal placement of virtual machines on numerous physical servers is one kind of bin-packing problem, which is known as a NP-hard. We propose a heuristic algorithm for this problem, in the particular case where the virtual machines play the roles of personal desktops. As the changes in the amount of hardware resources required by a desktop often repeat a certain pattern, the proposed algorithm considers the correlation between the patterns to find the group of desktops that most suitable for sharing the same physical server. Simulation results show that, comparing to existing ones, the proposed algorithm can reduce the number of physical servers required for hosting a certain number of virtual desktops.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告コンピュータセキュリティ（CSEC）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2011-03-03","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"47","bibliographicVolumeNumber":"2011-CSEC-52"}]},"relation_version_is_last":true,"weko_creator_id":"10"}}