Implementing YewPar: a framework for parallel tree search

ARCHIBALD, Blair, MAIER, Patrick, STEWART, Robert and TRINDER, Phil (2019). Implementing YewPar: a framework for parallel tree search. In: European Conference on Parallel Processing. Springer, 184-196.

[img] PDF
Archibald_Maier_Stewart_Trinder_EuroPar19_accepted.pdf - Accepted Version
Restricted to Repository staff only until 13 August 2020.
All rights reserved.

Download (351kB)
Official URL: https://link.springer.com/chapter/10.1007%2F978-3-...

Abstract

Combinatorial search is central to many applications yet hard to parallelise. We argue for improving the reuse of parallel searches, and present the design and implementation of a new parallel search framework. YewPar generalises search by abstracting search tree generation, and by providing algorithmic skeletons that support three search types, together with a set of search coordination strategies. The evaluation shows that the cost of YewPar generality is low (6.1%); global knowledge is inexpensively shared between workers; irregular tasks are effectively distributed; and YewPar delivers good runtimes, speedups and efficiency with up to 255 workers on 17 localities

Item Type: Book Section
Additional Information: Euro-Par 2019, 26th-30th August 2019, Gottingen, Germany
Page Range: 184-196
SWORD Depositor: Symplectic Elements
Depositing User: Symplectic Elements
Date Deposited: 27 Jun 2019 15:22
Last Modified: 10 Sep 2019 09:00
URI: http://shura.shu.ac.uk/id/eprint/24769

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics