By Topic

Load balancing strategies for parallel forward search algorithm with conflict based backjumping

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

4 Author(s)
Habbas, Z. ; Lab. de Recherche en Inf. de Metz, France ; Herrmann, F. ; Merel, P.-P. ; Singer, D.

Constraints satisfaction problems (CSP) is a well studied example of the NP-complete family which is usually solved by backtracking search algorithms. Performance comparisons of different algorithms led us to consider FC or FC-CBJ as one of the best sequential algorithms to solve a great family of CSP's. In this paper we give an explicit formulation for a generic parallel search algorithm based on typical parallel behaviors, such as load balancing policy. From this paradigm, we exhibit parallel FC-CBJ. The experimental study is up to now restricted to the performance of this within the scope of phase transition phenomenon for randomly generated binary CSPs and more particularly in the mushy region where the hardest problems are encountered. We discuss the performances of our algorithm relatively to a server initiated load balancing strategy with four techniques of tree-search splitting and four partner selection policies

Published in:

Parallel and Distributed Systems, 1997. Proceedings., 1997 International Conference on

Date of Conference:

10-13 Dec 1997