Towards a Parallel Search for Solutions of Non-deterministic Computations

: In this paper we explore the possibilities to perform the search for results of non-deterministic computations in parallel. We present three different approaches to this problem: Dividing the search space statically, using a Bag of Tasks approach and using semi-explicit parallelism. Then we discuss their advantages and limitations. Finally, we discuss benchmarks using a monadic SAT solver as an example of a nontrivial application of a non-deterministic program.

• Type: Journal
• Year: 2009
• Where: GI
• Authors: Fabian Reck, Sebastian Fischer
• Keywords: GI 2009, Monadic Sat, Non-deterministic Computations, Non-deterministic Program, Theoretical Computer Science