Decomposition techniques for parallel resolution of constraint satisfaction problems in shared memory: a comparative study Online publication date: Fri, 05-May-2006
by Zineb Habbas, Michael Krajecki, Daniel Singer
International Journal of Computational Science and Engineering (IJCSE), Vol. 1, No. 2/3/4, 2005
Abstract: This paper provides both a formal and an empirical study of decomposition techniques for parallel resolution of Constraint Satisfaction Problems (CSP) in shared memory. The main contribution of this study is to bring together decomposition techniques with Backtrack search to solve CSP on parallel architectures in shared memory. Another contribution is to demonstrate how to obtain good scalability up to hundreds of processors in shared memory for CSP resolution and more generally for Irregular Applications.
Online publication date: Fri, 05-May-2006
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org