A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
YewPar
2020
Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Combinatorial search is central to many applications, yet the huge irregular search trees and the need to respect search heuristics make it hard to parallelise. We aim to improve the reuse of intricate parallel search implementations by providing the first general purpose scalable parallel framework for exact combinatorial search, YewPar. We make the following contributions. (1) We present a novel formal model of parallel backtracking search, covering enumeration, decision, and optimisation
doi:10.1145/3332466.3374537
dblp:conf/ppopp/ArchibaldMST20
fatcat:telo5wgflrdhnfjp3763ukwo3y