{"id":74134,"updated":"2025-01-21T21:40:22.649251+00:00","links":{},"created":"2025-01-18T23:31:48.679351+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00074134","sets":["934:1119:6347:6418"]},"path":["6418"],"owner":"11","recid":"74134","title":["メッセージフローに基づくネットワークシミュレータMFSの評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-05-12"},"_buckets":{"deposit":"e143c29d-cb8c-4287-99c2-7b5ea50329c9"},"_deposit":{"id":"74134","pid":{"type":"depid","value":"74134","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"メッセージフローに基づくネットワークシミュレータMFSの評価","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"メッセージフローに基づくネットワークシミュレータMFSの評価"},{"subitem_title":"An Evaluation of Message-flow-based Network Simulator","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"相互結合網","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2011-05-12","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"電気通信大学"},{"subitem_text_value":"東京工科大学"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"The University of Electro-Communications","subitem_text_language":"en"},{"subitem_text_value":"Tokyo University of 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/74134/files/IPSJ-TACS0403007.pdf"},"date":[{"dateType":"Available","dateValue":"2013-05-12"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TACS0403007.pdf","filesize":[{"value":"612.2 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":"16"},{"tax":["include_tax"],"price":"0","billingrole":"11"},{"tax":["include_tax"],"price":"0","billingrole":"14"},{"tax":["include_tax"],"price":"0","billingrole":"15"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"f8ad2a22-f801-4ac8-9e74-007ae47eacbf","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"矢崎, 俊志"},{"creatorName":"石畑, 宏明"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Syunji, Yazaki","creatorNameLang":"en"},{"creatorName":"Hiroaki, Ishihata","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11833852","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_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7829","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本論文では，筆者らが通信アルゴリズムの評価を目的として提案したフローベースシミュレータ Message Flow Simulator（MFS） の，より汎用的な利用可能性を示すため，既存のパケットベースシミュレータ Booksim を用いて様々なネットワークトポロジと通信パターンで MFS を比較評価した結果を述べる．筆者らはこれまで，MFS がパケットベースシミュレータ BigSimulator より短時間で全対全通信アルゴリズムを評価可能であることを示した．また，メッセージが相互結合網を通過する時間のみを評価可能な Booksim を用いて，Fattree ネットワーク上のランダム通信シミュレーションによる比較評価を行ってきた．本論文では新たに MFS と Booksim のシミュレーション結果の差がスイッチで行われるアービトレーションの影響により生じることを示した．このことから，通信の平均ホップ数が少ないトポロジのネットワーク評価や，近距離のノード通信を頻繁に行う並列プログラムの通信シミュレーションに MFS が利用できる可能性を示した．1 万ノード以上の大規模なネットワークについて，全ノードが 10 パケットをランダムな宛先に送るシミュレーションを実行した．このとき，MFS は Booksim の 1～2% の実行時間とメモリ使用量でシミュレーションを実行した．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This paper describes evaluation results of Message Flow Simulator (MFS) to show capabilities of application of MFS. MFS is a flow-based network simulator for large-scale parallel computer. We previously showed that MFS performed simulation of all-to-all communication algorithms faster than BigSimulator which is a packet-based network simulator. We also compared evaluation results of communication time estimated by MFS and Booksim which is a packet-based network simulator. In the paper, we show that MFS gives different result with Booksim due to effect of the arbitration in the router. From this result, we find that MFS provides better results when many messages are communicated in low hop count or average hop count in networks is low. MFS performs simulation with less run-time and memory usage when the number of nodes is over 10,000. Run-time and memory usage of MFS were from 1% to 2% by those of Booksim.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"55","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌コンピューティングシステム（ACS） "}],"bibliographicPageStart":"47","bibliographicIssueDates":{"bibliographicIssueDate":"2011-05-12","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"4"}]},"relation_version_is_last":true,"weko_creator_id":"11"}}