{"updated":"2025-01-21T13:04:28.523239+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00096954","sets":["934:935:7043:7352"]},"path":["7352"],"owner":"11","recid":"96954","title":["木上のスケルトン並列プログラミングのための演算子生成器"],"pubdate":{"attribute_name":"公開日","attribute_value":"2013-12-25"},"_buckets":{"deposit":"9f542f88-b8e6-4cf8-be64-243ca4f33e31"},"_deposit":{"id":"96954","pid":{"type":"depid","value":"96954","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"木上のスケルトン並列プログラミングのための演算子生成器","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"木上のスケルトン並列プログラミングのための演算子生成器"},{"subitem_title":"An Operator Generator for Skeletal Programming on Trees","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[通常論文] 木スケルトン，演算子，双線型計算，並列プログラミング，コンパイラ","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2013-12-25","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"電気通信大学大学院情報理工学研究科"},{"subitem_text_value":"高知工科大学情報学群"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Informatics and Engineering, The University of Electro-Communications","subitem_text_language":"en"},{"subitem_text_value":"School of Information, Kochi University of Technology","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/96954/files/IPSJ-TPRO0604005.pdf"},"date":[{"dateType":"Available","dateValue":"2015-12-25"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TPRO0604005.pdf","filesize":[{"value":"560.2 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":"15"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"88b097bf-5210-429a-adaf-340ff9d8b171","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2013 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"佐藤, 重幸"},{"creatorName":"松崎, 公紀"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Shigeyuki, Sato","creatorNameLang":"en"},{"creatorName":"Kiminori, Matsuzaki","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":"木上の並列計算を抽象化および構造化する手段として，木スケルトンというものが存在する．著者らは，木スケルトンをC++上の高階関数ライブラリとして実装してきている．この木スケルトンは，効率的な並列計算を保証するために，逐次計算において使われる演算子に加えて，補演算子も要求する．この補演算子の導出は一般に難しく，木スケルトンの利用への大きな障害となっている．そこで本研究では，既存の補演算子導出法に基づいた演算子生成器を，Cコンパイラ拡張として実装した．本システムは，木スケルトンを隠蔽することで，利用者が木スケルトンの複雑さに触れることを防ぐ．利用者は逐次的な再帰関数をCで記述するだけで，暗黙かつ単純に木スケルトンを利用できるようになる．したがって，本システムは，木上のスケルトン並列プログラミングの難しさを首尾よく解消する．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Tree skeletons are known as a way of abstracting and structuringparallel computation on trees. We have been implementing tree skeletonsas a library of higher-order functions in C++. For efficient parallelcomputing, our tree skeletons necessitate auxiliary operators as well asoperators used in sequential computation. Since an auxiliary operator isdifficult to derive in general, our tree skeletons are too difficult fornon-expert programmers to use. To overcome this difficulty, on thetheoretical basis of existing work, we have developed an operatorgenerator in the form of an extension to a C compiler. By hiding a treeskeleton itself, our implementation prevents users from touching itscomplicatedness; then they have only to describe recursive functions inC to use a tree skeleton simply and implicitly. Our implementationresolves the difficulty of skeletal programming on trees successfully.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"49","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌プログラミング（PRO）"}],"bibliographicPageStart":"38","bibliographicIssueDates":{"bibliographicIssueDate":"2013-12-25","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"4","bibliographicVolumeNumber":"6"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-18T23:43:39.634044+00:00","id":96954,"links":{}}