Constraint Solving on Hybrid Systems

Applying parallelism to constraint solving seems a promising approach and it has been done with varying degrees of success. Early attempts to parallelize constraint propagation, which constitutes the core of traditional interleaved propagation and search constraint solving, were hindered by its esse...

Full description

Bibliographic Details
Main Author: Roque, Pedro (author)
Other Authors: Pedro, Vasco (author), Abreu, Salvador (author)
Format: article
Language:eng
Published: 2018
Subjects:
Online Access:http://hdl.handle.net/10174/23046
Country:Portugal
Oai:oai:dspace.uevora.pt:10174/23046
Description
Summary:Applying parallelism to constraint solving seems a promising approach and it has been done with varying degrees of success. Early attempts to parallelize constraint propagation, which constitutes the core of traditional interleaved propagation and search constraint solving, were hindered by its essentially sequential nature. Recently, parallelization efforts have focussed mainly on the search part of constraint solving, as well as on local-search based solving. Lately, a particular source of parallelism has become pervasive, in the guise of GPUs, able to run thousands of parallel threads, and they have naturally drawn the attention of researchers in parallel constraint solving. We address challenges faced when using multiple devices for constraint solving, especially GPUs, such as deciding on the appropriate level of parallelism to employ, load balancing and inter-device communication, and present our current solutions.