Name
Abstract | ||
|---|---|---|
This paper presents the implementation and performance results of an and -parallel execution model of logic programs on a shared-memory multiprocessor. The execution model is meant for logic programs with “don't-know nondeterminism”, and handles binding conflicts by dynamically detecting dependencies among literals. The model also incorporates intelligent backtracking at the clause level. Our implementation of this model is based upon the Warren Abstract Machine (WAM); hence it retains most of the efficiency of the WAM for sequential segments of logic programs. Performance results on Sequent Balance 21000 show that on suitable programs, our parallel implementation can achieve linear speedup on dozens of processors. We also present an analysis of different overheads encountered in the implementation of the execution model. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1016/0743-1066(91)80003-V | J. Log. Program. |
Keywords | Field | DocType |
shared-memory multiprocessor,and-parallel execution,logic program | Warren Abstract Machine,Programming language,Shared memory,Computer science,Parallel computing,Multiprocessing,Sequent,Execution model,Backtracking,Overhead (business),Speedup | Journal |
Volume | Issue | ISSN |
10 | 2 | The Journal of Logic Programming |
Citations | PageRank | References |
17 | 0.80 | 18 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yow-Jian Lin | 1 | 279 | 40.18 |
| Vipin Kumar | 2 | 11560 | 934.35 |