Obiekt

Tytuł: Solving SAT in a distributed cloud: A portfolio approach

Współtwórca:

Kobusińska, Anna - ed. ; Hsu, Ching-Hsien - ed. ; Lin, Kwei-Jay - ed.

Podtytuł:

.

Tytuł publikacji grupowej:

AMCS, volume 29 (2019)

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.

Wydawca:

Zielona Góra: Uniwersytet Zielonogórski

Identyfikator zasobu:

oai:zbc.uz.zgora.pl:85959

DOI:

10.2478/amcs-2019-0019

Strony:

261-274

Źródło:

AMCS, volume 29, number 2 (2019) ; kliknij tutaj, żeby przejść

Jezyk:

eng

Licencja CC BY 4.0:

kliknij tutaj, żeby przejść

Prawa do dysponowania publikacją:

Biblioteka Uniwersytetu Zielonogórskiego

×

Cytowanie

Styl cytowania:

Ta strona wykorzystuje pliki 'cookies'. Więcej informacji