{"updated":"2025-01-22T07:58:07.133417+00:00","links":{},"id":49659,"created":"2025-01-18T23:14:37.259579+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00049659","sets":["1164:4179:4313:4315"]},"path":["4315"],"owner":"1","recid":"49659","title":["トーラス型マルチプロセッサシステム上でのProlog並列処理手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"1989-06-29"},"_buckets":{"deposit":"609e01cf-8f5a-42bf-9868-14b08cf3d182"},"_deposit":{"id":"49659","pid":{"type":"depid","value":"49659","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"トーラス型マルチプロセッサシステム上でのProlog並列処理手法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"トーラス型マルチプロセッサシステム上でのProlog並列処理手法"},{"subitem_title":"Parallel Processing of Prolog on a Torus Machine","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1989-06-29","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":"University of the Ryukyus","subitem_text_language":"en"},{"subitem_text_value":"University of the Ryukyus","subitem_text_language":"en"},{"subitem_text_value":"University of the Ryukyus","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/49659/files/IPSJ-NL89073017.pdf"},"date":[{"dateType":"Available","dateValue":"1991-06-29"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-NL89073017.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":"23"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"b1928188-8809-452c-8fd1-fbc21228688e","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1989 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":"Tamotsu, Maeda","creatorNameLang":"en"},{"creatorName":"Tsuyoshi, Kawaguchi","creatorNameLang":"en"},{"creatorName":"Seiki, Kyan","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10115061","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":"トーラス型マルチプロセッサシステム上でのProlog並列処理手法を提案する。提案する手法では、すべてのPEが並列に木の探索を実行する。負荷分散のためにPE間でノードの受け渡しを行なうことが必要になるが、本手法では、ノードのユニフィケーションに必要なすべての情報を通信するのではなく、探索木におけるノードの深さと左から数えて何番目かという情報のみを通信する。また、このような通信のみによってプロセッサ間の負荷分散がはかられるように次のような負荷分散手法が用いられる。各PEは、まずホスト（計算機）からの指示によって次に解くノードを決定し、単独に一個のノードが与えられた時点から、自分自身の判断（深さ優先探索）または隣接PEからの指示によって次に解くノードを決定する。全解探索の8クィーン問題のように、プログラム実行過程で生じるノード数が多い問題に対しては、PE数に近い加速指数が得られることが、シミュレーション結果から確かめられる。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Torus is one of the most promising interconnection topology for multiprocessor systems with a large number of processors. This paper presents a parallel execution scheme of Prolog programs on a torus machine. In the scheme, the node data used in communications is distinguished from that used in unification operations. The former consists of only two bytes. Moreover the scheme uses two types of procedures for load-balacing among processors. One of them is performed by global communication of the host with processors, and the other is executed using local communication between adjacent processors. Simulation experiments show that the speedup rate close to the number of processors can be achieved by the proposed scheme if the number of nodes in the search tree is sufficiently large as compared with the number of processors.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"138","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告自然言語処理（NL）"}],"bibliographicPageStart":"131","bibliographicIssueDates":{"bibliographicIssueDate":"1989-06-29","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"54(1989-NL-073)","bibliographicVolumeNumber":"1989"}]},"relation_version_is_last":true,"weko_creator_id":"1"}}