{"created":"2023-07-25T10:24:19.137888+00:00","id":1622,"links":{},"metadata":{"_buckets":{"deposit":"388c7764-881b-4229-a60b-08c82c830abf"},"_deposit":{"created_by":1,"id":"1622","owners":[1],"pid":{"revision_id":0,"type":"depid","value":"1622"},"status":"published"},"_oai":{"id":"oai:hiroshima-cu.repo.nii.ac.jp:00001622","sets":["52:367:369"]},"author_link":["6596","6594","6595","6590","6593","6591","6597","6592"],"item_10003_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1996-09-04","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicPageEnd":"322","bibliographicPageStart":"321","bibliographicVolumeNumber":"第53回平成8年後期","bibliographic_titles":[{"bibliographic_title":"全国大会講演論文集"}]}]},"item_10003_description_19":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_10003_description_5":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"ループを並列化するとき、ループ運搬依存がないときは、Doallループとして並列化し、ループ運搬依存があるときは、同期操作がある Doacrossループとして並列化する。本研究では、Doacrossループの実行時間と、最速の実行に必要なプロセッサ数の見積りについて述べる。これまでにCytronによって、Doacrossループの実行時間と最適プロセッサ数の見積りについての研究がなされている。福田は、1重ループに対して、キャッシュなどの影響を考慮して、l回目の繰り返しと、2回目以降の繰り返しで実行時間が違うモデルでの研究を行っている。従来の研究では、繰り返し間の依存による待ち時間の部分は考慮されているが、同期操作自体での消費時間が考慮されていなかった。また、実際の並列計算機での評価が行われていなかった。","subitem_description_type":"Abstract"}]},"item_10003_publisher_8":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会"}]},"item_10003_relation_12":{"attribute_name":"論文ID（NAID）","attribute_value_mlt":[{"subitem_relation_type":"isIdenticalTo","subitem_relation_type_id":{"subitem_relation_type_id_text":"110002887578","subitem_relation_type_select":"NAID"}}]},"item_10003_relation_17":{"attribute_name":"関連サイト","attribute_value_mlt":[{"subitem_relation_name":[{"subitem_relation_name_text":"http://www.ipsj.or.jp/"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"http://www.ipsj.or.jp/","subitem_relation_type_select":"URI"}}]},"item_10003_rights_15":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"ここに掲載した著作物の利用に関する注意：本著作物の著作権は（社）情報処理学会に帰属します。本著作物は著作権者である情報処理学会の許可のもとに掲載するものです。ご利用に当たっては「著作権法」ならびに「情報処理学会倫理綱領」に従うことをお願いいたします。 "},{"subitem_rights":"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."},{"subitem_rights":"本文データは学協会の許諾に基づきCiNiiから複製したものである。"}]},"item_10003_source_id_11":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_10003_version_type_20":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"児島, 彰"},{"creatorName":"コジマ, アキラ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{"nameIdentifier":"6590","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"藤野, 清次"},{"creatorName":"フジノ, セイジ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{"nameIdentifier":"6591","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"弘中, 哲夫"},{"creatorName":"ヒロナカ, テツオ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{"nameIdentifier":"6592","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"高山, 毅"},{"creatorName":"タカヤマ, ツヨシ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{"nameIdentifier":"6593","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"KOJIMA, Akira","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"6594","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"FUJINO, Seiji","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"6595","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"HIRONAKA, Tetsuo","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"6596","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"TAKAYAMA, Tsuyoshi","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"6597","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2023-03-02"}],"displaytype":"detail","filename":"110002887578.pdf","filesize":[{"value":"168.8 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"110002887578.pdf","url":"https://hiroshima-cu.repo.nii.ac.jp/record/1622/files/110002887578.pdf"},"version_id":"c2738cfb-aedc-4774-809c-5c41749c1b1d"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"conference paper","resourceuri":"http://purl.org/coar/resource_type/c_5794"}]},"item_title":"Doacrossループの実行時間と最適プロセッサ数","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Doacrossループの実行時間と最適プロセッサ数"},{"subitem_title":"Estimation of the Time and the Optimal Number of Processors for Doacross Loops","subitem_title_language":"en"}]},"item_type_id":"10003","owner":"1","path":["369"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-03-02"},"publish_date":"2023-03-02","publish_status":"0","recid":"1622","relation_version_is_last":true,"title":["Doacrossループの実行時間と最適プロセッサ数"],"weko_creator_id":"1","weko_shared_id":1},"updated":"2023-07-25T10:38:01.927516+00:00"}