The connection machine
Execution models of Prolog for parallel computers
Execution models of Prolog for parallel computers
Vector models for data-parallel computing
Vector models for data-parallel computing
Prolog with Arrays and Bounded Quantifications
LPAR '93 Proceedings of the 4th International Conference on Logic Programming and Automated Reasoning
Relating data-parallelism and (and-) parallelism in logic programs
Computer Languages
| Hi-index | 0.00 |
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.