{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00174159","sets":["1164:2240:8543:8882"]},"path":["8882"],"owner":"11","recid":"174159","title":["数式の依存グラフを仕様とするOpenMPプログラムのメモリ参照効率向上"],"pubdate":{"attribute_name":"公開日","attribute_value":"2016-08-01"},"_buckets":{"deposit":"0c592c08-4589-428f-bf3d-edb859683a5d"},"_deposit":{"id":"174159","pid":{"type":"depid","value":"174159","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"数式の依存グラフを仕様とするOpenMPプログラムのメモリ参照効率向上","author_link":["356377","356366","356376","356367","356374","356372","356371","356370","356373","356368","356369","356375"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"数式の依存グラフを仕様とするOpenMPプログラムのメモリ参照効率向上"},{"subitem_title":"Improving Memory Efficiency of OpenMP Program specified in Equation Dependency Graph","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"データレイアウト","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2016-08-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 Computer Science, Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science, Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Integrated Open Systems Unit, Okinawa Institute of Science and Technology","subitem_text_language":"en"},{"subitem_text_value":"Integrated Open Systems Unit, Okinawa Institute of Science and Technology","subitem_text_language":"en"},{"subitem_text_value":"Integrated Open Systems Unit, Okinawa Institute of Science and Technology","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science, Graduate School of Information Science and Technology, Osaka 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/174159/files/IPSJ-HPC16155045.pdf","label":"IPSJ-HPC16155045.pdf"},"date":[{"dateType":"Available","dateValue":"2018-08-01"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-HPC16155045.pdf","filesize":[{"value":"1.8 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":"14"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"546cee03-85c3-41bc-ad09-ebeee25c9192","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2016 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"角田, 優貴"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"置田, 真生"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"安部, 武志"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"浅井, 義之"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"北野, 宏明"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"萩原, 兼一"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yuki, Kakuda","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Masao, Okita","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Takeshi, Abe","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yoshiyuki, Asai","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hiroaki, Kitano","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kenichi, Hagihara","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_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8841","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"有向非巡回グラフ G は，単一代入プログラムの計算順の規定に用いられる．G を解析することで，並列実行可能な計算順序を得られる．これに基づいて生成した並列プログラム PP では，変数の主記憶への配置およびレベル内の評価順に自由度がある．本研究では，データ間の依存関係に注目して主記憶参照効率の良いデータ配置およびスケジュールを定めるための手法を提案する．評価には汎用生体シミュレータ Flint を用いた．Flint は，XML 系の言語で書かれた生体モデルから数式の依存グラフを作成し，それに基づき並列シミュレーションコードを生成する．心筋細胞のモデルから生成した 32 並列 OpenMP コードの実行において，最大 1.61 倍の高速化を達成した．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Directed acyclic graph G is used to determine an evaluation order of a single-assignment form program. Analysis of G results in a parallel schedule. The parallel program PP generated from it has flexibility in terms of the data layout and the schedule in each level. we propose methods of data arrangement and scheduling for improving memory efficiency. In experiments, we apply our methods to Flint, a general physiological simulator. Flint interprets a given model written in a XML-based language as an equation dependency graph, and then generates a parallel simulation program based on the graph. With a model of ventricular cardiac action potential, our method accelerates OpenMP programs running on 32 threads up to 1.61 times.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"9","bibliographic_titles":[{"bibliographic_title":"研究報告ハイパフォーマンスコンピューティング（HPC）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2016-08-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"45","bibliographicVolumeNumber":"2016-HPC-155"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":174159,"updated":"2025-01-20T07:01:50.471357+00:00","links":{},"created":"2025-01-19T00:44:23.350566+00:00"}