Adaptive Parallelization for Constraint Satisfaction Search

Authors

  • Xi Yun The Graduate Center of The City University of New York
  • Susan Epstein Hunter College of The City University of New York

DOI:

https://doi.org/10.1609/socs.v3i1.18233

Keywords:

constraint satisfaction processing, adaptive parallelized search, dynamic workload balance

Abstract

This paper introduces two adaptive paradigms that parallelize search for solutions to constraint satisfaction problems. Both are intended for any sequential solver that uses contention-oriented variable-ordering heuristics and restart strategies. Empirical results demonstrate that both paradigms improve the search performance of an underlying sequential solver, and also solve challenging problems left open after recent solver competitions.

Downloads

Published

2021-08-20