Parallel Local Search in Comet

  • Laurent Michel
  • Pascal Van Hentenryck
Conference paper

DOI: 10.1007/11564751_33

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3709)
Cite this paper as:
Michel L., Van Hentenryck P. (2005) Parallel Local Search in Comet. In: van Beek P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg


The availability of commodity multiprocessors offers significant opportunities for addressing the increasing computational requirements of optimization applications. To leverage these potential benefits, it is important however to make parallel processing easily accessible to a wide audience of optimization programmers. This paper addresses this challenge by proposing parallel programming abstractions that keep the distance between sequential and parallel local search algorithms as small as possible. The abstractions, that include parallel loops, interruptions, and thread pools, are compositional and cleanly separate the optimization program and the parallel instructions. They have been evaluated experimentally on a variety of applications, including facility location and coloring, for which they provide significant speedups.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Laurent Michel
    • 1
  • Pascal Van Hentenryck
    • 2
  1. 1.University of ConnecticutStorrsUSA
  2. 2.Brown UniversityProvidenceUSA

Personalised recommendations