Experiments with massively parallel constraint solving

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2009, Pages 443-448

  Bordeaux, Lucas ^a   Hamadi, Youssef ^a   Samulowitz, Horst ^a  

^a MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); LOGIC PROGRAMMING;

COMPUTING INDUSTRY; COMPUTING POWER; CONSTRAINT SOLVING; MASSIVELY PARALLELS; SMALL SCALE;

PARALLEL ARCHITECTURES;

EID: 78751523203     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. R. Bixby. The new generation of Integer Programming codes. In CP-AI-OR, 2002. Invited talk.
2. G. Chu and P. J. Stuckey. PMiniSAT: a parallelization of MiniSAT 2.0. In SAT race, 2008.
3. E. Danna. Performance variability in mixed integer programming. In 5th Workshop on Mixed Integer programming (MIP). 2008.
4. C. Gomes and B. Selman. Algorithm portfolios. Artif. Intel., 126(1-2):43-62, 2001.
5. C. Gomes, A. Sabharwal, and B. Selman. Model counting: A new strategy for obtaining good bounds. In Nat. Conf. on AI (AAAI), 2006.
6. Y. Hamadi, S. Jabbour, and L. Saïs. ManySAT: Solver description. In SAT race, 2008.
7. J. Held, J. Bautista, and S. Koehl. From a few cores to many: A tera-scale computing research overview. Technical report, Intel Corp., 2006.
8. J. Jaffar, A. Santosa, R. Yap, and K. Zhu. Scalable distributed depth-first search with greedy work stealing. In Tools with AI (ICTAI), pages 98-103, 2004.
9. S. Kasif. On the parallel complexity of discrete relaxation in constraint satisfaction networks. Artif. Intel., 45(3):99-118, 1990.
10. L. Michel, A. Su, and P. Van hentenryck. Transparent parallelization of constraint programming. INFORMS J. on Computing, To appear.
11. L. Perron. Search procedures and parallelism in constraint programming. In Principles and Practice of Constraint Programming (CP), pages 346-360. 1999.
12. E. A. Pruul and G. L. Nemhauser. Branch-and-bound and parallel computation: A historical note. O. R. Letters, 7(2), 1988.
13. H. Sutter. The free lunch is over: A fundamental turn towards concurrency in software. Dr. Dobb's Journal, 30(3), 2005.
14. L. Valiant and V. Vazirani. NP is as easy as detecting unique solutions. In ACM Symp. on Theory of Computing (STOC), pages 458-463, 1985.
15. D. L. Waltz. Massively parallel AI. Int. J. of High Speed Computing, 5(3):491-501, 1993.
16. L. Xu, F. Hutter, H. Hoos, and K. Leyton- Brown. SATzilla: Portfolio-based algorithm selection for SAT. J. of AI Research (JAIR), 32:565-606, 2007.
17. M. Yokoo, T. Ishida, and K. Kubawara. Distributed constraint satisfaction for DAI problems. In Workshop on Distributed Artif. Intel., 1990.
18. P. Zoeteweij and F. Arbab. A component-based parallel constraint solver. In Coordination Models and Languages, pages 307-322. 2004.