Scheduling of OR-parallel Prolog on a scalable, reconfigurable, distributed-memory multiprocessor

Briat, Jacques; Favre, M.; Geyer, Cláudio F. R.; Kergommeaux, Jacques Chassin de

doi:10.1007/3-540-54152-7_76

Cited by 4 publications

(1 citation statement)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are a.lso severa.! or-scheduling techniques (12,2,19] implemented in systems that exploit only or-parallelism such as the Aurora [15], Muse [1], Delphl [5], and Opera (3] systems. So far, only t he problem of and-scheduling a.lone a.nd or-scheduling a.lone have been tackled by the parallel logic programming resea.rchers.…”

Section: Introductionmentioning

confidence: 99%

Performance Analysis of a Strategy to Distribute And-work and Or-work in Parallel Logic Programming Systems

Dutra

1995

Anais Do VII Simpósio De Arquitetura De Computadores E Processamento De Alto Desempenho (SBAC-PAD 1995)

View full text Add to dashboard Cite

This paper studies the performance of Andorra-I, a parallel logic programming system that exploits and-parallelism and or-parallelism with a novel strategy to distribute and-work and or-work among processors. The strategy, work-guided guides it’s decisions by looking at the amount of current and-work and or-work avaliable in an application during execution. The scheduler decision strategy moves workers from one parallel task to another according to the tasks sizes. Results show that the work-guided strategy works quite well and produces better results than the ones produced with a version of Andorra-I that does not a flow dynamic migration of workers during execution. We believe that this strategy can be applied to other parallel logic programming systems that aim to exploit both and-and or-parallelism in a single framework.

show abstract