Global compilation of prolog

Hickey, Timothy J.; Mudambi, Shyam

doi:10.1016/0743-1066(89)90021-6

Cited by 26 publications

(7 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The original WAM supplies some instructions ("switch" instructions) to analyze the functor of the first argument and select different clusters of clauses depending on its value. Since many programs cannot profit from first-argument selection, more powerful indexing techniques have been proposed, taking into account more arguments and generating more complex decision trees [Hickey and Mudambi 1989;Van Roy and Despain 1992;Taylor 1991;Ramesh et al 1990]. …”

mentioning

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

mentioning

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

“…Hickey e Mudambi [39] apresentaram um algoritmo para gerar uma árvore de testes de modo a minimizar o overhead do retrocesso. No pior caso, o tamanho da árvore tem uma proporção quadrática ao tamanho do código.…”

Section: Otimizar Seleção De Cláusulasunclassified

Prolog: A Linguagem, A Máquina Abstrata de Warren e Implementações

Oliveira

Silva

2013

RITA

View full text Add to dashboard Cite

Resumo: A principal motivação para o uso de programação em lógica é permitir que os programadores descrevam o que eles querem separadamente de como alcançar este objetivo. Neste contexto PROLOG é a linguagem de programação em lógica mais popular, tendo a máquina abstrata de Warren como o seu modelo de execução padrão. A escolha desta máquina como modelo de execução ocorreu devido ao fato desta oferecer várias vantagens, tais como fácil compilação, portabilidade e código compacto. Este tutorial tem por objetivo descrever as características principais da linguagem PROLOG, do seu modelo de execução e apresentar os principais sistemas PROLOG.

show abstract

“…Furthermore, global dataflow analyses used in the compilation of traditional Prologs, such as mode analysis, are not correct with dynamic scheduling. This means that compilers for languages with dynamic scheduling are currently unable to perform optimizations which improve execution speed of traditional Prologs by an order of magnitude [19,21,31,32,33]. However, it is not simple to extend analyses for traditional Prologs to languages with dynamic scheduling, as in existing analyses the fixed scheduling is crucial to ensure correctness and termination.…”

Section: Introductionmentioning

confidence: 99%

Analyzing logic programs with dynamic scheduling

Marriott

Banda

Hermenegildo

1994

Proceedings of the 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL '94

View full text Add to dashboard Cite

Traditional logic programming languages, such as Prolog, use a fixed left-to-right atom scheduling rule. Recent logic programming languages, however, usually provide more flexible scheduling in which computation generally proceeds leftto-right but in which some calis are dynamically "delayed" until their arguments are sufRciently instantiated to allow the cali to run efficiently. Such dynamic scheduling has a significant cost. We give a framework for the global analysis of logic programming languages with dynamic scheduling and show that program analysis based on this framework supports optimizations which remove much of the overhead of dynamic scheduling.

show abstract

Global compilation of prolog

Cited by 26 publications

References 1 publication

Parallel execution of prolog programs

Parallel execution of prolog programs

Prolog: A Linguagem, A Máquina Abstrata de Warren e Implementações

Analyzing logic programs with dynamic scheduling

Contact Info

Product

Resources

About