OR-parallel execution of Prolog on a multi-sequential machine

Journal Article · Sun Jun 01 04:00:00 EDT 1986 · Int. J. Parallel Program.; (United States)

DOI:https://doi.org/10.1007/BF01414554· OSTI ID:5271691

Ali, K A.M.

Based on extending the sequential execution model of Prolog to include parallel execution, they present a method for OR-parallel execution of Prolog on a multiprocessor system. The method reduces the overhead incurred by parallel processing. It allows many processing elements (PEs) to process simultaneously a common branch of a search tree, and each of these PEs creates its local environment and selects a subtree for processing without communication. The run-time overhead is small: simple and efficient operations for selecting the proper subtree. Communication is necessary only when some PEs have exhausted their search spaces and there are others still searching for solutions. The method is able to utilize most of the technology devised for sequential implementation of Prolog. It is optimized for an architecture that supports broadcast copying.

• Research Organization: SICS, Spanga (Sweden)
• OSTI ID: 5271691
• Journal Information: Int. J. Parallel Program.; (United States), Journal Name: Int. J. Parallel Program.; (United States) Vol. 15:3; ISSN IJPPE
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
ALGORITHMS
ARRAY PROCESSORS
COMMUNICATIONS
COMPUTER ARCHITECTURE
COMPUTER CODES
COMPUTER NETWORKS
DATA PROCESSING
DATA TRANSMISSION
DISTRIBUTED DATA PROCESSING
EXECUTIVE CODES
IMPLEMENTATION
MATHEMATICAL LOGIC
OPTIMIZATION
PARALLEL PROCESSING
PROCESSING
PROGRAMMING
PROGRAMMING LANGUAGES
PROLOG
TASK SCHEDULING