By Topic

Distributing AND-work and OR-work in parallel logic programming systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
I. D. C. Dutra ; COPPE/Sistemas, Federal Univ. of Rio de Janeiro

In parallel logic programming systems that exploit both AND-parallelism and OR-parallelism, the problem arises of how to distribute processors between the dynamically varying amounts of AND-work and OR-work that are available. Solutions have been reported for distributing 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 paper, 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 benchmarks

Published in:

System Sciences, 1996., Proceedings of the Twenty-Ninth Hawaii International Conference on ,  (Volume:1 )

Date of Conference:

3-6 Jan 1996