{"id":11207,"updated":"2025-01-23T02:21:50.140806+00:00","links":{},"created":"2025-01-18T22:45:54.145988+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00011207","sets":["581:651:658"]},"path":["658"],"owner":"1","recid":"11207","title":["1次元再帰シフトトーラス相互結合網の拡張"],"pubdate":{"attribute_name":"公開日","attribute_value":"2003-06-15"},"_buckets":{"deposit":"cbc22381-1421-4497-8f64-116667a99b4d"},"_deposit":{"id":"11207","pid":{"type":"depid","value":"11207","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"1次元再帰シフトトーラス相互結合網の拡張","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"1次元再帰シフトトーラス相互結合網の拡張"},{"subitem_title":"Improving One Dimensional Shifted Recursive Torus Interconnection","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"テクニカルノート","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2003-06-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"北陸先端科学技術大学院大学情報科学センター，科学技術振興事業団，さきがけ研究21"},{"subitem_text_value":"北陸先端科学技術大学院大学情報科学研究科"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Center for Information Science, JAIST, \"Information and Systems\", PRESTO, JST","subitem_text_language":"en"},{"subitem_text_value":"School of Information Science, JAIST","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/11207/files/IPSJ-JNL4406010.pdf"},"date":[{"dateType":"Available","dateValue":"2005-06-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL4406010.pdf","filesize":[{"value":"200.9 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":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"e82d3c20-32e9-4b27-983d-9f05cd25ee35","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2003 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":"Yasushi, Inoguchi","creatorNameLang":"en"},{"creatorName":"Susumu, Horiguchi","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":"1次元SRT（Shifted Recursive Torus）網は，リング結合網に長さが異なるバイパスリンクを再帰的に付加して構成される，階層構造を有する結合網である．本論文では，従来の1次元SRT網におけるバイパスリンクが定義されていないノードに，冗長なバイパスリンクを付加することにより，通信性能を高めた派生型の1次元SRTを提案する．バイパスリンクの付加の方法によって，2種類の派生型SRTが定義される．従来の1D-SRTにおける再帰ルーティングを拡張して，拡張ルーティングアルゴリズムを示し，直径を導出する．派生型1D-SRTのネットワーク性能を評価したところ，拡張型のSRT網は，ノード数が多い場合に直径が大幅に短縮できることが分かった．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Shifted Recursive Torus (SRT) is constructed by adding multi-grained hierarchical by-pass links ona ring network.This paper proposes two types of improved SRT networksthat have additional by-pass links to improve network performance.Routing algorithms for the improved SRTs are given byexpanding a routing algorithm for the conventional SRT.Network diameters are also discussed based on theproposed routing algorithms.Furthermorenetwork performances of the proposed SRTs are examined andit is shown that these SRTs much reduce diameterat large number of nodes.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1524","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"1521","bibliographicIssueDates":{"bibliographicIssueDate":"2003-06-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"6","bibliographicVolumeNumber":"44"}]},"relation_version_is_last":true,"item_2_alternative_title_2":{"attribute_name":"その他タイトル","attribute_value_mlt":[{"subitem_alternative_title":"並列・分散処理技術"}]},"weko_creator_id":"1"}}