{"created":"2025-01-19T01:11:38.562250+00:00","updated":"2025-01-19T18:10:08.786939+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00210419","sets":["1164:2036:10484:10562"]},"path":["10562"],"owner":"44499","recid":"210419","title":["データ並列性を持つSimulinkモデルからのコード生成"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-03-18"},"_buckets":{"deposit":"3d289a5e-3e61-476a-8ddc-57e1b59b0c28"},"_deposit":{"id":"210419","pid":{"type":"depid","value":"210419","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"データ並列性を持つSimulinkモデルからのコード生成","author_link":["532646","532645"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"データ並列性を持つSimulinkモデルからのコード生成"},{"subitem_title":"Code Generation from Simulink Models with Data Parallelism","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"並列処理・モデルベース開発","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2021-03-18","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"名古屋大学大学院情報学研究科"},{"subitem_text_value":"名古屋大学大学院情報学研究科"}]},"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/210419/files/IPSJ-SLDM21194019.pdf","label":"IPSJ-SLDM21194019.pdf"},"date":[{"dateType":"Available","dateValue":"2023-03-18"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SLDM21194019.pdf","filesize":[{"value":"1.7 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":"10"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"6db13b91-9114-46f9-b5e2-749848bfa0b4","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 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":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11451459","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-8639","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本論文では，S-Function Builder ブロックを用いてデータ並列処理を記述した Simulink モデルから，データ並列化 SYCL コードを生成し，ヘテロジニアス計算機環境で実行する手法を提案する．その手順の大部分をスクリプトで自動化できる．また，そのデータ並列化手法と，我々が提案しているタスク並列化ツールである MBP を併用することができる．評価において，提案手法でデータ並列化したプログラムは逐次プログラムと比べて実行結果に差異がなく，CPU-GPU 計算機上で最大約 547 倍の高速化を達成した．また，タスク・データ並列化を併用したプログラムは，いずれの並列化手法を単独に適用したプログラムより性能が優れることを確認できた．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper, we propose a method where data-parallel SYCL code is generated from Simulink models in which computations with data parallelism are expressed in the form of S-Function Builder blocks, and is executed in heterogeneous computing environment. Most parts of the procedure can be automated with scripts. Also, the data-parallel method can be applied together with MBP, another parallelizer proposed by us that exploits task parallelism. In evaluation, data-parallel programs generated using our proposed method achieved a maximum speedup of approximately 547 times compared to sequential programs, without observable difference in the computed results. Also, the programs generated while exploiting both task parallelism and data parallelism were confirmed to have achieved better performance than those generated while exploiting either one of the two.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告システムとLSIの設計技術（SLDM）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2021-03-18","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"19","bibliographicVolumeNumber":"2021-SLDM-194"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":210419,"links":{}}