Novel models for or-parallel logic programs: A performance analysis

• Type: Article in International Scientific Journal
• Date: 2000

Authors

Costa, VS (Author) FCUP; Rocha, R (Author) FCUP; Silva, F (Author) FCUP

Journal

The Journal is awaiting validation by the Administrative Services.

Title: EURO-PAR 2000 PARALLEL PROCESSING, PROCEEDINGS

Vol. 39

Pages: 744-753

Indexing

ISI Web of Knowledge - 2 Citations

Scopus - 3 Citations

Scientific classification

FOS: Natural sciences > Computer and information sciences

Other information

Authenticus ID: P-001-1EE

DOI: 10.1007/3-540-44520-X_102

Abstract (EN): One of the advantages of logic programming is the fact that it offers many sources of implicit parallelism, such as and-parallelism and or-parallelism. Arguably, or-parallel systems, such as Aurora and Muse, have been the most successful parallel logic programming systems so far. Or-parallel systems rely on techniques such as Environment Copying to address the problem that branches being explored in parallel may need to assign different bindings for the same shared variable. Recent research has led to two new binding representation approaches that also support independent and-parallelism: the Sparse Binding Array and the Copy-On-Write binding models. In this paper, we investigate whether these newer models are practical alternatives to copying for or-parallelism. We based our work on YapOr, an or-parallel copying system using the YAP Prolog engine, so that the three alternative systems share schedulers and the underlying engine.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 10