The SBA: Exploiting orthogonality in AND-OR parallel systems

• Type: Article in International Conference Proceedings Book
• Date: 1997

Authors

Correia, ME (Author) FCUP; Silva, F (Author) FCUP; Costa, VS (Author) FCUP

Conference proceedings International

Title: LOGIC PROGRAMMING

Pages: 117-131

1997 International Logic Programming Symposium (ILPS 97)

PORT WASHINGTON, NY, OCT 13-16, 1997

Indexing

ISI Web of Knowledge - 3 Citations

Scientific classification

FOS: Natural sciences > Computer and information sciences

Other information

Authenticus ID: P-001-CR6

Abstract (EN): One of the advantages of logic programming in the fact that it offers many sources of implicit parallelism, such as and-parallelism and or-parallelism Recently, research has been concentrated on integrating the different forms of parallelism into a single combined system. In this work we concentrate on the problem of integrating or-parallelism and independent and-parallelism for parallel Prolog systems. We contend that previous data structures require pure recomputation and therefore do not allow for orthogonality between and parallelism and or-parallelism. In contrast, we submit that a simpler solution, the sparse binding array, does guarantee this goal, and explain in detail how independent and-parallelism and or-parallelism can thus be efficiently combined.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 15