WEKO3
アイテム
{"_buckets": {"deposit": "cd10e017-ec2b-41f4-bc64-e5af48b24b93"}, "_deposit": {"id": "47933", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "47933"}, "status": "published"}, "_oai": {"id": "oai:tsukuba.repo.nii.ac.jp:00047933", "sets": ["1458", "1368"]}, "item_5_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2018-07", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "10", "bibliographicPageStart": "1", "bibliographicVolumeNumber": "75", "bibliographic_titles": [{"bibliographic_title": "Parallel computing"}]}]}, "item_5_creator_3": {"attribute_name": "著者別名", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "高橋, 大介"}], "nameIdentifiers": [{"nameIdentifier": "467", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "00292714", "nameIdentifierScheme": "e-Rad", "nameIdentifierURI": "https://nrid.nii.ac.jp/ja/nrid/1000000292714"}, {"nameIdentifier": "0000000955", "nameIdentifierScheme": "筑波大学研究者総覧", "nameIdentifierURI": "http://trios.tsukuba.ac.jp/researcher/0000000955"}]}]}, "item_5_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "This paper presents the computation of a specific hexadecimal digit of π by using a Bailey–Borwein–Plouffe (BBP)-type formula on a cluster of Intel Xeon Phi processors. The BBP-type formula can be computed using modular exponentiation. We use Montgomery multiplication for the modular multiplication, which is the most time-consuming part of the modular exponentiation. We vectorize multiple modular exponentiations and multiple integer divisions by using Intel Advanced Vector Extensions 512 (Intel AVX-512) instructions. A parallel implementation of the BBP-type formula is presented. The 100 quadrillionth hexadecimal digit of π was computed on a 512-node cluster of Intel Xeon Phi processors with an elapsed time of 641 h 29 min that includes the time required for verification.", "subitem_description_type": "Abstract"}]}, "item_5_publisher_27": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "Elsevier"}]}, "item_5_relation_11": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type_id": {"subitem_relation_type_id_text": "10.1016/j.parco.2018.02.002", "subitem_relation_type_select": "DOI"}}]}, "item_5_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "© 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/"}]}, "item_5_select_15": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "author"}]}, "item_5_source_id_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "0167-8191", "subitem_source_identifier_type": "ISSN"}]}, "item_5_source_id_9": {"attribute_name": "書誌レコードID", "attribute_value_mlt": [{"subitem_source_identifier": "AA10471949", "subitem_source_identifier_type": "NCID"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Takahashi, Daisuke"}], "nameIdentifiers": [{"nameIdentifier": "200044", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2020-08-01"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "PC_75-1.pdf", "filesize": [{"value": "129.3 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_11", "mimetype": "application/pdf", "size": 129300.00000000001, "url": {"label": "PC_75-1", "url": "https://tsukuba.repo.nii.ac.jp/record/47933/files/PC_75-1.pdf"}, "version_id": "94987424-b2ce-460d-b44b-41245409aec7"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Computation of the 100 quadrillionth hexadecimal digit of π on a cluster of Intel Xeon Phi processors", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Computation of the 100 quadrillionth hexadecimal digit of π on a cluster of Intel Xeon Phi processors"}]}, "item_type_id": "5", "owner": "1", "path": ["1458", "1368"], "permalink_uri": "http://hdl.handle.net/2241/00153370", "pubdate": {"attribute_name": "公開日", "attribute_value": "2018-10-01"}, "publish_date": "2018-10-01", "publish_status": "0", "recid": "47933", "relation": {}, "relation_version_is_last": true, "title": ["Computation of the 100 quadrillionth hexadecimal digit of π on a cluster of Intel Xeon Phi processors"], "weko_shared_id": 5}
Computation of the 100 quadrillionth hexadecimal digit of π on a cluster of Intel Xeon Phi processors
http://hdl.handle.net/2241/00153370
http://hdl.handle.net/2241/00153370b9c935ca-edb8-44c2-b143-0daa942ee081
名前 / ファイル | ライセンス | アクション |
---|---|---|
PC_75-1 (129.3 kB)
|
Item type | Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2018-10-01 | |||||
タイトル | ||||||
タイトル | Computation of the 100 quadrillionth hexadecimal digit of π on a cluster of Intel Xeon Phi processors | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源 | http://purl.org/coar/resource_type/c_6501 | |||||
タイプ | journal article | |||||
著者 |
Takahashi, Daisuke
× Takahashi, Daisuke |
|||||
著者別名 |
高橋, 大介
× 高橋, 大介 |
|||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | This paper presents the computation of a specific hexadecimal digit of π by using a Bailey–Borwein–Plouffe (BBP)-type formula on a cluster of Intel Xeon Phi processors. The BBP-type formula can be computed using modular exponentiation. We use Montgomery multiplication for the modular multiplication, which is the most time-consuming part of the modular exponentiation. We vectorize multiple modular exponentiations and multiple integer divisions by using Intel Advanced Vector Extensions 512 (Intel AVX-512) instructions. A parallel implementation of the BBP-type formula is presented. The 100 quadrillionth hexadecimal digit of π was computed on a 512-node cluster of Intel Xeon Phi processors with an elapsed time of 641 h 29 min that includes the time required for verification. | |||||
書誌情報 |
Parallel computing 巻 75, p. 1-10, 発行日 2018-07 |
|||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 0167-8191 | |||||
書誌レコードID | ||||||
収録物識別子タイプ | NCID | |||||
収録物識別子 | AA10471949 | |||||
DOI | ||||||
識別子タイプ | DOI | |||||
関連識別子 | 10.1016/j.parco.2018.02.002 | |||||
権利 | ||||||
権利情報 | © 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ | |||||
著者版フラグ | ||||||
値 | author | |||||
出版者 | ||||||
出版者 | Elsevier |