Loading...
Please wait, while we are loading the content...
Similar Documents
Shared Paged Binding Array: A Universal Datastructure for Parallel Logic Programming (1994)
| Content Provider | CiteSeerX |
|---|---|
| Author | Pontelli, Enrico Costa, Vítor Santos Gupta, Gopal |
| Abstract | Two major problems that arise in parallel logic programming systems are: (i) redundant computation during and-parallel execution of dependent goals, and, (ii) efficient representation of multiple environments at runtime. Both these problems are caused by nondeterminism present in logic programs---responsible for much of the power of logic programming. This paper is mainly concerned with solving the second problem, namely, the efficient representation of multiple environments at runtime in parallel logic programming systems. We present a datastructure called the Shared Paged Binding Array that arguably is most suited for implementing any arbitrary parallel logic programming system (i.e., a system that exploits any arbitrary combination of dependent-and parallelism, independent and-parallelism and or-parallelism). This datastructure can also be used for and-or parallel execution of Committed Choice Languages with Deep Guards as well as for realizing the implementations of more advanced m... |
| File Format | |
| Publisher Date | 1994-01-01 |
| Publisher Institution | University of Oregon UNIVERSITY OF OREGON |
| Access Restriction | Open |
| Subject Keyword | Arbitrary Parallel Logic Independent And-parallelism Parallel Logic Programming Dependent Goal Multiple Environment Efficient Representation And-or Parallel Execution Arbitrary Combination Logic Programming Binding Array Dependent-and Parallelism Committed Choice Language Shared Paged Binding Array Universal Datastructure Redundant Computation And-parallel Execution Logic Program Second Problem Nondeterminism Present Deep Guard Major Problem |
| Content Type | Text |
| Resource Type | Article |
