Transparent Parallelization of Constraint Programming

The availability of commodity multicore and multiprocessor machines and the inherent parallelism in constraint programming search offer significant opportunities for constraint programming. These opportunities also present a fundamental challenge: how to exploit parallelism transparently to speed up...

Full description

Saved in:
Bibliographic Details
Published in:INFORMS journal on computing Vol. 21; no. 3; pp. 363 - 382
Main Authors: Michel, Laurent, See, Andrew, Van Hentenryck, Pascal
Format: Journal Article
Language:English
Published: Linthicum INFORMS 22.06.2009
Institute for Operations Research and the Management Sciences
Subjects:
Actors
Computer programming
constraint programming
distributed computing
Distributed processing
Distributed processing (Computers)
Methods
Multiprocessing
Operations research
parallel computing
Parallel processing
Programming languages
Studies
Variables
Workers
ISSN:1091-9856, 1526-5528, 1091-9856
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The availability of commodity multicore and multiprocessor machines and the inherent parallelism in constraint programming search offer significant opportunities for constraint programming. These opportunities also present a fundamental challenge: how to exploit parallelism transparently to speed up constraint programs. This paper shows how to parallelize constraint programs transparently without changes to the sequential code. The main technical idea consists of automatically lifting a sequential exploration strategy into its parallel counterpart, allowing workers to share and steal subproblems. Experimental results show that the parallel implementation may produce significant speedups on multicore machines.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1091-9856
1526-5528
1091-9856
DOI:10.1287/ijoc.1080.0313