Parallel Local Search for the Costas Array Problem
The Costas Array Problem is a highly combina- torial problem linked to radar applications. We present in this paper its detailed modeling and solving by Adaptive Search, a constraint-based local search method. Experiments have been done on both sequential and parallel hardware up to several hundreds...
| Autor principal: | |
|---|---|
| Outros Autores: | , , , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2012
|
| Texto completo: | http://hdl.handle.net/10174/6183 |
| País: | Portugal |
| Oai: | oai:dspace.uevora.pt:10174/6183 |
| Resumo: | The Costas Array Problem is a highly combina- torial problem linked to radar applications. We present in this paper its detailed modeling and solving by Adaptive Search, a constraint-based local search method. Experiments have been done on both sequential and parallel hardware up to several hundreds of cores. Performance evaluation of the sequential version shows results outperforming previous implementations, while the parallel version shows nearly linear speedups up to 8,192 cores. |
|---|