Skip to Main content Skip to Navigation
Journal articles

SOLVING SAT IN A DISTRIBUTED CLOUD: A PORTFOLIO APPROACH

Abstract : We introduce a new parallel and distributed algorithm for the solution of the satisfiability problem. It is based on an algorithm portfolio and is intended to be used for servicing requests in a distributed cloud. The core of our contribution is the modeling of the optimal resource sharing schedule in parallel executions and the proposition of heuristics for its approximation. For this purpose, we reformulate a computational problem introduced in a prior work. The main assumption is that it is possible to learn optimal resource sharing from traces collected on past executions on a representative set of instances. We show that the learning can be formalized as a set coverage problem. Then we propose to solve it by approximation and dynamic programming algorithms based on classical greedy algorithms for the maximum coverage problem. Finally, we conduct an experimental evaluation for comparing the performance of the various algorithms proposed. The results show that some algorithms become more competitive if we intend to determine the trade-off between their quality and the runtime required for their computation.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02443995
Contributor : Fanny Dufossé <>
Submitted on : Friday, January 17, 2020 - 3:16:35 PM
Last modification on : Saturday, February 15, 2020 - 1:51:43 AM

File

AMCS_2019_29_2_4.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

Yanik Ngoko, Christophe Cérin, Denis Trystram. SOLVING SAT IN A DISTRIBUTED CLOUD: A PORTFOLIO APPROACH. Int. J. Appl. Math. Comput. Sci, 2019, 29 (2), pp.261 - 274. ⟨10.2478/amcs-2019-0019⟩. ⟨hal-02443995⟩

Share

Metrics

Record views

39

Files downloads

88