| |||||||||||||||
PMCS 2011 : Workshop on Parallel Methods for Constraint Solving | |||||||||||||||
Link: http://webia.lip6.fr/~codognet/PMCS11 | |||||||||||||||
| |||||||||||||||
Call For Papers | |||||||||||||||
PMCS’11
------- Workshop on Parallel Methods for Constraint Solving To be held at CP2011 17th Int. Conf. on Principles and Practice of Constraint Programming Perugia, Italy, September13-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 topics include but are not limited to: - new algorithms for parallel execution of constraint solving - new programming models - new data-driven parallel computational models - parallelization of existing methods for constraints solving - parallel local search - parallel constraint propagation techniques - parallel methods for mathematical programming - efficient extensions for multi-core architectures - constraint solving on PC clusters - constraint solving on massively parallel computers - constraint solving on GPGPU - applications and benchmarking - theoretical studies, complexity and models Paper Submission Submissions must be formatted in the Lecture Notes in Computer Science (LNCS) style and must be between 10 to 20 pages in length. A pdf version should be sent to the main organizer at the email address below. Key Dates Workshop Paper Submission: June 20, 2011 Notification of Acceptance: July 22, 2010 Final paper Due: August 6, 2011 Programme Committee Salvador Abreu, University of Evora, Portugal Alejandro Arbelaez, 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 / National Technical University of Athens, Greece 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 Daniel Diaz, University of Paris-1, France Salvador Abreu, University of Evora, Portugal Main organizer Philippe Codognet, Japanese-French Laboratory for Informatics (JFLI), CNRS / UPMC / University of Tokyo, Information Technology Center, 2-11-16 Yayoi, Bunkyo-ku, 113-8658 Tokyo, JAPAN Email: codognet AT jfli.itc.u-tokyo.ac.jp |
|