{"id":25887,"updated":"2025-01-22T19:15:32.351143+00:00","links":{},"created":"2025-01-18T22:56:39.034830+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00025887","sets":["1164:1867:1906:1909"]},"path":["1909"],"owner":"1","recid":"25887","title":["超並列計算機向き相互結合網SRTにおける適応型ルーティング"],"pubdate":{"attribute_name":"公開日","attribute_value":"1999-03-04"},"_buckets":{"deposit":"8d7d048d-c04e-4840-9bfd-5fe5e2aa48b6"},"_deposit":{"id":"25887","pid":{"type":"depid","value":"25887","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"超並列計算機向き相互結合網SRTにおける適応型ルーティング","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"超並列計算機向き相互結合網SRTにおける適応型ルーティング"},{"subitem_title":"An Adaptive Routing for Shifted Recursive Torus Networks","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1999-03-04","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":"School of Information Science, Japan Advanced Institute of Science and Technology","subitem_text_language":"en"},{"subitem_text_value":"Center for Information Science Japan Advanced Institute of Science and Technology","subitem_text_language":"en"},{"subitem_text_value":"School of Information Science, Japan Advanced Institute of Science and Technology","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/25887/files/IPSJ-OS98080003.pdf"},"date":[{"dateType":"Available","dateValue":"2001-03-04"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-OS98080003.pdf","filesize":[{"value":"616.6 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":"11"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"c753ea9d-6525-427a-a47d-2deaa76171bb","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1999 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":"Masayuki, Kawai","creatorNameLang":"en"},{"creatorName":"Yasushi, Inoguchi","creatorNameLang":"en"},{"creatorName":"Susumu, Horiguchi","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10444176","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":"超並列システムに適合する結合網には，科学技術計算によく用いられる2次元格子結合を含み，ノード当りのリンク数が少数であるなどの実装性，耐故障性などの要件が求められている．SRT (Shifted Recursive Torus)はグリッドの大きさが異なるトーラス結合を再帰的にシフトして構成された，超並列計算機に適した結合網である．SRTは，トーラス結合網に遠距離ノード間通信のためのバイパスリンクを付加しノード当りのリンク数を固定した階層構造を有する結合網であり，従来の相互結合網に比べて遜色ない次数や直径を有している．SRTにおけるルーティング（再帰ルーティング）は直径や平均距離などの点で十分に高い性能を有しているが、転送経路が固定であるため混雑や故障に対応できない．そこで、本論文では，SRTのデッドロックフリーな適応型ルーティング手法を提案する．また，シミュレーションにより適応型ルーティングの性能評価を行ない従来手法と比較検討を行った．更に，提案する適応型ルーティングは仮想チャネルを増設する必要がなく、また、デッドロックフリーなルーティングアルゴリズムに比べ非常に高い転送能力を有していることを示す．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"A massively parallel computer requires interconnection networks with excellent features of a small diameter, a small number of links, expendability and fault-tolerance. Shifted Recursive Torus (SRT) consists of torus networks which are shifted recursively. SRT has the advantage of that the number of links a node is fixed and the diameter is relatively small. We have proposed, a deadlock-free routing of SRT and proved the recursive routing is a near-optimal static routing. However, the proposed recursive routing does not have adaptability and fault-tolerance. In this paper, we propose a deadlock-free algorithm for adaptive routing of SRT without additional virtual channels. This algorithm allows a detour routing on the same dimension. The adaptive routing algorithm has been proved as a deadlock-free adaptive routing and performances are evaluated by computer simulation. It's seen that the proposed adaptive routing achieves much better dynamic communication performance than a statistic recursive routing.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"18","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告システムソフトウェアとオペレーティング・システム（OS）"}],"bibliographicPageStart":"13","bibliographicIssueDates":{"bibliographicIssueDate":"1999-03-04","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"21(1998-OS-080)","bibliographicVolumeNumber":"1999"}]},"relation_version_is_last":true,"weko_creator_id":"1"}}