{"links":{},"id":32292,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032292","sets":["1164:2592:2672:2676"]},"path":["2676"],"owner":"10","recid":"32292","title":["ソート集合のある分割に対する並列アルゴリズムについて"],"pubdate":{"attribute_name":"公開日","attribute_value":"1996-05-29"},"_buckets":{"deposit":"eeaf8efd-abf9-45b3-b50d-25fef29e580e"},"_deposit":{"id":"32292","pid":{"type":"depid","value":"32292","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"ソート集合のある分割に対する並列アルゴリズムについて","author_link":["471569","471573","471568","471571","471566","471572","471567","471570"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"ソート集合のある分割に対する並列アルゴリズムについて"},{"subitem_title":"Parallel Algorithm for Partitioning Sorted Sets and Related Problems","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1996-05-29","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":"Department of Computer Science and Engineering University of Notre Dame","subitem_text_language":"en"},{"subitem_text_value":"Nagoya Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Nagoya Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Nagoya Institute of Technology","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/32292/files/IPSJ-AL96051005.pdf","label":"IPSJ-AL96051005"},"date":[{"dateType":"Available","dateValue":"1998-05-29"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL96051005.pdf","filesize":[{"value":"891.3 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":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"c94b0cb8-7164-48cd-bf47-4c06d4d60817","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1996 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Danny, Z.Chen"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"陳, 慰"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"和田, 幸一"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"川口, 喜三男"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Danny, Z.Chen","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Wei, Chen","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Koichi, Wada","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kimio, Kawaguchi","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","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":"本稿では次のような分割問題を考える。要素数nの集合Sがk個の列からなりそれぞれソートされたn/k個の集合として与えられているとき、パラメタh(/k〓h〓n/)に対してSを|D_i|=Θ()であり、1〓i<j〓gなる任意の添字iとjに対してD_iのどの要素もD_jのどの要素より大きくないようにg=O(/()）個の部分集合D_1，D_2，…，D_gに分割する。この分割問題はkとhをうまく設定することにより、マージ、ソートや近似の中間値などを求める問題を含んでおり、また計算幾何学の問題へも応用できる。本稿では、この分割問題を解く並列アルゴリズムを示す。この並列アルゴリズムはEREW　PRAMモデルにおいてO（(in{(/)*max{log　h，1}，n*max{log(/)，1}}）/(og　)）個のプロセッサを用いてO(og　)時間で分割問題を解く。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We consider the following partition problem: Given a set S of n elements that is organized as k sorted subsets of size n/k each and given a parameter h with 1/k〓h〓n/k, partition S into g = O(n/(hk)) subsets D_1, D_2, …, D_g of size Θ(hk) each, such that for any two indices i and j with 1〓i<j〓g, no element in D_i is bigger than any element in D_j. In this paper, we present efficient parallel algorithms for solving the partition problem and its applications. Our parallel partition algorithm runs in O(log n) time using O((min{(n/h)*max{log h,1},n*max{log(1/h),1}})/(log n)) processors in the EREW PRAM model.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"40","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"33","bibliographicIssueDates":{"bibliographicIssueDate":"1996-05-29","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"57(1996-AL-051)","bibliographicVolumeNumber":"1996"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"created":"2025-01-18T23:01:25.005462+00:00","updated":"2025-01-19T22:36:30.660382+00:00"}