open access

https://hdl.handle.net/2115/79776

mts: a light framework for parallelizing tree search codes

英語

satisfiability testing

2021-03-09

Taylor & Francis

Optimization methods and software

36(2-3)

279-300

We describe mts, a generic framework for parallelizing certain types of tree search programmes including reverse search, backtracking, branch and bound and satisfiability testing. It abstracts and generalizes the ideas used in parallelizing lrs, a reverse search code for vertex enumeration. mts supports sharing information between processes which is important for applications such as satisfiability testing and branch-and-bound. No parallelization is implemented in the legacy single processor programmes minimizing the changes needed and simplifying debugging. mts is written in C, uses MPI for parallelization and can be used on a network of computers. We give four examples of reverse search codes parallelized by using mts: topological sorts, spanning trees, triangulations and Galton-Watson trees. We also give a parallelization of two codes for satisfiability testing. We give experimental results comparing the parallel codes with other codes for the same problems.

学術雑誌論文

Accepted Manuscript

This is an Accepted Manuscript of an article published by Taylor & Francis in Optimization methods and software on 22 Nov 2019, available online: http://www.tandfonline.com/10.1080/10556788.2019.1692344.

1055-6788

AA11093417