Large-scale parallelism for constraint-based local search: the costas array case study

Article English OPEN
Caniou, Yves; Codognet, Philippe; Richoux, Florian; Diaz, Daniel; Abreu, Salvador;
(2015)
  • Publisher: Springer Verlag
  • Related identifiers: doi: 10.1007/s10601-014-9168-4
  • Subject: [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI] | [ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM] | [ INFO.INFO-AI ] Computer Science [cs]/Artificial Intelligence [cs.AI] | [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC] | [ INFO.INFO-DC ] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC] | [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

International audience; We present the parallel implementation of a constraint-based Local Search algorithm and investigate its performance on several hardware plat-forms with several hundreds or thousands of cores. We chose as the basis for these experiments the Adapti... View more
  • References (77)
    77 references, page 1 of 8

    1. Aida, K., Osumi, T.: A case study in running a parallel branch and bound application on the grid. In: SAINT '05: Proceedings of the 2005 Symposium on Applications and the Internet, pp. 164{173. IEEE Computer Society, Washington, DC, USA (2005)

    2. Aiex, R., Resende, M., Ribeiro, C.: Probability distribution of solution time in GRASP: An experimental investigation. Journal of Heuristics 8(3), 343{373 (2002)

    3. Aiex, R., Resende, M., Ribeiro, C.: TTT plots: a Perl program to create time-to-target plots. Optimization Letters 1, 355{366 (2007)

    4. Alava, M., Ardelius, J., Aurell, E., Kaski, P., Orponen, P., Krishnamurthy, S., Seitz, S.: Circumspect descent prevails in solving random constraint satisfaction problems. PNAS 105(40), 15,253{15,257 (2007)

    5. Alba, E.: Special issue on new advances on parallel meta-heuristics for complex problems. Journal of Heuristics 10(3), 239{380 (2004)

    6. Amdahl, G.: Validity of the single processor approach to achieving large scale computing capabilities. In: proceedings of AFIPS'67, spring joint computer conference, pp. 483{ 485. ACM Press, Atlantic City, New Jersey (1967). URL http://doi.acm.org/10.1145/ 1465482.1465560

    7. Arbelaez, A., Codognet, P.: Massively parallel local search for SAT. In: proceedings of ICTAI'2012, IEEE 24th International Conference on Tools with Arti cial Intelligence, pp. 57{64. IEEE Press (2012)

    8. Arbelaez, A., Codognet, P.: From sequential to parallel local search for SAT. In: M. Middendorf, C. Blum (eds.) proceedings of EvoCOP13, 13th European Conference on Evolutionary Computation in Combinatorial Optimization, Lecture Notes in Computer Science, vol. 7832, pp. 157{168. Springer Verlag (2013)

    9. Arbelaez, A., Hamadi, Y.: Improving Parallel Local Search for SAT. In: C. Coelo (ed.) Learning and Intelligent Optimization, Fifth International Conference, LION 2011. LNCS, Rome, Italy (2011)

    10. Balint, A., Frohlich, A., Tompkins, D., Hoos, H.: Sparrow2011. In: Solver Description Booklet, SAT competition 2011 (2011)

  • Related Research Results (1)
    Inferred by OpenAIRE
    software
    Adaptive Search software on SourceForge
    72%
  • Metrics
Share - Bookmark