Cilk: an efficient multithreaded runtime system
PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
Constraint-Based Scheduling
Transparent Parallelization of Constraint Programming
INFORMS Journal on Computing
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Experiments with massively parallel constraint solving
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Parallelizing constraint programs transparently
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A hybrid paradigm for adaptive parallel search
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
In this paper we present initial results for implementing a constraint programming solver on a massively parallel supercomputer where coordination between processing elements is achieved through message passing. Previous work on message passing based constraint programming has been targeted towards clusters of computers (see [1,2] for some examples). Our target hardware platform is the IBM Blue Gene supercomputer. Blue Gene is designed to use a large number of relatively slow (800MHz) processors in order to achieve lower power consumption, compared to other supercomputing platforms. Blue Gene/P, the second generation of Blue Gene, can run continuously at 1 PFLOPS and can be scaled to 884,736-processors to achieve 3 PFLOPS performance. We present a dynamic scheme for allocating sub-problems to processors in a parallel, limited discrepancy tree search [3]. We evaluate this parallelization scheme on resource constrained project scheduling problems from PSPLIB [4].