Logic Programming
DOI: 10.1007/3-540-45635-x_10
|View full text |Cite
|
Sign up to set email alerts
|

PALS: An Or-Parallel Implementation of Prolog on Beowulf Architectures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
3
0
2

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 11 publications
0
3
0
2
Order By: Relevance
“…PALS [39] é um sistema publicado em 2001 que explora o paralelismo-OU em arquiteturas de memória distribuída, construído com base no ambiente de cópia presente em sistemas como Muse [1] e YapOr [30].…”
Section: Palsunclassified
See 1 more Smart Citation
“…PALS [39] é um sistema publicado em 2001 que explora o paralelismo-OU em arquiteturas de memória distribuída, construído com base no ambiente de cópia presente em sistemas como Muse [1] e YapOr [30].…”
Section: Palsunclassified
“…A maximização da exploração do paralelismo ocorre somente quando explorados ambos os tipos de paralelismo, mas apesar disso, diversos sistemas [30,1,29,39] apresentam bons resultados explorando apenas um tipo de paralelismo.…”
Section: Uma Comparaçãounclassified
“…Stack splitting (Gupta and Pontelli 1999;Pontelli et al 2006) is an alternative scheduling strategy for environment copying that provides a simple and clean method to accomplish work splitting among workers in which the available work is statically divided beforehand in complementary sets between the sharing workers. Due to its static nature, stack splitting was first introduced aiming at distributed memory architectures (Villaverde et al 2001) but, recent work, also showed good results for shared memory architectures (Vieira et al 2012).…”
Section: Introductionmentioning
confidence: 99%
“…However, practice has shown that a main difficulty is how to efficiently represent the multiple bindings for the same variable produced by the or-parallel execution of alternative matching clauses. One of the most successful or-parallel models that solves the multiple bindings problem is environment copying, which has been efficiently used in the implementation of or-parallel Prolog systems both on shared memory (Ali and Karlsson 1990;Rocha et al 1999) and distributed memory (Villaverde et al 2001;Rocha et al 2003) architectures.…”
Section: Introductionmentioning
confidence: 99%
“…Stack splitting [4,5] is an extension to the environment copying model that provides a simple, clean and efficient method to accomplish work splitting among workers. It successfully splits the computation task of one worker in two complementary sets, and was thus first introduced aiming at distributed memory architectures [6,7].…”
Section: Introductionmentioning
confidence: 99%