Distributing And-Work and Or-Work in Parallel Logic Programming Systems

Abstract or-work. This is a new and hard problem to be solved In parallel logic programming systems that exploit both and-parallelism and or-parallelism, a problem arises that is how to distribute processors between the dynamically varying amounts of and-work and or-work that are available. Solutions have been reported for dis-tributing only or-work, or distributing only and-work, but the issue of distributing processors between both kinds of work has not yet been addressed. In this work we discuss the problem of distributing and-work and or-work in the context of Andorra-I, a parallel logic programming system that exploits determinate and-parallelism and or-parallelism. We describe dynamic scheduling strategies that aim at efficiently distributing processors between and-work and or-work, and compare their performance with the performance produced by a static scheduling strategy, for a wide range of bench-marks