Flexible scheduling of or-parallelism in Aurora: The Bristol scheduler

Beaumont, Anthony; Raman, S. Muthu; Szeredi, Péter; Warren, David H.

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

Cited by 23 publications

(12 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…More on the Aurora system, and a detailed discussion of its performance results, can be found in [Calderwood and Szeredi 1989;Szeredi 1989;Beaumont et al 1991;Beaumont and Warren 1993;Sindaha 1992]. The Binding Array model has also been adapted for distributed shared memory architectures and implemented in the Dorpp system [Silva and Watson 2000].…”

Section: 51mentioning

confidence: 99%

Parallel execution of prolog programs

Gupta

Pontelli

Ali

et al. 2001

ACM Trans. Program. Lang. Syst.

116

View full text Add to dashboard Cite

Since the early days of logic programming, researchers in the field realized the potential for exploitation of parallelism present in the execution of logic programs. Their high-level nature, the presence of non-determinism, and their referential transparency, among other characteristics, make logic programs interesting candidates for obtaining speedups through parallel execution. At the same time, the fact that the typical applications of logic programming frequently involve irregular computations, make heavy use of dynamic data structures with logical variables, and involve search and speculation, makes the techniques used in the corresponding parallelizing compilers and run-time systems potentially interesting even outside the field. The objective of this paper is to provide a comprehensive survey of the issues arising in parallel execution of logic programming languages along with the most relevant approaches explored to date in the field. Focus is mostly given to the challenges emerging from the parallel execution of Prolog programs. The paper describes the major techniques used for shared memory implementation of Or-parallelism, Andparallelism, and combinations of the two. We also explore some related issues, such as memory management, compile-time analysis, and execution visualization.

show abstract

Section: 51mentioning

confidence: 99%

Parallel execution of prolog programs

Gupta

Pontelli

Ali

et al. 2001

ACM Trans. Program. Lang. Syst.

116

View full text Add to dashboard Cite

show abstract

“…Este escalonador não foi projetado para realizar trabalho especulativo eficientemente, assim não é bem encaixado no paralelismo-OU e em casos ocasionados por efeitos colaterais. O escalonador Bristol [5] tenta minimizar o overhead de sincronização estendendo a região global do escalonador, criando várias instâncias para cada nó e é flexível para adaptar algoritmos de compartilhamento de tarefas. O escalonador foi baseado no ambiente de có-pia implementado no sistema Muse [1], e foi aprimorado para o escalonamento eficiente de trabalho especulativo no paralelismo-OU, direcionado para o sistema Aurora [29].…”

Section: Escalonamentounclassified

“…A grande contribuição do sistema Muse foi o desenvolvimento do ambiente de cópia incremental, desenvolvido para minimizar o overhead de sincronização, fazendo com que cada instância dentro da mesma ramificação de busca possua uma parte consistente de dados e outra com modificações locais, e a sincronização dos dados é feita copiando apenas a diferença entre o local e global. Tal ambiente foi base para o escalonador Bristol [5] e para outro sistema que explora o paralelismo-OU em PROLOG, o YapOr [30].…”

Section: Museunclassified

See 1 more Smart Citation

Paralelismo em Prolog: Conceitos e Sistemas

Filho

Silva²

2016

RITA

View full text Add to dashboard Cite

Resumo: Paralelismo é uma área de estudo que cresce a cada dia, devido à redução do custo e popularização de máquinas com arquiteturas paralelas. Nesse contexto, as linguagens lógicas, sobretudo o PROLOG, apresenta uma alternativa viável e prá-tica de paralelismo. A exploração desse paralelismo pode ser realizada de diferentes formas, e há inúmeros desafios nessa tarefa. Este tutorial visa apresentar os principais conceitos de paralelismo em PROLOG, os desafios enfrentados quando se busca a paralelização nessa linguagem e o estado-da-arte do desenvolvimento de sistemas que dão suporte à paralelização em linguagens lógicas. São apresentados sistemas baseados em paralelismo implícito implementados em diferentes plataformas. Ao final é realizada uma comparação entre os sistemas apresentados e os modelos neles implementados.Palavras-chave: prolog, paralelismo, paralelismo-E, paralelismo-OU, parale- lismo implícitoAbstract: Parallelism is a study area that grows up each day, caused by the cost reduction and popularizing of machines with parallels architecture. In this context, the logical languages, especially PROLOG, show a feasible and practical alternative of parallelism. This exploitation can be accomplished of different ways, and are there several challenges on this task. This survey aims to show the main concepts of parallelism in PROLOG, the faced challenges when aims to do parallelism in this language and the state-of-art of systems development to give parallelism support in logical languages. Systems with basis on implicit parallelism developed in different platforms are presented. At the end, is accomplished a comparison between the presented systems and the implemented models by they.

show abstract

“…This fundamental property leads to the specification of a new load-balancer, based on tasks complexity, and dedicated to computer algebra. This approach is different from the ones which do not take into account the cost of tasks to be distributed [1,6,10].…”

Section: Introductionmentioning

confidence: 99%

Cost prediction for load-balancing: Application to algebraic computations

Roch¹,

Vermeerbergen²,

Villard³

1992

Parallel Processing: CONPAR 92—VAPP V

View full text Add to dashboard Cite

A major feature of Computer Algebra, and more generally of non-numerical computations, is the dynamical and non-predictable behaviour of the executions. We then understand that statical analysis should imperatively be completed by dynamical analysis in order to reach the best distribution of the tasks among the processors. In this paper, we present a new load-balancing system for parallel architectures with great numbers of processors. Being well suited for Computer Algebra and based on the notion of granularity, it is original in the sense that it takes into account the tasks complexity as a consistent information in order to achieve efficiency.

show abstract

Flexible scheduling of or-parallelism in Aurora: The Bristol scheduler

Cited by 23 publications

References 2 publications

Parallel execution of prolog programs

Parallel execution of prolog programs

Paralelismo em Prolog: Conceitos e Sistemas

Cost prediction for load-balancing: Application to algebraic computations

Contact Info

Product

Resources

About