Flexible cooperation in parallel local search

Munera, Danny; Díaz, Daniel; Abreu, Salvador; Codognet, Philippe

doi:10.1145/2554850.2555140

Cited by 4 publications

(8 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Cooperative Parallel Local Search framework (CPLS) [15], [16] was designed to facilitate the implementation of cooperative parallel local search solvers. CPLS is available as an open source library written in the IBM X10 concurrent programming language.…”

Section: Frameworkmentioning

confidence: 99%

“…In our proposal, IntPool and DivPool behavior is controlled by the CPLS pool parameters, e.g., pool size, entry policy and request policy [15], [16]. We use the CPLS default values for both pools' parameters (the size of the pool is 4 and stores the best solutions; on demand a random solution is picked form the pool).…”

Section: A Parameter Selectionmentioning

confidence: 99%

“…However, a welltuned cooperation scheme may significantly outperform the independent approach. To this end, a framework -called CPLS -which eases the cooperative parallelization of local search solvers has been recently proposed in [15], [16]. This framework, available as an open source library written in the IBM X10 concurrent programming language, allows the programmer to tune the search process through an extensive set of parameters.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

On Integrating Population-Based Metaheuristics with Cooperative Parallelism

López

Munera

Díaz

et al. 2018

2018 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)

Self Cite

View full text Add to dashboard Cite

Section: Frameworkmentioning

confidence: 99%

Section: A Parameter Selectionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On Integrating Population-Based Metaheuristics with Cooperative Parallelism

López

Munera

Díaz

et al. 2018

2018 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)

Self Cite

View full text Add to dashboard Cite

“…We build on the framework for Cooperative Parallel Local Search (CPLS) proposed in [29,7]. This framework, available as an open source library in the X10 programming language, allows the programmer to tune the search process through an extensive set of parameters which, in the present version, statically condition the execution.…”

Section: Cooperative Parallel Local Searchmentioning

confidence: 99%

Solving the Quadratic Assignment Problem with Cooperative Parallel Extremal Optimization

Munera¹,

Díaz²,

Abreu³

2016

Evolutionary Computation in Combinatorial Optimization

Self Cite

View full text Add to dashboard Cite

Abstract. Several real-life applications can be stated in terms of the Quadratic Assignment Problem. Finding an optimal assignment is computationally very difficult, for many useful instances. We address this problem using a local search technique, based on Extremal Optimization and present experimental evidence that this approach is competitive. Moreover, cooperative parallel versions of our solver improve performance so much that large and hard instances can be solved quickly.

show abstract

“…In 2014, we proposed the Cooperative Parallel Local Search framework (CPLS) for the cooperative parallel execution of local search metaheuristics [14,13]. The user only has to encode the LS procedure and can rely on CPLS to obtain a parallel application able to run concurrently and cooperatively several instances of this LS procedure.…”

Section: Introductionmentioning

confidence: 99%