Transparent Parallelization of Constraint Programming

References

• Blumhofe R. D., Leiserson C. E. Scheduling multithreaded computations by work-stealing. Proc. 35th Annual Sympos. Foundations Comput. Sci. (FOCS '94) (1994) Santa Fe, NM(IEEE Computer Society, Washington, DC) 356–368Crossref, Google Scholar
• Carlier J., Pinson E. Adjustment of heads and tails for the job-shop problem. Eur. J. Oper. Res. (1994) 78(2):146–161Crossref, Google Scholar
• Chandra R., Dagum L., Kohr D., Maydan D., McDonald J., Menon R.Parallel Programming in OpenMP (2000) (Morgan Kaufmann, San Francisco) Google Scholar
• Choi C. W., Henz M., Ng K. B. Components for state restoration in tree search. Proc. 7th Internat. Conf. Principles and Practice of Constraint Programming (CP'01) (2001) 2239Paphos, Cyprus(Springer-Verlag, Berlin) 240–255Lecture Notes in Computer ScienceCrossref, Google Scholar
• Cilk Cilk Reference Manual v.5.4.6. (2006) . Supercomputing Technologies Group, MIT Laboratory for Computer Science, Cambridge, MA. http://supertech.lcs.mit.edu/cilkGoogle Scholar
• Dell'Amico M., Trubian M. Applying tabu search to the job-shop scheduling problem. Ann. Oper. Res. (1993) 41(1–4):231–252Crossref, Google Scholar
• Gent I. P., Walsh T. CSPLib: A benchmark library for constraints. Proc. Fifth Internat. Conf. Principles and Practice of Constraint Programming (CP'99) (1999) 1713Alexandria, VA(Springer-Verlag, Berlin) 480–481Lecture Notes in Computer ScienceCrossref, Google Scholar
• Hamadi Y. Disolver: A distributed constraint solver. (2003) . Technical Report MSR-TR-2003-91, Microsoft Research, Cambridge, UKGoogle Scholar
• Harvey W. D., Ginsberg M. L. Limited discrepancy search. Proc. 14th Internat. Joint Conf. Artificial Intelligence (1995) (Morgan Kaufmann, San Francisco) 607–613Google Scholar
• Intel Teraflops research chip. (2007) . Intel, Santa Clara, CA. http://techresearch.intel.com/articles/Tera-Scale/1449.htmGoogle Scholar
• Lawrence S. Resource constrained project scheduling: An experimental investigation of heuristic scheduling techniques (supplement). (1984) . Technical report, Graduate School of Industrial Administration, Tepper School of Business, Carnegie Mellon University, PittsburghGoogle Scholar
• Michel L., Van Hentenryck P. A decomposition-based implementation of search strategies. ACM Trans. Computational Logic (2004) 5(2):351–383Crossref, Google Scholar
• Michel L., Van Hentenryck P. Parallel local search in COMET. Proc. 11th Internat. Conf. Principles and Practice of Constraint Programming (CP-2005) (2005) 3709Sitges, Spain(Springer-Verlag, Berlin) 430–444Lecture Notes in Computer ScienceCrossref, Google Scholar
• Michel L., See A., Van Hentenryck P. Distributed constraint-based local search. Proc. 12th Internat. Conf. Principles and Practice of Constraint Programming (CP-2006) (2006a) 4204Nantes, France(Springer-Verlag, Berlin) 344–358Lecture Notes in Computer ScienceCrossref, Google Scholar
• Michel L., See A., Van Hentenryck P. High-level nondeterministic abstractions in C++. Proc. 12th Internat. Conf. Principles and Practice of Constraint Programming (CP-2006) (2006b) 4204Nantes, France(Springer-Verlag, Berlin) 359–374Lecture Notes in Computer ScienceCrossref, Google Scholar
• Mudambi S., Schimpf J. Parallel CLP on heterogeneous networks. Proc. 11th Internat. Conf. Logic Programming (1994) (MIT Press, Cambridge, MA) 124–141Google Scholar
• Nuijten W. Time and resource constrained scheduling: A constraint satisfaction approach. (1994) . Ph.D. thesis, Eindhoven University of Technology, Eindhoven, The NetherlandsGoogle Scholar
• Perron L. Search procedures and parallelism in constraint programming. Proc. Fifth Internat. Conf. Principles and Practice of Constraint Programming (CP'99) (1999) 1713Alexandria, VA(Springer-Verlag, Berlin) 346–360Lecture Notes in Computer ScienceCrossref, Google Scholar
• Perron L., Jussien N., Laburthe F. Practical parallelism in constraint programming. Proc. Fourth Internat. Workshop on Integration of AI and OR Techniques in Constraint Programming for Combin. Optimisation Problems (CP-AI-OR'02) (2002) Le Croisic, France:261–275Google Scholar
• Schulte C., Smolka G. Programming constraint inference engines. Proc. Third Internat. Conf. Principles and Practice of Constraint Programming (1997) 1330Linz, Austria(Springer-Verlag, Berlin) 519–533Lecture Notes in Computer ScienceCrossref, Google Scholar
• Schulte C., Beldiceanu N., Harvey W., Henz M., Laburthe F., Monfroy E., Müller T., Perron L., Schulte C. Parallel search made simple. Proc. TRICS: Techniques foR Implementing Constraint Programming Systems, a Post-Conference Workshop of CP 2000 (2000) Singapore http://web.it.kth.se/schulte/paper.html?id=Schulte:TRICS:2000Google Scholar
• Schulte C., Carlsson M., Rossi F., van Beek P., Walsh T. Finite domain constraint programming systems. Handbook of Constraint Programming. Foundations of Artificial Intelligence Series (2006) (Elsevier Science Publishers, Amsterdam) 495–526Crossref, Google Scholar
• Torres P., Lopez P. On not-first/not-last conditions in disjunctive scheduling. Eur. J. Oper. Res. (2000) 127(2):332–343Crossref, Google Scholar
• Van Hentenryck P., Levi G., Martelli M. Parallel constraint satisfaction in logic programming: Preliminary results of CHIP within PEPSys. Proc. Sixth Internat. Conf. Logic Programming (1989) Lisbon, Portugal(MIT Press, Cambridge, MA) 165–180Google Scholar
• Van Hentenryck P. Constraint and integer programming in OPL. INFORMS J. Comput. (2002) 14(4):345–372Link, Google Scholar
• Van Hentenryck P., Michel L.Constraint-Based Local Search (2005) (MIT Press, Cambridge, MA) Google Scholar
• Van Hentenryck P., Michel L. Nondeterministic control for hybrid search. Constraints (2006) 11(4):353–373Crossref, Google Scholar
• Warren D. H. D. The SRI model for OR-parallel execution of Prolog: Abstract design and implementation issues. Proc. 4th Sympos. Logic Programming (1987) San Francisco(IEEE Computer Society Press, Los Alamitos, CA) 92–102Google Scholar