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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Electronic notes in discrete mathematics Jg. 9; S. 174 - 189
Hauptverfasser:	Jurkowiak, Bernard, Li, Chu Min, Utard, Gil
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 2001
Schlagworte:	Parallel Search Algorithms Parallelization of DPLL procedure SAT SAT Parallel Search Algorithms Parallelization of DPLL procedure
ISSN:	1571-0653, 1571-0653
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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