Relating Data–Parallelism and (And–) Parallelism in Logic Programs

Abstract. Much work has been done in the areas of and–parallelism and data–parallelism in Logic Programs. Both types of parallelism offer advantages and disadvantages: traditional (and–) parallel models offer generality, whereas data–parallelism techniques offer increased performance for a restricted class of programs. The thesis of this paper is that these two forms of parallelism are not fundamentally different and that relating them opens the possibility of obtaining the advantages of both within the same system. Some relevant issues are discussed and solutions proposed. The discussion is illustrated through visualizations of actual parallel executions implementing the ideas proposed.