Parallel bounded quantification—preliminary results-Reference-Cited by-同舟云学术

Parallel bounded quantification—preliminary results

Published:1993-08 Issue:8 Volume:28 Page:117-124
ISSN:0362-1340
Container-title:ACM SIGPLAN Notices
language:en
Short-container-title:SIGPLAN Not.

Author:

Arro Henrik,Barklund Jonas,Bevemyr Johan

Abstract

We have extended D. H. D. Warren's abstract machine for sequential Prolog with parallel instructions that implement bounded quantifications, an extension to Prolog proposed by Barklund and Bevemyr. These instructions are intended for parallel computers supporting the data parallel programming model. Luther, an emulator for the sequential abstract machine implemented in the C programming language, has been extended with these instructions, implemented in the data parallel C* programming language.We have coded three example programs that use bounded quantifications, and run them in the emulator on a Connection Machine model 200, a SIMD parallel computer. We compare the run times on this parallel computer with the run times obtained with a sequential implementation of bounded quantifications on a SUN-4M sequential computer.The best result is that one parallel bounded quantification program runs 30 times faster on the Connection Machine than an ordinary recursive program implementing the same algorithm running on the sequential computer. It is conceivable that one can obtain far higher speed-ups when running on larger data parallel computers using bounded quantifications.

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Graphics and Computer-Aided Design,Software

Link

https://dl.acm.org/doi/pdf/10.1145/163114.163129

Reference10 articles.

1. Blelloch G. E. 1990 Vector Models for Data-Parallel Computing MIT Press Cambridge Mass. Blelloch G. E. 1990 Vector Models for Data-Parallel Computing MIT Press Cambridge Mass.

2. Hill P. M. and Lloyd J. W. 1991 The Gödel Report Tech. Rep. 91-02 Computer Science Dept. Univ. of Bristol. Hill P. M. and Lloyd J. W. 1991 The Gödel Report Tech. Rep. 91-02 Computer Science Dept. Univ. of Bristol.

3. Hillis W. D. 1985 The Connection Machine MIT Press Cambridge Mass. Hillis W. D. 1985 The Connection Machine MIT Press Cambridge Mass.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Resolution for logic programming with universal quantifiers;Lecture Notes in Computer Science;1997

2. Relating data-parallelism and (and-) parallelism in logic programs;Computer Languages;1996-07

3. Relating data-parallelism and (and-) parallelism in logic programs;Lecture Notes in Computer Science;1995

4. Bounded quantifications for iteration and concurrency in logic programming;New Generation Computing;1994-03

5. Executing bounded quantifications on shared memory multiprocessors;Lecture Notes in Computer Science;1993