International audienceThis paper presents the Parallel-Oriented Solver Language (POSL, pronounced " puzzle "): a new framework to build interconnected meta-heuristic based solvers working in parallel. The goal of this work is to obtain a framework to easily build solvers and reduce the developing effort, by providing a mechanism for reusing code from other solvers. The novelty of this approach lies in looking at solver as a set of components with specific goals, written in a parallel-oriented language based on operators. An interesting advantage of POSL is the possibility to share not only information, but also behaviors, allowing solvers modifications. POSL allows solver's components to be transferred and executed by other solvers. It prov...
Abstract Constraint-Based Local Search (CBLS) consist in using Local Search methods [4] for solving...
With parallelism becoming the standard in computer design, research on parallel constraint solving t...
Applying parallelism to constraint solving seems a promising approach and it has been done with vary...
International audienceFor a couple of years, all processors in modern machines are multi-core. Massi...
Constraint satisfaction and combinatorial optimization problems, even when modeled with efficient m...
With the increased availability of affordable parallel and dis- tributed hardware, programming model...
Constraint programming solvers have a serial architecture, and do not take advantage of the parallel...
National audienceThe multi-core technology and massive parallel ar-chitectures are nowadays more acc...
As multicore computing is now standard, it seems irresponsible for constraints researchers to ignore...
Writing efficient parallel programs is the biggest challenge of the software industry for the forese...
As a case study that illustrates our view on coordination and component-based software engineering, ...
Nous étudions la parallélisation de la procédure de recherche de solution d’un problème en Programma...
Dans le cadre du projet PAJERO, nous présentons dans cette thèse une parallélisation externe d'un so...
International audienceWe propose the Embarrassingly Parallel Search, a simple and efficient method f...
Recently, we developed the Parallel Heterogeneous Architecture Constraint Toolkit (PHACT), which is ...
Abstract Constraint-Based Local Search (CBLS) consist in using Local Search methods [4] for solving...
With parallelism becoming the standard in computer design, research on parallel constraint solving t...
Applying parallelism to constraint solving seems a promising approach and it has been done with vary...
International audienceFor a couple of years, all processors in modern machines are multi-core. Massi...
Constraint satisfaction and combinatorial optimization problems, even when modeled with efficient m...
With the increased availability of affordable parallel and dis- tributed hardware, programming model...
Constraint programming solvers have a serial architecture, and do not take advantage of the parallel...
National audienceThe multi-core technology and massive parallel ar-chitectures are nowadays more acc...
As multicore computing is now standard, it seems irresponsible for constraints researchers to ignore...
Writing efficient parallel programs is the biggest challenge of the software industry for the forese...
As a case study that illustrates our view on coordination and component-based software engineering, ...
Nous étudions la parallélisation de la procédure de recherche de solution d’un problème en Programma...
Dans le cadre du projet PAJERO, nous présentons dans cette thèse une parallélisation externe d'un so...
International audienceWe propose the Embarrassingly Parallel Search, a simple and efficient method f...
Recently, we developed the Parallel Heterogeneous Architecture Constraint Toolkit (PHACT), which is ...
Abstract Constraint-Based Local Search (CBLS) consist in using Local Search methods [4] for solving...
With parallelism becoming the standard in computer design, research on parallel constraint solving t...
Applying parallelism to constraint solving seems a promising approach and it has been done with vary...