PMCSf11

Workshop on

Parallel Methods for Constraint Solving

September 12, 2011

CP2011

17th Int. Conf. on Principles and Practice of Constraint Programming

Perugia, Italy, September 13-16

 


 

With the development of multi-core workstations, the availability of GPGPU-enhanced systems and the access to Grid platforms and supercomputers worldwide, parallel programming is reaching mainstream programming in order to use in an efficient manner the computing power at hand.

With the move towards Exascale computing this trend will develop all the more. Constraint programming is not isolated from this phenomenon, as bigger computing power means the ability to attack more complex combinatorial problems.

In the last years some experiments have been done to extend constraint solving techniques to parallel execution, but mostly on shared memory multi-core systems (a few cores) or small PC clusters (a few machines). The next challenge is to devise efficient constraint solving technique for massively parallel computers and heterogeneous systems that will be both scalar and GPU-based.

 

This workshop is designed to be a forum for researchers willing to tackle those issues, in order to exchange theoretical algorithms and methods, implementation designs, experimental results and further boost this growing area through cross-fertilization.

 

Workshop Program

 

 

14:00 – 14:10 Introduction

 

14:10 – 14:40

Ian P. Gent, Chris Jefferson, Ian Miguel, Neil C.A. Moore, Peter

Nightingale, Patrick Prosser, Chris Unsworth:

gA Preliminary Review of Literature on Parallel Constraint Solvingh

 

14:40 – 15:10

Thierry Moisan, Jonathan Gaudreault, and Claude-Guy Quimper:

gParallel Discrepancy-based Search: An efficient and scalable search

strategy for massively parallel supercomputers providing intrinsic

load-balancing without communicationh

 

15:10-15:40

Vasco Pedro, Rui Machado, and Salvador Abreu:

gA Parallel and Distributed Framework for Constraint Solvingh

 

 

15:40 – 16:10 Coffee Break

 

 

16:10 – 16:40

Salvador Abreu, Yves Caniou, Philippe Codognet, Daniel Diaz, and

Florian Richoux:

gPerformance Analysis of Parallel Constraint-Based Local Searchh

 

16:40 – 17:40 Keynote Speech

Vijay Saraswat:

gWriting parallel constraint solvers simplyh

 

17:40-18:00 General Discussion:

gIs Constraint Programming ready for the Era of Parallelism and Concurrency?h

 

Programme Committee

 

Salvador Abreu, University of Evora, Portugal

Alexandro Arbalaez, Microsoft Research / INRIA, France

Yves Caniou, JFLI/NII, France/Japan

Philippe Codognet, JFLI/University of Tokyo, France/Japan

Bart Demoen, University of Leuven, Belgium

Yves Deville, University of Louvain, Belgium

Daniel Diaz, University Paris-I, France

Inês Dutra, University of Porto, Portugal

Youssef Hamadi, Microsoft Research, UK

João Marques-Silva, University College Dublin, Ireland

Pedro Medeiros, New University of Lisboa, Portugal

Nikolaos Papaspyrou, National Technical University of Athens, Greece

Jean-Charles Regin, University of Nice, France

Florian Richoux, JFLI/University of Tokyo, France/Japan

Kostis Sagonas, Uppsala University, Sweden

Vitor Santos-Costa, University of Porto, Portugal

Vijay Saraswat, IBM TJ Watson Research Lab, USA

Christian Schulte, Royal Institute of Technology, Sweden

Christine Solnon, University of Lyon, France

Kazunori Ueda, Waseda University, Japan

Pascal Van Hentenryck, Brown University, USA

 

 

Organizing Committee

 

Philippe Codognet, JFLI - CNRS / University of Tokyo, France, Japan

Florian Richoux, JFLI – CNRS/University of Tokyo, France/Japan

Daniel Diaz, University of Paris-1, France

Salvador Abreu, University of Evora, Portugal