Towards Generic Scalable Parallel Combinatorial Search

Part of book or chapter of book English OPEN
Archibald, Blair; Maier, Patrick; Stewart, Robert; Trinder, Phil; De Beule, Jan;
(2017)

Combinatorial search problems in mathematics, e.g. in finite geometry, are notoriously hard; a state-of-the-art backtracking search algorithm can easily take months to solve a single problem. There is clearly demand for parallel combinatorial search algorithms scaling t... View more
  • References (26)
    26 references, page 1 of 3

    [1] Enrique Alba, Francisco Almeida, Maria J. Blesa, J. Cabeza, Carlos CoŠa, Manuel D´ıaz, Isabel Dorta, Joaquim Gabarro´, Coromoto Leo´n, J. Luna, Luz Marina Moreno, C. Pablos, Jordi Petit, Ange´lica Rojas, and Fatos Xhafa. 2002. MALLBA: A Library of Skeletons for Combinatorial Optimisation. In Euro-Par 2002, Paderborn, Germany (LNCS 2400). Springer, 927-932. DOI:hŠp://dx.doi.org/10.1007/ 3-540-45706-2 132

    [2] Blair Archibald, Patrick Maier, Robert Stewart, Phil Trinder, and Jan De Beule. 2017. Towards Generic Scalable Parallel Combinatorial Search [Data Collection]. (2017). hŠp://dx.doi.org/10.5525/gla.researchdata.430

    [3] Blair Archibald, Ciaran McCreesh, Patrick Maier, Robert Stewart, and Phil Trinder. 2017. Replicable Parallel Branch and Bound Search. (2017). arXiv:1703.05647

    [4] John Bamberg, Anton BeŠen, Philippe Cara, Jan De Beule, Michel Lavrauw, and Max Neunho¨‚er. 2015. FinInG - Finite Incidence Geometry, Version 1.3. hŠp://cage.ugent.be/€ning

    [5] Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, and Yuli Zhou. 1996. Cilk: An Ecient Multithreaded Runtime System. J. Parallel and Distrib. Comput. 37, 1 (1996), 55-69. DOI: hŠp://dx.doi.org/10.1006/jpdc.1996.0107

    [6] F. Buekenhout (Ed.). 1995. Handbook of Incidence Geometry. North-Holland, Amsterdam.

    [7] Murray Cole. 1991. Algorithmic Skeletons: Structured Management of Parallel Computation. MIT Press.

    [8] Matjaz Depolli, Janez Konc, Kati Rozman, Roman Trobec, and Dusanka Janezic. 2013. Exact Parallel Maximum Clique Algorithm for General and Protein Graphs. Journal of Chemical Information and Modeling 53, 9 (2013), 2217-2228. DOI: hŠp://dx.doi.org/10.1021/ci4002525

    [9] A. Djerrah, Bertrand Le Cun, Van-Dat Cung, and Catherine Roucairol. 2006. Bob++: Framework for Solving Optimization Problems with Branch-and-Bound methods. In High Performance Distributed Computing, HPDC-15, Paris, France. IEEE, 369-370. DOI:hŠp://dx.doi.org/10.1109/HPDC.2006.1652188

    [10] J. Falcou, J. Se´rot, T. Chateau, and J.T. Lapreste´. 2006. ‹a‚: ecient C++ design for parallel skeletons. Parallel Comput. 32, 7-8 (2006), 604 - 615. DOI: hŠp://dx.doi.org/10.1016/j.parco.2006.06.001

  • Related Research Results (1)
    Inferred by OpenAIRE
    software
    Blairarchibald/Bones: Pasco 17 Existence Skeleton (2017)
    73%
  • Similar Research Results (4)
  • Metrics
Share - Bookmark