{"id":10918,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00010918","sets":["581:638:647"]},"path":["647"],"owner":"11","recid":"10918","title":["並列トポロジカル整列アルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"2004-04-15"},"_buckets":{"deposit":"b5f475a3-0aa0-4f0d-a7f7-24a7ace07041"},"_deposit":{"id":"10918","pid":{"type":"depid","value":"10918","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"並列トポロジカル整列アルゴリズム","author_link":["362209","362208","362211","362206","362210","362207"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"並列トポロジカル整列アルゴリズム"},{"subitem_title":"Parallel Topological Sorting Algorithm","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"論文（論文賞受賞）","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2004-04-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"崇城大学"},{"subitem_text_value":"熊本大学"},{"subitem_text_value":"熊本大学"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Sojo University","subitem_text_language":"en"},{"subitem_text_value":"Kumamoto University","subitem_text_language":"en"},{"subitem_text_value":"Kumamoto University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/10918/files/IPSJ-JNL4504004.pdf","label":"IPSJ-JNL4504004"},"date":[{"dateType":"Available","dateValue":"2006-04-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL4504004.pdf","filesize":[{"value":"303.4 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":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"36a8632f-be82-4c4c-bb63-71f6a2343126","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2004 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"多田, 昭雄"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"右田, 雅裕"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"中村, 良三"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Akio, Tada","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Masahiro, Migita","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Ryozo, Nakamura","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"無閉路有向グラフDAG （Directed Acyclic Graph ）において節点数n ，辺数m とするとき，節点のトポロジカル整列を求める従来の並列アルゴリズムは，CRCW-PRAM 計算機モデルでO \u0001 n 3個のプロセッサを用いて，O (log n 時間で実行するアルゴリズムがある．このアルゴリズムは推移的閉包行列の計算に依存しているので，O \u0001 n 3\u0002 個のプロセッサを減少させることは難しい．本稿では，CREW-PRAM 計算機モデルのもとで，DAG 上における効率良い並列トポロジカル整列アルゴリズムを提案する．提案する並列アルゴリズムは分割統治法によるアルゴリズムの設計法をもとに，基本的な並列アルゴリズムのみを用いて設計される．具体的には，はじめにDAG を入出次数がたかだか1 の節点からなる線形リストに分割し，次に再帰的に線形リストを併合しながら各節点の最大ランク値を求める．最後に，最大ランク値をもとに節点のトポロジカル整列を行う並列アルゴリズムである．この提案するアルゴリズムの計算量はCREW-PRAM 計算機モデルでプロセッサ数がO (n +m ，計算時間がO log 2 m である．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The traditional parallel topological sorting algorithm in a DAG (Directed Acyclic Graph) with the number of vertices n and the number of edges m is the one that takes O (log n time using O \u0001 n 3\u0002 processors on a CRCW-PRAM model.However this algorithm depends on the transitive closure matrix calculation,therefore it is difficult to reduce the number of processors furthermore.In this paper,we propose an efficient parallel topological sorting algorithm in a given DAG,based on a CREW-PRAM model.Namely,based on the divide-conquer method, the proposed algorithm at first divides a given DAG into several linked lists,in which each vertex has at most 1 both input and output edge degree.Next in the merging step,it merges recursively two combined linked lists to get a maximum rank of each vertex.Finally the maximum rank of each vertex is found,then all vertices of a given DAG are ordered so that all directed edges go from left to right,namely,a topological sorting is given.The proposed algorithm requires O (n +m processors and O log 2 m time on a CREW-PRAM model.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1111","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"1102","bibliographicIssueDates":{"bibliographicIssueDate":"2004-04-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"4","bibliographicVolumeNumber":"45"}]},"relation_version_is_last":true,"item_2_alternative_title_2":{"attribute_name":"その他タイトル","attribute_value_mlt":[{"subitem_alternative_title":"計算科学と数値シュミレーションの理論と実践"}]},"weko_creator_id":"11"},"updated":"2025-01-20T06:29:38.738013+00:00","created":"2025-01-18T22:45:41.734326+00:00","links":{}}