An efficient OR-parallel processing scheme of Prolog

Hierarchical pincers attack search

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationIEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Conference Proceedings
Editors Anon
PublisherPubl by IEEE
Pages677-680
Number of pages4
ISBN (Print)0879426381
Publication statusPublished - 1991 Dec 1
Externally publishedYes
EventProceedings of the 1991 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Processing. Conference Proceedings - Victoria, BC, USA
Duration: 1991 May 91991 May 10

Publication series

NameIEEE 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

Fingerprint

Data transfer
Processing

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Kai, M., & Kasahara, H. (1991). An efficient OR-parallel processing scheme of Prolog: Hierarchical pincers attack search. In Anon (Ed.), IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Conference Proceedings (pp. 677-680). (IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Conference Proceedings). Publ by IEEE.

An efficient OR-parallel processing scheme of Prolog : Hierarchical pincers attack search. / Kai, M.; Kasahara, Hironori.

IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Conference Proceedings. ed. / Anon. Publ by IEEE, 1991. p. 677-680 (IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Conference Proceedings).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kai, M & Kasahara, H 1991, An efficient OR-parallel processing scheme of Prolog: Hierarchical pincers attack search. in Anon (ed.), IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Conference Proceedings. IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Conference Proceedings, Publ by IEEE, pp. 677-680, Proceedings of the 1991 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Processing. Conference Proceedings, Victoria, BC, USA, 91/5/9.
Kai M, Kasahara H. An efficient OR-parallel processing scheme of Prolog: Hierarchical pincers attack search. In Anon, editor, IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Conference Proceedings. Publ by IEEE. 1991. p. 677-680. (IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Conference Proceedings).
Kai, M. ; Kasahara, Hironori. / An efficient OR-parallel processing scheme of Prolog : Hierarchical pincers attack search. IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Conference Proceedings. editor / Anon. Publ by IEEE, 1991. pp. 677-680 (IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Conference Proceedings).
@inproceedings{b821b32b26ad49fc88edc9c1d4d88eec,
title = "An efficient OR-parallel processing scheme of Prolog: Hierarchical pincers attack search",
abstract = "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.",
author = "M. Kai and Hironori Kasahara",
year = "1991",
month = "12",
day = "1",
language = "English",
isbn = "0879426381",
series = "IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Conference Proceedings",
publisher = "Publ by IEEE",
pages = "677--680",
editor = "Anon",
booktitle = "IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Conference Proceedings",

}

TY - GEN

T1 - An efficient OR-parallel processing scheme of Prolog

T2 - Hierarchical pincers attack search

AU - Kai, M.

AU - Kasahara, Hironori

PY - 1991/12/1

Y1 - 1991/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0026401337&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026401337&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0879426381

T3 - IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Conference Proceedings

SP - 677

EP - 680

BT - IEEE Pacific Rim Conference on Communications, Computers and Signal Processing. Conference Proceedings

A2 - Anon, null

PB - Publ by IEEE

ER -