# On Comparing Alternative Splitting Strategies for Or-Parallel Prolog Execution on Multicores

arXiv: https://arxiv.org/abs/1301.7690 · HTML: https://mlsanity.com/paper/1301.7690/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 31 Jan 2013.

## Built on by (most cited first, 1 of 1)

- [Parallel Logic Programming: A Sequel](https://mlsanity.com/paper/2111.11218/) (2021)

## Abstract (arXiv)

Many or-parallel Prolog models exploiting implicit parallelism have been proposed in the past. Arguably, one of the most successful models is environment copying for shared memory architectures. With the increasing availability and popularity of multicore architectures, it makes sense to recover the body of knowledge there is in this area and re-engineer prior computational models to evaluate their performance on newer architectures. In this work, we focus on the implementation of splitting strategies for or-parallel Prolog execution on multicores and, for that, we develop a framework, on top of the YapOr system, that integrates and supports five alternative splitting strategies. Our implementation shares the underlying execution environment and most of the data structures used to implement or-parallelism in YapOr. In particular, we took advantage of YapOr's infrastructure for incremental copying and scheduling support, which we used with minimal modifications. We thus argue that all these common support features allow us to make a first and fair comparison between these five alternative splitting strategies and, therefore, better understand their advantages and weaknesses.