Encyclopedia of Algorithms

Living Edition
| Editors: Ming-Yang Kao

Distributed Computing for Enumeration

Living reference work entry
DOI: https://doi.org/10.1007/978-3-642-27848-8_724-1

Years and Authors of Summarized Original Work

2006; Buehrer, Parthasarathy, Chen

2012; Martins, Manquiho, Lynce

2014; Negrevergne, Termier, Rousset, Mehaut

Problem Definition

This entry considers enumeration of combinatorial problems, which can be formulated as follows. Given a large search space \(\mathcal{C}\)


Enumeration Parallelism Multicore Cluster Work sharing Work stealing 
This is a preview of subscription content, log in to check access

Recommended Reading

  1. 1.
    Zaki MJ (1999) Parallel and distributed association mining: a survey. IEEE Concurr 7(4):14–25CrossRefGoogle Scholar
  2. 2.
    Blumofe RD, Leiserson CE (1999) Scheduling multithreaded computations by work stealing. J ACM 46(5):720–748CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    Hanusse N, Maabout S (2011) A parallel algorithm for computing borders. In: Proceedings of the 20th conference on information and knowledge management (CIKM’11), Glasgow, pp 1639–1648Google Scholar
  4. 4.
    Buehrer G, Parthasarathy S, Chen Y-K (2006) Adaptive parallel graph mining for CMP architectures. In: Proceedings of the 6th IEEE international conference on data mining (ICDM’06), Hong Kong, pp 97–106Google Scholar
  5. 5.
    Négrevergne B, Termier A, Rousset M-C, Méhaut J-F (2014) ParaMiner: a generic pattern mining algorithm for mutli-core architectures. Data Min Knowl Discov 28(3):593–633CrossRefMATHMathSciNetGoogle Scholar
  6. 6.
    Martins R, Manquiho VM, Lynce I (2012) An overview of parallel SAT solving. Constraints 17(3):304–347CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.LIG, Université Grenoble AlpesGrenobleFrance