{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00217756","sets":["1164:2240:10902:10922"]},"path":["10922"],"owner":"44499","recid":"217756","title":["スレッド並列化されたソートの富岳上での性能評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-05-04"},"_buckets":{"deposit":"6752763e-9779-4bb1-9d5d-82dad9e0ffee"},"_deposit":{"id":"217756","pid":{"type":"depid","value":"217756","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"スレッド並列化されたソートの富岳上での性能評価","author_link":["564802","564803"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"スレッド並列化されたソートの富岳上での性能評価"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"性能評価","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2022-05-04","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"千葉大学融合理工学府数学情報科学専攻情報科学コース"},{"subitem_text_value":"千葉大学統合情報センター"}]},"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/217756/files/IPSJ-HPC22184001.pdf","label":"IPSJ-HPC22184001.pdf"},"date":[{"dateType":"Available","dateValue":"2024-05-04"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-HPC22184001.pdf","filesize":[{"value":"920.6 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":"14"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"a320da01-f9be-478c-a1c5-5b46a6ba41c8","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 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":"AN10463942","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-8841","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"ソートは最も基本的なアルゴリズムの 1 つである．一方，スーパーコンピュータ「富岳」の 1 ノードは 48CPU コアで構成されており，高度に並列化されたソートプログラムが重要である．しかし，「富岳」上で高速かつ高い並列化性能をもつソートプログラムはあまり報告されていない．本研究ではサンプルソートをベースにした 2 種類のスレッド並列ソートアルゴリズムを実装し，「富岳」上で性能比較を行った．ひとつめは，入力列を複数のブロックに分けてそれぞれソートし，各ブロックから等間隔にサンプリングを行いピボットを選ぶ．ふたつめは，ピボットの選び方が異なり，全てのパーティションの要素数が等しくなるようなピボットを二分探索によって選ぶ．それぞれに対し，逐次ソートやマージのアルゴリズムを変えて性能を比較した．その結果，条件分岐を減らすことで高速化されたクイックソート（Block Quick sort）を逐次ソートに，selection tree をマージに用いたふたつめのサンプルソートが，さまざまな入力に対し安定して高い速度性能および並列化性能を示した．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告ハイパフォーマンスコンピューティング（HPC）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2022-05-04","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2022-HPC-184"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":217756,"updated":"2025-01-19T15:23:25.444163+00:00","links":{},"created":"2025-01-19T01:18:13.332495+00:00"}