{"links":{},"id":29120,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00029120","sets":["1164:2240:2263:2267"]},"path":["2267"],"owner":"1","recid":"29120","title":["動的な情報を用いたルーティングアルゴリズムCross-Lineの検討"],"pubdate":{"attribute_name":"公開日","attribute_value":"2004-03-01"},"_buckets":{"deposit":"b2f991a4-6d42-4ae4-b1e8-fbe0f2a37e09"},"_deposit":{"id":"29120","pid":{"type":"depid","value":"29120","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"動的な情報を用いたルーティングアルゴリズムCross-Lineの検討","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"動的な情報を用いたルーティングアルゴリズムCross-Lineの検討"},{"subitem_title":"Preliminary Research of a Novel Routing Algorithm Cross - Line Using Dynamic Information","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2004-03-01","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"宇都宮大学工学部情報工学科"},{"subitem_text_value":"宇都宮大学工学部情報工学科"},{"subitem_text_value":"宇都宮大学工学部情報工学科"},{"subitem_text_value":"宇都宮大学サテライト・ベンチャー・ビジネス・ラボラトリー"},{"subitem_text_value":"宇都宮大学工学部情報工学科"},{"subitem_text_value":"宇都宮大学工学部情報工学科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Information Science, Faculty of Engineering, Utsunomiya University","subitem_text_language":"en"},{"subitem_text_value":"Department of Information Science, Faculty of Engineering, Utsunomiya University","subitem_text_language":"en"},{"subitem_text_value":"Department of Information Science, Faculty of Engineering, Utsunomiya University","subitem_text_language":"en"},{"subitem_text_value":"Satellite Venture Business Laboratory, Utsunomiya University","subitem_text_language":"en"},{"subitem_text_value":"Department of Information Science, Faculty of Engineering, Utsunomiya University","subitem_text_language":"en"},{"subitem_text_value":"Department of Information Science, Faculty of Engineering, Utsunomiya 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/29120/files/IPSJ-HPC03097002.pdf"},"date":[{"dateType":"Available","dateValue":"2006-03-01"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-HPC03097002.pdf","filesize":[{"value":"980.4 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":"14"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"434831e2-6399-46d6-a35f-9b83e7708e6a","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":"古川, 文人"},{"creatorName":"大津, 金光"},{"creatorName":"馬場, 敬信"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Masashi, Nishitani","creatorNameLang":"en"},{"creatorName":"Satoshi, Ezura","creatorNameLang":"en"},{"creatorName":"Takashi, Yokota","creatorNameLang":"en"},{"creatorName":"Fumihito, Furukawa","creatorNameLang":"en"},{"creatorName":"Kanemitsu, Ootsu","creatorNameLang":"en"},{"creatorName":"Takanobu, Baba","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10463942","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":"相互結合網のメッセージ転送方式は 並列計算機の性能に大きな影響を与える.ルーティング方式の検討は今まで様々行われてきたが プロセッサの性能も 通信のバンド幅も LSIの集積度も向上した現在の相互結合網を取り巻く状況を考えると それらを有効に活用できる新しいルーティング方式を考える必要がある.我々は 相互結合網向けの新たなルーティングアルゴリズムとして 適応ルーティングCross-Lineを検討する。本アルゴリズムは バーチャルチャネル(Virtual Channel)の状態を示す動的な情報を用いてルーティングを行うことを特徴とする.我々はこのアルゴリズム実現のために 相互結合網シミュレータChimeraを作成し Cross-Lineについての詳細な検討を行った.本稿では Cross-Line実現に向けての詳細な検討結果について報告する.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Routing methods for interconnection networks affect the performance of parallel computers considerably. Thus they have been studied and many methods are proposed and implemented. Advances in VLSI integration, network bandwidth, and processor performance, however, drive us to consider the novel routing methods. We are discussing a novel adaptive routing algorithm, called \"Cross-Line\". This routing algorithm has a unique feature using dynamic information. We have developed an interconnection networks simulation framework called \"Chimera\" so that we can evaluate the Cross-Line method quantitatively.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"12","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告ハイパフォーマンスコンピューティング(HPC)"}],"bibliographicPageStart":"7","bibliographicIssueDates":{"bibliographicIssueDate":"2004-03-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"20(2003-HPC-097)","bibliographicVolumeNumber":"2004"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T22:59:03.294709+00:00","updated":"2025-01-22T17:42:23.291599+00:00"}