Parallelizing Satz Using Dynamic Workload Balancing

We presents the parallelization of Satz using work stealing for workload balancing, based on the master/slave communication model. We define a simple way to evaluate the workload of every busy slave. The master then steals the first remaining subtree of the most loaded slave for an idle slave. Speci...

Full description

Saved in:

Bibliographic Details
Published in:	Electronic notes in discrete mathematics Vol. 9; pp. 174 - 189
Main Authors:	Jurkowiak, Bernard, Li, Chu Min, Utard, Gil
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 2001
Subjects:	Parallel Search Algorithms Parallelization of DPLL procedure SAT SAT Parallel Search Algorithms Parallelization of DPLL procedure
ISSN:	1571-0653, 1571-0653
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	We presents the parallelization of Satz using work stealing for workload balancing, based on the master/slave communication model. We define a simple way to evaluate the workload of every busy slave. The master then steals the first remaining subtree of the most loaded slave for an idle slave. Special attention is paid to prevent pingpong phenomenon. Our approach easily supports fault tolerance computing and accumulation of intermediate results over time. Encouraging experimental results are presented. We thank Dominique Lazure for material help and Laure Devendeville for fruitful discussions. This work is partially supported by grant of “pô le de modélisation de la région de Picardie”.
ISSN:	1571-0653 1571-0653
DOI:	10.1016/S1571-0653(04)00321-X