版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:LaRIA University of Picardie Jules Verne 80000 Amiens 5 rue du moulin Neuf France
出 版 物:《Electronic Notes in Discrete Mathematics》 (Electron. Notes Discrete Math.)
年 卷 期:2001年第9卷
页 面:174-189页
学科分类:07[理学] 0701[理学-数学] 070101[理学-基础数学]
主 题:Parallel Search Algorithms Parallelization of DPLL procedure SAT
摘 要: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.