{"created":"2021-03-01T06:15:17.296379+00:00","id":8569,"links":{},"metadata":{"_buckets":{"deposit":"ae8ebdf1-e094-40b2-b771-082e90f52cc2"},"_deposit":{"id":"8569","owners":[],"pid":{"revision_id":0,"type":"depid","value":"8569"},"status":"published"},"_oai":{"id":"oai:nagoya.repo.nii.ac.jp:00008569","sets":["320:321:322"]},"author_link":["24123","24124","24125","24126"],"item_10_alternative_title_19":{"attribute_name":"その他のタイトル","attribute_value_mlt":[{"subitem_alternative_title":"Convolution Calculation for Access Pattern Analysis in Nested Loops","subitem_alternative_title_language":"en"}]},"item_10_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2002-09","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"87","bibliographicPageStart":"77","bibliographicVolumeNumber":"43","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌","bibliographic_titleLang":"ja"}]}]},"item_10_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"ループ文の並列実行には,ループ文中で配列データがどのように操作されるかの解析が重要である.現在までにも,ループ文全体の実行における配列データの操作領域を解析する手法が多く提案されてきた.しかし,これらの手法では操作する領域を解析できるが,領域中の配列要素の操作順序などを解析することはできない.我々は,ループ文中の配列操作の順序を表現可能なアクセス・パターン表現を提案している.アクセス・パターンはループ文全体の実行で操作される配列データの操作領域だけでなく,ループ文の実行にともない操作領域がどのように変形,移動するかを表現可能としている.本稿では,アクセス・パターン解析アルゴリズムについて述べる.ネストしたループ文においてアクセス・パターンを解析するための畳込み演算を定義する.2つのアクセス・パターンが畳込み可能である条件を示し,畳込みによって得られるアクセス.パターンの計算方法について述べる.畳込み演算を定義することで,ネストしたループ文に対するアクセス・パターンの解析が可能となり,ループ文の漸進処理を適用することができる. ","subitem_description_language":"ja","subitem_description_type":"Abstract"},{"subitem_description":"For loop parallel processing, it is very important to analyze array manipulations in loops. Until today, many analysis methods have been proposed, in which the access region of array data in the whole loop execution is calculated. However, these methods can achieve only the access region analysis but do not take the access order of array elements into account. We have already proposed an access pattern representation in order to describe the access order of array manipulations in loops. With the access pattern representation, the movement and transformation of access region of array data according to value change of a loop variable can be analyzed correctly. In this paper, we propose an algorithm for calculating the access patterns. In order to calculate access patterns correctly in nested loops, a convolution calculation is introduced. We show conditions for application of the convolution calculation to two access patterns, and algorithm for calculating combined access patterns for nested loops. By introduction of the convolution calculation, we can apply the incremental parallel processing to nested loops appropriately.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_10_identifier_60":{"attribute_name":"URI","attribute_value_mlt":[{"subitem_identifier_type":"HDL","subitem_identifier_uri":"http://hdl.handle.net/2237/10317"}]},"item_10_publisher_32":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"item_10_rights_12":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"ここに掲載した著作物の利用に関する注意 本著作物の著作権は（社）情報処理学会に帰属します。本著作物は著作権者である情報処理学会の許可のもとに掲載するものです。ご利用に当たっては「著作権法」ならびに「情報処理学会倫理綱領」に従うことをお願いいたします。 Notice for the use of this material The copyright of this material is retained by the Information Processing Society of Japan (IPSJ). This material is published on this web site with the agreement of the author (s) and the IPSJ. Please be complied with Copyright Law of Japan and the Code of Ethics of the IPSJ if any users wish to reproduce, make derivative work, distribute or make available to the public any part or whole thereof. All Rights Reserved, Copyright (C) Information Processing Society of Japan. Comments are welcome. Mail to address: 　editj<at>ipsj.or.jp, please.","subitem_rights_language":"ja"}]},"item_10_select_15":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_select_item":"publisher"}]},"item_10_source_id_7":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"03875806","subitem_source_identifier_type":"PISSN"}]},"item_10_text_14":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_text_value":"application/pdf"}]},"item_1615787544753":{"attribute_name":"出版タイプ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_access_right":{"attribute_name":"アクセス権","attribute_value_mlt":[{"subitem_access_right":"open access","subitem_access_right_uri":"http://purl.org/coar/access_right/c_abf2"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"朝倉, 宏一","creatorNameLang":"ja"}],"nameIdentifiers":[{"nameIdentifier":"24123","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"ASAKURA, KOICHI","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"24124","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"渡邉, 豊英","creatorNameLang":"ja"}],"nameIdentifiers":[{"nameIdentifier":"24125","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"WATANABE, TOYOHIDE","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"24126","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2018-02-19"}],"displaytype":"detail","filename":"43-s6.pdf","filesize":[{"value":"1.0 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"43-s6.pdf","objectType":"fulltext","url":"https://nagoya.repo.nii.ac.jp/record/8569/files/43-s6.pdf"},"version_id":"df59fe3c-9744-43b3-96c9-28915907cf66"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"ループ文アクセス・パターン解析における畳込み演算","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"ループ文アクセス・パターン解析における畳込み演算","subitem_title_language":"ja"}]},"item_type_id":"10","owner":"1","path":["322"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2008-08-04"},"publish_date":"2008-08-04","publish_status":"0","recid":"8569","relation_version_is_last":true,"title":["ループ文アクセス・パターン解析における畳込み演算"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2023-01-16T03:54:14.831572+00:00"}