An efficient OR-parallel processing scheme of Prolog: Hierarchical pincers attack search

M. Kai, H. Kasahara

研究成果: Conference contribution

抄録

The authors describe a Prolog OR-parallel processing scheme. An OR-tree representing an execution process of a Prolog program, is searched from the right and left sides of each subtree in the whole tree by a plurality of processors. Each processor performs the depth-first search independently. The search allows coarse task granularity to be obtained, and reduces the frequency of the task assignment or the data transfers among the processors. Introducing a special pointer (selection pointer) which indicates a position of the processors in the OR-tree minimizes the data transfer caused by each task assignment. The depth-first searches from both sides of subtrees extract the acceleration anomaly efficiently and reduce parallel processing time in some cases. The effectiveness of the scheme is demonstrated on a multiprocessor minisupercomputer Alliant FX/80.

本文言語English
ホスト出版物のタイトルIEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Conference Proceedings
編集者 Anon
出版社Publ by IEEE
ページ677-680
ページ数4
ISBN(印刷版)0879426381
出版ステータスPublished - 1991 12 1
外部発表はい
イベントProceedings of the 1991 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Processing. Conference Proceedings - Victoria, BC, USA
継続期間: 1991 5 91991 5 10

出版物シリーズ

名前IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Conference Proceedings

Other

OtherProceedings of the 1991 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Processing. Conference Proceedings
CityVictoria, BC, USA
Period91/5/991/5/10

ASJC Scopus subject areas

  • Signal Processing
  • Computer Networks and Communications

フィンガープリント 「An efficient OR-parallel processing scheme of Prolog: Hierarchical pincers attack search」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル