{"links":{},"id":33482,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00033482","sets":["1164:2735:2778:2781"]},"path":["2781"],"owner":"11","recid":"33482","title":["配列データに関する依存解析のための整数解探索"],"pubdate":{"attribute_name":"公開日","attribute_value":"2001-06-26"},"_buckets":{"deposit":"6afe5da4-55e0-488b-9455-5de2529f47b7"},"_deposit":{"id":"33482","pid":{"type":"depid","value":"33482","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"配列データに関する依存解析のための整数解探索","author_link":["458212","458216","458219","458218","458213","458215","458214","458217"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"配列データに関する依存解析のための整数解探索"},{"subitem_title":"Integer Solution Search for Data Dependence Analysis on Array References","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2001-06-26","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"和歌山大学大学院システム工学研究科"},{"subitem_text_value":"和歌山大学システム工学部"},{"subitem_text_value":"和歌山大学システム工学部"},{"subitem_text_value":"和歌山大学システム工学部"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Systems Engineering,Wakayama University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Systems Engineering,Wakayama University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Systems Engineering,Wakayama University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Systems Engineering,Wakayama 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/33482/files/IPSJ-MPS01035008.pdf","label":"IPSJ-MPS01035008"},"date":[{"dateType":"Available","dateValue":"2003-06-26"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS01035008.pdf","filesize":[{"value":"356.4 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":"17"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"81d019f3-996e-4907-9248-1d2646938e96","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2001 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":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Masaaki, Mineo","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Tetsutaro, Uehara","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Shoichi, Saito","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yoshitoshi, Kunieda","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10505667","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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"並列化を行う際にプログラムの中でもっとも効果が望めるのはループである。ループを並列化する際に単純に並列化を行うとデータの参照順が変わってしまう可能性がある。そのため、間違った実行結果になることがある。このような並列化が不可能なループを特定するためにはデータ依存解析が必須となる。このデータ依存解析手法には、既にいくつかの手法が提案されている。ここではその内、GCDテスト、Banerjeeテストを実装し、新たにBanerjeeテストを拡張し、依存距離と依存方向を求めること、そして第3の手法として線形計画法を応用することを提案し、これらの手法について考察する。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The first target of parallelization is a loop structure. However, when executing, the order of data access differs between parallel processing and an original sequential processing. Thus the execution result may change between them. Therefore automatic parallelizng compilers analyse the data access patern in loops. This analysis is called Data Dependence Analysis. Several analysing methods are already proposed for this data dependence analysis. GCD test, Banerjee test in those are implemented in our parallelizing compiler. This paper disserts these two and then newly proposes the extension of Banerjee test and the application of a linear programming as the 3rd method and studies all of them.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"32","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告数理モデル化と問題解決（MPS）"}],"bibliographicPageStart":"29","bibliographicIssueDates":{"bibliographicIssueDate":"2001-06-26","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"63(2001-MPS-035)","bibliographicVolumeNumber":"2001"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:02:18.739387+00:00","updated":"2025-01-19T23:37:12.586797+00:00"}