{"updated":"2025-01-19T17:38:06.419735+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00211912","sets":["1164:1579:10482:10619"]},"path":["10619"],"owner":"44499","recid":"211912","title":["Approximate Memoryにおけるエラー混入対象データの重要度の事前推定に関する検討"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-07-13"},"_buckets":{"deposit":"69238873-3135-4969-929e-4452c9790b51"},"_deposit":{"id":"211912","pid":{"type":"depid","value":"211912","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Approximate Memoryにおけるエラー混入対象データの重要度の事前推定に関する検討","author_link":["539389","539390"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Approximate Memoryにおけるエラー混入対象データの重要度の事前推定に関する検討"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"近似計算","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2021-07-13","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京大学情報理工学系研究科創造情報学専攻"},{"subitem_text_value":"東京大学情報理工学系研究科創造情報学専攻"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Creative Informatics, Graduate School of Information Science and Technology, The University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Department of Creative Informatics, Graduate School of Information Science and Technology, The University of Tokyo","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/211912/files/IPSJ-ARC21245014.pdf","label":"IPSJ-ARC21245014.pdf"},"date":[{"dateType":"Available","dateValue":"2023-07-13"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-ARC21245014.pdf","filesize":[{"value":"826.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":"16"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"53661eef-61c6-4ea8-836d-ad0a66c87d29","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 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":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10096105","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_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8574","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"CPU 性能の増加に伴う DRAM アクセスレイテンシの相対的な増大が問題となっており，そのためデータに低確率でエラーが入ることを許す代わりに低レイテンシでのアクセスが可能な Approximate Memory が注目されている．Approximate Memory を実用するためには，エラーにより引き起こされるアプリケーションの計算結果の誤差を見積もり，高速化とのトレードオフを制御することが望ましい．デバイスレベルのエラー発生と遅延の関係は広く研究されているものの，エラー発生に伴う最終的なアプリケーションレベルの計算誤差と高速化の関係は未知である．そこで本研究では，Approximate Memory 上の入力データに混入するエラーが計算結果に与える影響を事前推定することを提案する．プログラムを入力データを受け取り計算結果を返す数学的な関数と捉え，自動微分技術を用いて入力データの各チャンクに対し，チャンク内のデータが微少量ずれた場合の計算結果のずれを表す「重要度」を計算する．このための初期検討として，複数のアプリケーションの代表的な入力データの重要度を計算し，アプリケーションごとの重要度のデータ依存性を議論する．実験の結果，多くのアプリケーションでは重要度のデータ依存性は小さく，事前計算した重要度を未知の入力データにも利用できる可能性が高いことを示した．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"10","bibliographic_titles":[{"bibliographic_title":"研究報告システム・アーキテクチャ（ARC）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2021-07-13","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"14","bibliographicVolumeNumber":"2021-ARC-245"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:13:01.789342+00:00","id":211912,"links":{}}