{"id":13023,"updated":"2025-01-23T01:24:47.948789+00:00","links":{},"created":"2025-01-18T22:47:13.506419+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00013023","sets":["581:716:722"]},"path":["722"],"owner":"1","recid":"13023","title":["超並列環境向きトラバースアルゴリズムを用いたプロセス移送"],"pubdate":{"attribute_name":"公開日","attribute_value":"1998-07-15"},"_buckets":{"deposit":"77ea6a33-3c9b-4c26-ba4d-7d68b9d278cc"},"_deposit":{"id":"13023","pid":{"type":"depid","value":"13023","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":"Process Migration Using Traverse Algorithm in a Massively Parallel Environment","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"論文","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"1998-07-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"電気通信大学大学院情報システム学研究科／現在，メディア教育開発センター"},{"subitem_text_value":"電気通信大学大学院情報システム学研究科"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Systems, The University of Electro - Communications/Presently with National Institute of Multimedia Education","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Systems, The University of Electro - Communications","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/13023/files/IPSJ-JNL3907030.pdf"},"date":[{"dateType":"Available","dateValue":"2000-07-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL3907030.pdf","filesize":[{"value":"1.2 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":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"0ca7bcf2-4cd4-4bb4-857f-a9684f9ff6a3","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1998 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"大澤範高"},{"creatorName":"弓場, 敏嗣"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Noritaka, Osawa","creatorNameLang":"en"},{"creatorName":"Toshitsugu, Yuba","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"要素プロセッサ（ノード）数が100万規模の超並列計算機を利用する超並列環境に向いたプロセス移送方式を提案し，評価する．高いノード次数を持つネットワークを構成することとノード間リンクの通信容量を非常に大きくすることはハードウェアコストから難しい．そこで，超並列環境においては，通信容量の不足による遅延を防ぐために，プロセス移送を行うことによって通信の局所性を高め，利用する通信容量（通信コスト）を小さくすることが重要である．プロセス間通信ネットワークをたどりながら移送先を順に決定するという移送アルゴリズムを提案し，それに従った移送による通信コストの改善効果を解析する．さらに，改善効果をシミュレーションによって確認し，結果を考察する．また，超並列環境におけるプロセス移送と耐故障性および楽観的実行との関連を述べ，プロセス移送のためのオーバヘッドの問題が超並列環境においては相対的に小さくなることを論ずる．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"A process migration algorithm in a massively parallel environment,which uses a massively parallel computer with more than one million element processors,is proposed and evaluated.It is difficult from a viewpoint of hardware cost to construct a network whose nodes have large degrees and to significantly increase communication capacity between nodes in a massively parallel computer.However,a network topology with a fixed degree is not scalable with respect to communication capacity.Insufficient communication capacity causes communication delays.In order to prevent communication delays,it is important to utilize locality.Locality is improved by process migration.This paper proposes a process migration algorithm which traverses the inter-process communication network and determines the destination of a migration in order. Next the reduction of communication costs is analyzed.The result of the analysis is confirmed by simulation and the simulation studies are examined.This paper also describes the relationship between process migration and other facilities,such as fault tolerance and optimistic execution,and discusses the effective overhead of process migration is low in a massively parallel environment.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"2348","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"2339","bibliographicIssueDates":{"bibliographicIssueDate":"1998-07-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"7","bibliographicVolumeNumber":"39"}]},"relation_version_is_last":true,"item_2_alternative_title_2":{"attribute_name":"その他タイトル","attribute_value_mlt":[{"subitem_alternative_title":"並列処理ソフトウェア"}]},"weko_creator_id":"1"}}