{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00016794","sets":["934:935:969:970"]},"path":["970"],"owner":"1","recid":"16794","title":["特性の異なるループの融合によるコード最適化"],"pubdate":{"attribute_name":"公開日","attribute_value":"2002-09-15"},"_buckets":{"deposit":"79d5978b-50e1-45bf-b26f-ca469d03bb90"},"_deposit":{"id":"16794","pid":{"type":"depid","value":"16794","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"特性の異なるループの融合によるコード最適化","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"特性の異なるループの融合によるコード最適化"},{"subitem_title":"Fusing Loops with Incompatible Loop Headers","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"発表概要","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2002-09-15","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"電気通信大学大学院電気通信学研究科情報工学専攻"},{"subitem_text_value":"電気通信大学電気通信学部情報工学科"},{"subitem_text_value":"電気通信大学電気通信学部情報工学科"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science and Information Mathematics, Graduate School of Electro - Communications","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science, The University of Electro - Communications","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science, The University of Electro - Communications","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/16794/files/IPSJ-TPRO4308026.pdf"},"date":[{"dateType":"Available","dateValue":"2004-09-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TPRO4308026.pdf","filesize":[{"value":"34.7 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"15"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"d5e8382c-f502-42d2-9994-856d1f106fbd","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2002 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"樽石, 将人"},{"creatorName":"鈴木, 貢"},{"creatorName":"渡邊, 坦"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Masato, Taruishi","creatorNameLang":"en"},{"creatorName":"Mitsugu, Suzuki","creatorNameLang":"en"},{"creatorName":"Tan, Watanabe","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464814","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-7802","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"IA-64やAlphaのような，命令を高度に並列実行できるプロセッサにおいて，特性が互いに異なるループどうしを融合し，プログラムをより高速に実行する最適化方式を提案する．従来の多くの方式では，融合の対象をループの繰返し回数が同じ場合に制限し，また，融合するループ候補の探索について深く言及していなかった．一方，本方式は，プログラム中から，多くの融合候補を探索すると同時に，それらを，より一般的な方法で融合する．これにより，多くのwhileループに見られるような，繰返しの回数が不定で，メモリ参照等で繰返しの継続判定に多くの時間を要するようなループも融合の候補にできる．本方式の処理は，1）融合可能なループ候補の探索，2）候補どうしの融合，そして，3）融合の効果を高めるループの再分割からなる．ループの再分割アルゴリズムは，本方式で融合されたループに限らず，一般的なループにも適用できる．実験例では，ループの特性，アーキテクチャの違いにより，最適化の効果は異なるが，IA-64アーキテクチャ上で，最大で約3倍の速度改善が得られた．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"For processors with highly parallel execution capability such as IA-64 and Alpha, we present a method to execute programs faster by fusing loops with incompatible loop headers. Most traditional loop fusion technics have targeted on loops with compatible loop headers and have not focused on finding fusion candidates. Our method, however, finds a lot of fusion candidates in programs and fuses them in a more general manner, even if the candidates refer memory and take many cycles in their loop conditions, as seen in a lot of while-loops. Our method consists of three parts, that is, 1) finding fusion candidates, 2) fusing candidate loops, and 3) re-separating the fused loops. It is possible to apply the re-separating algorithm to not only fused loops but also general loops. Though evaluation results are architecture-dependent, we got about 3 times of time improvement in IA-64 architecture.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"125","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌プログラミング（PRO）"}],"bibliographicPageStart":"125","bibliographicIssueDates":{"bibliographicIssueDate":"2002-09-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"SIG08(PRO15)","bibliographicVolumeNumber":"43"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"updated":"2025-01-22T23:41:29.938550+00:00","created":"2025-01-18T22:49:58.049038+00:00","id":16794}