mts

About

mts is a parallel framework for tree (and treelike) computations written in C using MPI. As with other similar frameworks, the intent is to parallelize certain codes without rewriting the parallel interface. It is provided in the hope that it is useful to others with similar applications. mts is free software, released under the GPLv2. This is joint work with David Avis.

Downloads

mts-010.tar.gz: 2017 release

Publications

mts: a light framework for parallelizing tree search codes. [pdf]
David Avis and Charles Jordan. Optimization Methods and Software 36(2-3):279-300, 2021.
This introduces mts and describes some sample applications.
A parallel framework for reverse search using mts. [pdf]
David Avis and Charles Jordan. arXiv:1610.07735, 2016.
This is a tutorial on how to use mts. It overlaps to an extent with the paper above.
Parallel Enumeration of Triangulations. [pdf]
Charles Jordan, Michael Joswig and Lars Kastner. Electronic Journal of Combinatorics 25(3), #P3.6, 2018.
This introduces mptopcom, software that uses mts to enumerate triangulations in parallel.

Acknowledgements

Supported in part by JSPS grants 18K18027, 16H02785, 15H00847.