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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Electronic notes in discrete mathematics Ročník 9; s. 174 - 189
Hlavní autoři:	Jurkowiak, Bernard, Li, Chu Min, Utard, Gil
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 2001
Témata:	Parallel Search Algorithms Parallelization of DPLL procedure SAT SAT Parallel Search Algorithms Parallelization of DPLL procedure
ISSN:	1571-0653, 1571-0653
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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