Parallel and distributed local search in COMET

  • Authors:

  • Laurent Michel;Andrew See;Pascal Van Hentenryck

  • Affiliations:

  • University of Connecticut, Storrs, CT 06269-2155, USA;University of Connecticut, Storrs, CT 06269-2155, USA;Brown University, Box 1910, Providence, RI 02912, USA

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

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