当前位置: X-MOL 学术Optim. Methods Softw. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
mts: a light framework for parallelizing tree search codes
Optimization Methods & Software ( IF 2.2 ) Pub Date : 2019-11-22 , DOI: 10.1080/10556788.2019.1692344
David Avis 1, 2 , Charles Jordan 3
Affiliation  

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.



中文翻译:

mts:用于并行化树搜索代码的轻型框架

我们描述 ,这是用于并行化某些类型的树搜索程序的通用框架,包括反向搜索,回溯,分支定界和可满足性测试。它对并行化中使用的思想进行了抽象和概括。lrs,是用于顶点枚举的反向搜索代码。 支持在进程之间共享信息,这对于应用程序来说很重要,例如可满足性测试和分支定界。在传统的单处理器程序中未实现并行化,从而最大程度地减少了所需的更改并简化了调试。 被写成 C,用途 MPI用于并行化,可以在计算机网络上使用。我们给出了四个反向搜索代码示例,它们通过使用来并行化:拓扑排序,生成树,三角剖分和Galton-Watson树。我们还为可​​满足性测试提供了两个代码的并行化。我们给出了针对相同问题将并行代码与其他代码进行比较的实验结果。

更新日期:2019-11-22
down
wechat
bug