{"_buckets": {"deposit": "1ef5e80b-97c1-4153-bdef-07b8d03dda09"}, "_deposit": {"id": "8567", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "8567"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00008567", "sets": ["322"]}, "author_link": ["24115", "24116", "24117", "24118", "24119", "24120"], "item_10_alternative_title_19": {"attribute_name": "その他のタイトル", "attribute_value_mlt": [{"subitem_alternative_title": "Incremental Processing for Parallel Execution of Loops with Shared Array", "subitem_alternative_title_language": "en"}]}, "item_10_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2001-04", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "4", "bibliographicPageEnd": "859", "bibliographicPageStart": "847", "bibliographicVolumeNumber": "42", "bibliographic_titles": [{"bibliographic_title": "情報処理学会論文誌", "bibliographic_titleLang": "ja"}]}]}, "item_10_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "ループ文の並列実行では,イタレーション単位の並列実行が基本となっている.しかし,複雑なループ伝搬依存が存在するループ文では,イタレーション間の並列性を抽出することは困難である.また,計算機クラスタ環境では,タスク間通信オーバヘッドなどによりイタレーション単位の細粒度並列処理は適さない.本稿では,ループ文の並列実行方式である漸進処理を提案する.漸進処理では,同一配列データを操作する複数のループ文をパイプライン的に実行させる.ループ文はそれぞれ並列実行されるが,各ループ文内のイタレーションは逐次的に実行されるので,複雑なループ伝搬依存が存在しても適用可能である.また,イタレーションでなく,ループ文全体がタスク生成の単位となるので,タスク起動のオーバヘッドを削減でき,計算と通信のオーバラップにより通信オーバヘッドを減少させることができる.漸進処理を適用するためには,ループ文における配列データ要素の操作順序を解析する必要がある.我々はループ文での操作順序をアクセス・パターンとして定義し,漸進処理を効率的に行うためにアクセス・パターンの類似性を解析する漸進処理適用判定アルゴリズムを開発した.また,様々なループ文に対して漸進処理適用判定アルゴリズムを適用し,アルゴリズムの有効性についても調査した. ", "subitem_description_language": "ja", "subitem_description_type": "Abstract"}, {"subitem_description": "Traditionally, in parallel execution of loops, iterations are executed in parallel. However, we can not extract parallelism among iterations for the loop which has complex loop-carried dependences. In addition, iteration-based parallel execution is not suitable to the computer cluster environment because of task granularity. In this paper, we propose the incremental processing for parallel execution of loops. In the incremental processing, plural loops which access same array data are executed in parallel with the pipeline method. We can apply incremental processing to loops with complex loop-carried dependences since incremental processing makes full use of parallelism among loops and iterations in loops are executed sequentially. Furthermore, loops are executed in parallel by means of overlap between computation and communication, which reduces communication overhead among tasks. For incremental processing, analysis of the access order on array elements in the loop is very important. We introduce the access pattern which defines the access order in loops, and develop the algorithm for analyzing the similarity of access patterns. We also examine the effectivity of our algorithm for parallel execution of loops with shared arrays.", "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/10316"}]}, "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\u003cat\u003eipsj.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": "24115", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "SANDA, KATSUSHI", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "24116", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "朝倉, 宏一", "creatorNameLang": "ja"}], "nameIdentifiers": [{"nameIdentifier": "24117", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "ASAKURA, KOICHI", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "24118", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "渡邉, 豊英", "creatorNameLang": "ja"}], "nameIdentifiers": [{"nameIdentifier": "24119", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "WATANABE, TOYOHIDE", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "24120", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2018-02-19"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "42-4-847-859.pdf", "filesize": [{"value": "1.1 MB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 1100000.0, "url": {"label": "42-4-847-859.pdf", "objectType": "fulltext", "url": "https://nagoya.repo.nii.ac.jp/record/8567/files/42-4-847-859.pdf"}, "version_id": "4bf55b16-2bec-4e80-b326-5b96d67c72f4"}]}, "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"], "permalink_uri": "http://hdl.handle.net/2237/10316", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2008-08-04"}, "publish_date": "2008-08-04", "publish_status": "0", "recid": "8567", "relation": {}, "relation_version_is_last": true, "title": ["配列データを共有したループ文の並列実行のための漸進処理手法"], "weko_shared_id": -1}