Abstract
The paper is mainly concerned with the parallel efficiency of finite constraint satisfaction problems. The Langford’s combinatorial problem is used as benchmark and represents a real Challenging Problem especially for Parallel CSP resolution. A more compact encoding is introduced which clearly improves by a factor of ten the basic one for the Forward-Checking and Minimum Remaining Value (FC-MRV) algorithm. The applicability and benefit of this approach are studied within a shared memory model using the new emerging standard OpenMP library. A preliminary implementation is sketched and the experiments were carried out running on the Silicon Graphics Origin’2000 parallel machine. For the Langford’s problem, we mainly highlight appreciable linear efficiencies until 32 processors.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Miller, J.E.: Langford’s Problem. Online (1999). http://www.lclark.edu/ miller/langford.html.
Walsh, T.: Permutation problems and channelling constraints. Technical Report APES-26-2001, APES Research Group (2001) available at http://www.dcs.st-and.ac.uk/apes/apesreports.html.
Smith, B.: Modelling a Permutation Problem. In: Proceedings of ECAI’2000, Workshop on Modelling and Solving Problems with Constraints, Berlin (2000), RR 2000.18 available at http://www.dcs.st-and.ac.uk/apes/2000.html
OpenMP Architecture Review Board: OpenMP C and C++ Application Program Interface. (1997) http://www.openmp.org.
Montanari, U.: Networks of constraints: Fundamental properties and applications to pictures processing. Information Sciences 7 (1974) 95–132
Habbas, Z., Krajecki, M., Singer, D.: Parallel resolution of CSP with OpenMP. In: Proceedings of the 2nd. European Workshop on OpenMP, Edinburgh, (2000) 1–8
Habbas, Z., Krajecki, M., Singer, D.: Shared memory implementation of constraint satisfaction problem resolution. In: Proceedings of HLPP, Orléans, France (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Habbas, Z., Krajecki, M., Singer, D. (2002). The Langford’s Problem: A Challenge for Parallel Resolution of CSP. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2001. Lecture Notes in Computer Science, vol 2328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48086-2_88
Download citation
DOI: https://doi.org/10.1007/3-540-48086-2_88
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43792-5
Online ISBN: 978-3-540-48086-0
eBook Packages: Springer Book Archive