Parallel execution of prolog programs: a survey

  • Authors:

  • Gopal Gupta;Enrico Pontelli;Khayri A.M. Ali;Mats Carlsson;Manuel V. Hermenegildo

  • Affiliations:

  • University of Texas at Dallas, Richardson, TX;New Mexico State University, Las Cruces, NM;Swedish Institute of Computer Science, Kista, Sweden;Swedish Institute of Computer Science, Kista, Sweden;Technical University of Madrid (UPM), Madrid, Spain

  • Venue:
  • ACM Transactions on Programming Languages and Systems (TOPLAS)
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 nondeterminism, 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 article 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 article describes the major techniques used for shared memory implementation of Or-parallelism, And-parallelism, and combinations of the two. We also explore some related issues, such as memory management, compile-time analysis, and execution visualization.