Li, Peggy Pey-yun and Martin, Alain J. (1986) The Sync Model: A Parallel Execution Method for Logic Programming. California Institute of Technology . (Unpublished) https://resolver.caltech.edu/CaltechCSTR:1986.5221-tr-86
![]()
|
Other (Adobe PDF (2.5MB))
See Usage Policy. 2MB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechCSTR:1986.5221-tr-86
Abstract
The Sync Model, a parallel execution method for logic programming, is proposed. The Sync Model is a multiple-solution data-driven model that realizes AND parallelism and OR-parallelism in a logic program assuming a message-passing multiprocessor system. AND parallelism is implemented by constructing a dynamic data flow graph of the literals in the clause body with an ordering algorithm. OR parallelism is achieved by adding special Synchronization signals to the stream partial solutions and synchronizing the multiple streams with a merge algorithr The ordering algorithm and the merge algorithm are described. The merge algrithm is proved to be correct and therefore, the Sync Model is proved complete, i.e the execution of a logic program under the Sync Model generates all the solution
Item Type: | Report or Paper (Technical Report) |
---|---|
Group: | Computer Science Technical Reports |
Record Number: | CaltechCSTR:1986.5221-tr-86 |
Persistent URL: | https://resolver.caltech.edu/CaltechCSTR:1986.5221-tr-86 |
Usage Policy: | You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format. |
ID Code: | 26912 |
Collection: | CaltechCSTR |
Deposited By: | Imported from CaltechCSTR |
Deposited On: | 03 Dec 2001 |
Last Modified: | 03 Oct 2019 03:19 |
Repository Staff Only: item control page