{"updated":"2025-01-22T19:53:32.131924+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00024493","sets":["1164:1579:1688:1692"]},"path":["1692"],"owner":"1","recid":"24493","title":["ドラゴンネットを用いた並列ソート"],"pubdate":{"attribute_name":"公開日","attribute_value":"1991-10-07"},"_buckets":{"deposit":"5a599c8e-b178-4342-8a56-04cddc655162"},"_deposit":{"id":"24493","pid":{"type":"depid","value":"24493","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":"A Parallel Key Sort Method Using Dragon Net","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1991-10-07","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"富士通研究所"},{"subitem_text_value":"富士通研究所"},{"subitem_text_value":"富士通研究所"},{"subitem_text_value":"富士通研究所"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Artificial Intelligence Laboratory Fujitsu Laboratories LTD.","subitem_text_language":"en"},{"subitem_text_value":"Artificial Intelligence Laboratory Fujitsu Laboratories LTD.","subitem_text_language":"en"},{"subitem_text_value":"Artificial Intelligence Laboratory Fujitsu Laboratories LTD.","subitem_text_language":"en"},{"subitem_text_value":"Artificial Intelligence Laboratory Fujitsu Laboratories LTD.","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/24493/files/IPSJ-ARC91090003.pdf"},"date":[{"dateType":"Available","dateValue":"1993-10-07"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-ARC91090003.pdf","filesize":[{"value":"992.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":"e7884df3-1e2d-49a6-bd4e-a74a32456d32","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1991 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"野口, 泰生"},{"creatorName":"赤星, 直輝"},{"creatorName":"横田, 治夫"},{"creatorName":"武, 理一郎"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yasuo, Noguchi","creatorNameLang":"en"},{"creatorName":"Naoki, Akaboshi","creatorNameLang":"en"},{"creatorName":"Haruo, Yokota","creatorNameLang":"en"},{"creatorName":"Riichirou, Take","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":"データベースにおける並列ソートでのデータ転送量を最小にする並列キーソート法を提案している。並列キーソート法は、並列キーソート、分割値のブロードキャスト、レコードの再配置の3ステージからなる。著者等の提案している全点対全点通信を最適に処理する並列計算機用結合網:　ドラゴンネットを利用すればこのソート法は特に効果的である。並列キーソート（ブロックバイトニックソート）、と分割値のブロードキャストはドラゴンネットのみを利用して実現できる。レコードの再配置における全点対全点通信はドラゴンネットで効率よく処理できる。トランスピュータによる実験により並列キーソート法の有効性を実証した。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We propose a parallel sorting method called parallel key sort, which minimize communication between processing elements. Parallel key sort works well on a parallel database machine that we have prototyped. The machine consists of processing elements and interconnection network called Dragon net, which executes all-to-all-node communication optimally. Parallel key sort consists of three stages, key sort, broadcast and record reallocation. Using Dragon net, key sort and broadcasting can be executed efficiently and all-to-all-node communication involved in record reallocation can be executed optimally. Parallel key sort exhibited better performance and scalability than that of block bitonic sort on the prototype database machine using Transputers.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"24","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告計算機アーキテクチャ（ARC）"}],"bibliographicPageStart":"17","bibliographicIssueDates":{"bibliographicIssueDate":"1991-10-07","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"86(1991-ARC-090)","bibliographicVolumeNumber":"1991"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T22:55:36.975028+00:00","id":24493,"links":{}}