Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Flexibilité et Portabilité pour Embarrassingly Parallel Search

Abstract : Constraint programming is a paradigm for solving combinatorial problems. Yet solving complex problems may be a lengthy process. Embarrassingly Parallel Search (EPS) is "a simple and efficient method for solving constraint programming problems in parallel". While EPS is a very generic method, its implementations are strongly dependent on the machine architecture for which they were written. We suggest a new communication architecture for EPS's inner workings such that it becomes usable on different machine architectures. Then we exhibit a prototype that combines partitioning and portfolio methods implementing that architecture.
Complete list of metadatas

Cited literature [4 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02494158
Contributor : Balassanian Dersarkissian Balassanian Dersarkissian <>
Submitted on : Friday, February 28, 2020 - 2:38:55 PM
Last modification on : Tuesday, May 26, 2020 - 6:50:59 PM
Long-term archiving on: : Friday, May 29, 2020 - 3:00:49 PM

File

preprint_draft_10971-1.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02494158, version 1

Collections

Citation

Samvel Dersarkissian, Arnaud Malapert. Flexibilité et Portabilité pour Embarrassingly Parallel Search. 2020. ⟨hal-02494158⟩

Share

Metrics

Record views

26

Files downloads

19