As a case study that illustrates our view on coordination and component-based software engineering, we present the design and implementation of a parallel constraint solver. The parallel solver coordinates autonomous instances of a sequential constraint solver, which is used as a software component. The component solvers achieve load balancing of tree search through a time-out mechanism. Experiments show that the purely exogenous mode of coordination employed here yields a viable parallel solver that effectively reduces turn-around time for constraint solving on a broad range of hardware platforms
We present a parallel implementation of a constraint-based local search algorithm and investigate it...
International audienceThis paper presents an external parallelization of Constraint Programming (CP)...
Abstract Applying parallelism to constraint solving seems a promising approach and it has been done ...
International audienceThis paper presents the Parallel-Oriented Solver Language (POSL, pronounced " ...
With the increased availability of affordable parallel and dis- tributed hardware, programming model...
Writing efficient parallel programs is the biggest challenge of the software industry for the forese...
none2Recent years have witnessed growing interest in parallelising constraint solving based on tree...
Nous étudions la parallélisation de la procédure de recherche de solution d’un problème en Programma...
The number of cores on graphical computing units (GPUs) is reaching thousands nowadays, whereas the ...
Program parallelization and distribution becomes increasingly important when new multi-core architec...
As multicore computing is now standard, it seems irresponsible for constraints researchers to ignore...
Constraint programming solvers have a serial architecture, and do not take advantage of the parallel...
With parallelism becoming the standard in computer design, research on parallel constraint solving t...
Montelius, J., 1997. Exploiting Fine-grain Parallelism in Concurrent Constraint Languages, 220 pp. U...
Program parallelization becomes increasingly important when new parallel and multi-core architecture...
We present a parallel implementation of a constraint-based local search algorithm and investigate it...
International audienceThis paper presents an external parallelization of Constraint Programming (CP)...
Abstract Applying parallelism to constraint solving seems a promising approach and it has been done ...
International audienceThis paper presents the Parallel-Oriented Solver Language (POSL, pronounced " ...
With the increased availability of affordable parallel and dis- tributed hardware, programming model...
Writing efficient parallel programs is the biggest challenge of the software industry for the forese...
none2Recent years have witnessed growing interest in parallelising constraint solving based on tree...
Nous étudions la parallélisation de la procédure de recherche de solution d’un problème en Programma...
The number of cores on graphical computing units (GPUs) is reaching thousands nowadays, whereas the ...
Program parallelization and distribution becomes increasingly important when new multi-core architec...
As multicore computing is now standard, it seems irresponsible for constraints researchers to ignore...
Constraint programming solvers have a serial architecture, and do not take advantage of the parallel...
With parallelism becoming the standard in computer design, research on parallel constraint solving t...
Montelius, J., 1997. Exploiting Fine-grain Parallelism in Concurrent Constraint Languages, 220 pp. U...
Program parallelization becomes increasingly important when new parallel and multi-core architecture...
We present a parallel implementation of a constraint-based local search algorithm and investigate it...
International audienceThis paper presents an external parallelization of Constraint Programming (CP)...
Abstract Applying parallelism to constraint solving seems a promising approach and it has been done ...