{"created":"2023-07-25T10:23:52.582204+00:00","id":1175,"links":{},"metadata":{"_buckets":{"deposit":"a8ffc7f7-3a3d-4f35-b8ec-161bfd283d65"},"_deposit":{"created_by":1,"id":"1175","owners":[1],"pid":{"revision_id":0,"type":"depid","value":"1175"},"status":"published"},"_oai":{"id":"oai:hiroshima-cu.repo.nii.ac.jp:00001175","sets":["1:189"]},"author_link":["3620","3626","3625","3623","3621","3624","3619","3622"],"item_10001_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2005-06-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"SIG_10(TOM_12)","bibliographicPageEnd":"152","bibliographicPageStart":"138","bibliographicVolumeNumber":"46","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌. 数理モデル化と応用"}]}]},"item_10001_description_19":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_10001_description_5":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"モチーフはアミノ酸配列中に存在する特徴的なパターンであり, 生物学的に意味があると考えられている.アミノ酸配列中に存在する頻出パターンからモチーフを発見することができる.アミノ酸配列中の頻出パターンを効率的に発見するために, 高速な頻出パターン抽出アルゴリズムが求められている.本論文では, PCクラスタ上でアミノ酸配列から頻出パターンを並列に抽出する並列Modified PrefixSpan法を示し, その動的負荷分散手法を提案する.並列Modified PrefixSpan法はPCクラスタ間でタスクを分配する手法であり, マスタ・ワーカ型の並列処理を用いている.Modified PrefixSpan法では, タスクの負荷に非常に大きな偏りがあり, さらにタスクの処理時間を見積もることができない.このような状況下での動的負荷分散手法として, マスタ・タスク・ステイル法を提案する.マスタ・タスク・ステイル法は, タスク粒度をできるだけ細かくし, 負荷の偏りが生じた時点でのみマスタプロセスがワーカプロセスのタスクプールからタスクを集める手法である.","subitem_description_type":"Abstract"},{"subitem_description":"A motif is the featured pattern which is biologically meaningful in the amino acid sequences. The motif is discovered from the frequent patterns. In order to extract the frequent patterns that can become motifs in the amino acid sequences efficiently, a high-speed frequent pattern extraction algorithm is required. In this paper, a parallel Modified PrefixSpan which extracts frequent patterns in parallel on an actual PC cluster is presented. Then the dynamic load balancing for the parallel Modified PrefixSpan is proposed. The parallel Modified PrefixSpan exploits a master-worker parallelism that distributes tasks among the computers on the PC cluster. In the Modified PrefixSpan, the bias of load of task is very large. Moreover, the processing time of the task cannot be estimated. A master-task-steal methodology is proposed for the dynamic load balancing technique under such situation. The master-task-steal methodology is the technique which gathers all tasks located in the worker processes' task pool only when the bias of the load arises.","subitem_description_type":"Abstract"}]},"item_10001_publisher_8":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"社団法人情報処理学会"}]},"item_10001_relation_12":{"attribute_name":"論文ID（NAID）","attribute_value_mlt":[{"subitem_relation_type":"isIdenticalTo","subitem_relation_type_id":{"subitem_relation_type_id_text":"10016425497","subitem_relation_type_select":"NAID"}}]},"item_10001_relation_17":{"attribute_name":"関連サイト","attribute_value_mlt":[{"subitem_relation_name":[{"subitem_relation_name_text":"CiNii Research"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://cir.nii.ac.jp/crid/1050001337430788992","subitem_relation_type_select":"URI"}},{"subitem_relation_name":[{"subitem_relation_name_text":"情報処理学会電子図書館"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://ipsj.ixsq.nii.ac.jp/ej/?action=pages_view_main&active_action=repository_view_main_item_detail&item_id=17209&item_no=1&page_id=13&block_id=8","subitem_relation_type_select":"URI"}},{"subitem_relation_name":[{"subitem_relation_name_text":"情報処理学会"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"http://www.ipsj.or.jp/","subitem_relation_type_select":"URI"}}]},"item_10001_rights_15":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"本著作物の著作権は（社）情報処理学会に帰属します。本著作物は著作権者である情報処理学会の許可のもとに掲載するものです。ご利用に当たっては「著作権法」ならびに「情報処理学会倫理綱領」に従うことをお願いいたします。 "},{"subitem_rights":"The copyright of this material is retained by the Information Processing Society of Japan (IPSJ). This material is published on this web site with the agreement of the author (s) and the IPSJ. Please be complied with Copyright Law of Japan and the Code of Ethics of the IPSJ if any users wish to reproduce, make derivative work, distribute or make available to the public any part or whole thereof. All Rights Reserved, Copyright (C) Information Processing Society of Japan."},{"subitem_rights":"本文データは学協会の許諾に基づきCiNiiから複製したものである。"}]},"item_10001_source_id_11":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464803","subitem_source_identifier_type":"NCID"}]},"item_10001_source_id_9":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"0387-5806","subitem_source_identifier_type":"ISSN"}]},"item_10001_version_type_20":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"高木, 允"},{"creatorName":"タカキ, マコト","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"田村, 慶一"},{"creatorName":"タムラ, ケイイチ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"周藤, 俊秀"},{"creatorName":"ストウ, トシヒデ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"北上, 始"},{"creatorName":"キタカミ, ハジメ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"TAKAKI, Makoto","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"TAMURA, Keiichi","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"SUTOU, Toshihide","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"KITAKAMI, Hajime","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2023-02-28"}],"displaytype":"detail","filename":"10016425497.pdf","filesize":[{"value":"1.4 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"10016425497.pdf","url":"https://hiroshima-cu.repo.nii.ac.jp/record/1175/files/10016425497.pdf"},"version_id":"3b30c822-08f5-45c2-bfd0-d854482b38c7"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Modified PrefixSpan法の並列化と動的負荷分散手法","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Modified PrefixSpan法の並列化と動的負荷分散手法"},{"subitem_title":"Parallelization and Dynamic Load Balancing for Modified PrefixSpan","subitem_title_language":"en"}]},"item_type_id":"10001","owner":"1","path":["189"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-02-28"},"publish_date":"2023-02-28","publish_status":"0","recid":"1175","relation_version_is_last":true,"title":["Modified PrefixSpan法の並列化と動的負荷分散手法"],"weko_creator_id":"1","weko_shared_id":1},"updated":"2023-07-25T10:36:21.234380+00:00"}