Please use this identifier to cite or link to this item:
|Title: ||Constraint Solving on Hybrid Systems|
|Authors: ||Roque, Pedro|
|Editors: ||Seipel, Dietmar|
|Keywords: ||Constraint solving|
|Issue Date: ||2018|
|Citation: ||Pedro Roque and Vasco Pedro. Constraint solving on hybrid systems. In Dietmar Seipel, Michael Hanus, and Salvador Abreu, editors, Declarative Programming and Knowledge Management - Conference on Declarative Programming, DECLARE 2017, Unifying INAP, WFLP, and WLP, Würzburg, Germany, September 1922, 2017, Revised Selected Papers, volume 10997 of Lecture Notes in Computer Science, pages 3-19. Springer, 2018.|
|Abstract: ||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.
In this paper, 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.|
|Appears in Collections:||INF - Publicações - Artigos em Revistas Internacionais Com Arbitragem Científica|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.