Abstract
An extended AND-OR tree for efficiently supporting both AND-parallelism and OR-parallelism on shared-memory multiprocessors is presented. The approach is based on the binding-arrays method for OR-parallelism and the restricted AND-parallelism method for AND-parallelism. The combined AND-OR model avoids redundant computations when goals exhibit both AND- and OR-parallelism by representing the cross-product of the solutions from the AND-OR-parallel goals rather than recomputing it.
| Original language | English |
|---|---|
| Pages (from-to) | 260-263 |
| Number of pages | 4 |
| Journal | Proceedings of the International Conference on Parallel Processing |
| Volume | 2 |
| State | Published - 1989 |
| Event | Proceedings of the 1989 International Conference on Parallel Processing - University Park, PA, USA Duration: Aug 8 1989 → Aug 12 1989 |
Fingerprint
Dive into the research topics of 'Model for combined and-or parallel execution of logic programs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver