{"links":{},"id":24383,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00024383","sets":["1164:1579:1680:1681"]},"path":["1681"],"owner":"1","recid":"24383","title":["超並列計算機における各種ソートアルゴリズムの実装と評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"1992-12-03"},"_buckets":{"deposit":"29de839e-6d85-45c1-9b93-ebb5eabc989d"},"_deposit":{"id":"24383","pid":{"type":"depid","value":"24383","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"超並列計算機における各種ソートアルゴリズムの実装と評価","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"超並列計算機における各種ソートアルゴリズムの実装と評価"},{"subitem_title":"Implementation of several sorting algorithms on massively parallel computers and their evaluation","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1992-12-03","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京大学生産技術研究所"},{"subitem_text_value":"東京大学生産技術研究所"},{"subitem_text_value":"東京大学生産技術研究所"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Institute of Industrial Science, University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Institute of Industrial Science, University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Institute of Industrial Science, 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/24383/files/IPSJ-ARC92097012.pdf"},"date":[{"dateType":"Available","dateValue":"1994-12-03"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-ARC92097012.pdf","filesize":[{"value":"1.1 MB"}],"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":"4e8643d1-7165-4972-ab61-c13f83c94b8a","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1992 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"岡田, 英明"},{"creatorName":"喜連川, 優"},{"creatorName":"高木, 幹雄"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hideaki, Okada","creatorNameLang":"en"},{"creatorName":"Masaru, Kitsuregawa","creatorNameLang":"en"},{"creatorName":"Mikio, Takagi","creatorNameLang":"en"}],"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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"多くの並列ソートアルゴリズムが提案され、並列計算機上への実装についても報告されているが、並列ソーティングにおいては比較計算量の他にネットワークを介したデータの移動を考慮する必要があるため、様々な計算機アーキテクチャ、データ数などのソート条件に適したソートアルゴリズムの開発が望まれる。そこで、本論文では既存の2つのアルゴリズムならびに改良したアルゴリズムを並列計算機CM?2，MP?1，AP1000に実装し、評価する。また、最適なソートアルゴリズム選択についても考察する。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Various parallel sorting algorithms have been proposed and their implementation on parallel computers have also been reported. On parallel sorting, we must consider not only comparison or computation but also data movement through intercommunication network. So sorting algorithms suitable for various computer architecture and condition of sorting such as number of data are required. In this paper, we implement two algorithms and our improved algorithm on parallel computer CM-2, MP-1, AP1000, and evaluate them. We also consider selection of most suitable sorting algorithm.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"96","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告計算機アーキテクチャ（ARC）"}],"bibliographicPageStart":"89","bibliographicIssueDates":{"bibliographicIssueDate":"1992-12-03","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"97(1992-ARC-097)","bibliographicVolumeNumber":"1992"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T22:55:32.105831+00:00","updated":"2025-01-22T19:56:47.946642+00:00"}