We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Data structures for order-sensitive predicates in parallel nondeterministic systems.
- Authors
Ranjan, Desh; Pontelli, Enrico; Gupta, Gopal
- Abstract
Abstract. We study the problem of guaranteeing correct execution semantics in parallel implementations of logic programming languages in presence of built-in constructs that are sensitive to order of execution. The declarative semantics of logic programming languages permit execution of various goals in any arbitrary order (including in parallel). However, goals corresponding to extra-logical built-in constructs should respect the sequential order of execution to ensure correct semantics. Ensuring this correctness in presence of such built-in constructs, while efficiently exploiting maximum parallelism, is a difficult problem. In this paper, we propose a formalization of this problem in terms of operations on dynamic trees. This abstraction enables us to: (i) show that existing schemes to handle order-sensitive computations used in current parallel systems are sub-optimal; (ii) develop a novel, optimal scheme to handle order-sensitive goals that requires only a constant time overhead per operation. While we present our results in the context of logic programming, they will apply equally well to most parallel non-deterministic systems.
- Subjects
LOGIC programming languages; COMPUTER science
- Publication
Acta Informatica, 2000, Vol 37, Issue 1, p21
- ISSN
0001-5903
- Publication type
Article
- DOI
10.1007/PL00013301