Please use this identifier to cite or link to this item:
Appears in Collections:Computing Science and Mathematics Conference Papers and Proceedings
Author(s): Archibald, Blair
Maier, Patrick
Stewart, Robert
Trinder, Phil
De Beule, Jan
Contact Email:
Title: Towards Generic Scalable Parallel Combinatorial Search
Citation: Archibald B, Maier P, Stewart R, Trinder P & De Beule J (2017) Towards Generic Scalable Parallel Combinatorial Search. In: PASCO 2017 Proceedings of the International Workshop on Parallel Symbolic Computation. International Workshop on Parallel Symbolic Computation, Kaiserslautern, Germany, 23.07.2017-24.07.2017. New York: ACM, p. 6.
Issue Date: 2017
Date Deposited: 15-Aug-2019
Conference Name: International Workshop on Parallel Symbolic Computation
Conference Dates: 2017-07-23 - 2017-07-24
Conference Location: Kaiserslautern, Germany
Abstract: Combinatorial search problems in mathematics, e.g. in finite geometry, are notoriously hard; a state-of-the-art backtracking search algorithm can easily take months to solve a single problem. There is clearly demand for parallel combinatorial search algorithms scaling to hundreds of cores and beyond. However, backtracking combinatorial searches are challenging to parallelise due to their sensitivity to search order and due to the their irregularly shaped search trees. Moreover, scaling parallel search to hundreds of cores generally requires highly specialist parallel programming expertise. This paper proposes a generic scalable framework for solving hard combinatorial problems. Key elements are distributed memory task parallelism (to achieve scale), work stealing (to cope with irregularity), and generic algorithmic skeletons for combinatorial search (to reduce the parallelism expertise required). We outline two implementations: a mature Haskell Tree Search Library (HTSL) based around algorithmic skeletons and a prototype C++ Tree Search Library (CTSL) that uses hand coded applications. Experiments on maximum clique problems and on a problem in finite geometry, the search for spreads in H(4, 22), show that (1) CTSL consistently outperforms HTSL on sequential runs, and (2) both libraries scale to 200 cores, e.g. speeding up spreads search by a factor of 81 (HTSL) and 60 (CTSL), respectively. This demonstrates the potential of our generic framework for scaling parallel combinatorial search to large distributed memory platforms.
Status: AM - Accepted Manuscript
Rights: © ACM, 2017. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings of International Workshop on Parallel Symbolic Computation, July 23–24, 2017, article 6.

Files in This Item:
File Description SizeFormat 
Archibald_Maier_Stewart_Trinder_DeBeule_PASCO2017_preprint.pdfFulltext - Accepted Version663.26 kBAdobe PDFView/Open

This item is protected by original copyright

Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved

If you believe that any material held in STORRE infringes copyright, please contact providing details and we will remove the Work from public display in STORRE and investigate your claim.