skip to main content
10.1145/2830168.2830169acmconferencesArticle/Chapter ViewAbstractPublication PagesscConference Proceedingsconference-collections
research-article
Public Access

Lighthouse: an automated solver selection tool

Published:15 November 2015Publication History

ABSTRACT

Linear algebra provides the building blocks for a wide variety of scientific and engineering simulation codes. Users of these codes face a world of continuously changing algorithms and high-performance implementations. In this paper, we describe new capabilities of our Lighthouse framework, whose goal is to match specific problems in the area of high-performance numerical computing with the best available solutions. Lighthouse's innovative strategy eliminates intensive reading of documents and automates the process for developing linear algebra software. Lighthouse provides a searchable taxonomy of popular but difficult to use numerical software for dense and sparse linear algebra while providing the user with the best algorithms for a given problem based on machine learning methods. We introduce the design of Lighthouse and show examples of its interface. We also present algorithm classification results for the preconditioned iterative linear solvers in the Parallel Extensible Toolkit for Scientific Computation (PETSc) and the Trilinos library.

References

  1. Albany. https://github.com/gahansen/albany/. https://github.com/gahansen/Albany/, 2015.Google ScholarGoogle Scholar
  2. Y. Ataseven, Z. Akalın-Acar, C. Acar, and N. G. Gençer. Parallel implementation of the accelerated BEM approach for EMSI of the human brain. Medical & Biological Engineering & Computing, 46(7):671--679, 2008.Google ScholarGoogle ScholarCross RefCross Ref
  3. S. Balay, W. D. Gropp, L. C. McInnes, and B. F. Smith. Efficient management of parallelism in object oriented numerical software libraries. In E. Arge, A. M. Bruaset, and H. P. Langtangen, editors, Modern Software Tools in Scientific Computing, pages 163--202. Birkhäuser Press, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. S. Balay, S. Abhyankar, M. F. Adams, J. Brown, P. Brune, K. Buschelman, L. Dalcin, V. Eijkhout, W. D. Gropp, D. Kaushik, M. G. Knepley, L. C. McInnes, K. Rupp, B. F. Smith, S. Zampini, and H. Zhang. PETSc users manual. Technical Report ANL-95/11 - Revision 3.6, Argonne National Laboratory, 2015. URL http://www.mcs.anl.gov/petsc.Google ScholarGoogle Scholar
  5. S. Balay, S. Abhyankar, M. F. Adams, J. Brown, P. Brune, K. Buschelman, L. Dalcin, V. Eijkhout, W. D. Gropp, D. Kaushik, M. G. Knepley, L. C. McInnes, K. Rupp, B. F. Smith, S. Zampini, and H. Zhang. PETSc Web page, 2015. URL http://www.mcs.anl.gov/petsc.Google ScholarGoogle Scholar
  6. E. Bavier, M. Hoemmen, S. Rajamanickam, and H. Thornquist. Amesos2 and Belos: Direct and iterative solvers for large sparse linear systems. Scientific . . ., pages 1--25, 2012. URL http://www.sandia.gov/~srajama/publications/Amesos2\_Belos\_2012.pdfhttp://iospress.metapress.com/index/P055118195457462.pdf. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. G. Belter, E. R. Jessup, I. Karlin, and J. G. Siek. Automating the generation of composed linear algebra kernels. In SC '09: Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, pages 1--12, New York, 2009. ACM. ISBN 978-1-60558-744-8. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. S. Bhowmick, V. Eijkhout, Y. Freund, E. Fuentes, and D. Keyes. Application of alternating decision trees in selecting sparse linear solvers. In Software Automatic Tuning, pages 153--173. Springer, 2010.Google ScholarGoogle Scholar
  9. C. Bielza and P. Larrañaga. Discrete Bayesian network classifiers: A survey. ACM Comput. Surv., 47(1):5:1--5:43, July 2014. ISSN 0360-0300. URL http://doi.acm.org/10.1145/2576868. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. L. Breiman. Random forests. Mach. Learn., 45(1):5--32, Oct. 2001. ISSN 0885-6125. URL http://dx.doi.org/10.1023/A:1010933404324. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. CoolFluid. http://coolfluid.github.io/. http://coolfluid.github.io/, 2015.Google ScholarGoogle Scholar
  12. C. Cortes and V. Vapnik. Support-vector networks. Machine learning, 20(3):273--297, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. P. Cunningham and S. J. Delany. k-nearest neighbour classifiers. Multiple Classifier Systems, pages 1--17, 2007.Google ScholarGoogle Scholar
  14. G. Demiröz and H. A. Güvenir. Classification by voting feature intervals. In Proceedings of the 9th European Conference on Machine Learning, ECML '97, pages 85--92, London, UK, 1997. Springer-Verlag. ISBN 3-540-62858-4. URL http://dl.acm.org/citation.cfm?id=645325.649678. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Django. https://www.djangoproject.com/, 2015.Google ScholarGoogle Scholar
  16. J. Dongarra. Freely available software for linear algebra on the web. http://www.netlib.org/utk/people/JackDongarra/la-sw.html, 2015.Google ScholarGoogle Scholar
  17. P. R. Eller, J.-R. C. Cheng, and R. S. Maier. Dynamic linear solver selection for transient simulations using machine learning on distributed systems. In Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW), 2012 IEEE 26th International, pages 1915--1924. IEEE, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Y. Freund and L. Mason. The alternating decision tree learning algorithm. In Proceedings of the Sixteenth International Conference on Machine Learning, ICML '99, pages 124--133, San Francisco, CA, USA, 1999. Morgan Kaufmann Publishers Inc. ISBN 1-55860-612-2. URL http://dl.acm.org/citation.cfm?id=645528.657623. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. M. Hall, E. Frank, G. Holmes, B. Pfahringer, P. Reutemann, and I. H. Witten. The WEKA data mining software: An update. SIGKDD Explorations, 11, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. A. Holloway and T.-Y. Chen. Neural networks for predicting the behavior of preconditioned iterative solvers. In Computational Science--ICCS 2007, pages 302--309. Springer, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. G. Holmes, B. Pfahringer, R. Kirkby, E. Frank, and M. Hall. Multiclass alternating decision trees. In Machine learning: ECML 2002, pages 161--172. Springer, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. W. Iba and P. Langley. Induction of one-level decision trees. In Proceedings of the Ninth International Conference on Machine Learning, pages 233--240, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Ifpack2. https://trilinos.org/packages/ifpack2/. https://trilinos.org/packages/ifpack2/, 2015.Google ScholarGoogle Scholar
  24. E. Jessup, B. Bolton, B. Enosh, F. Ma, and T. Nguyen. LAPACK Internet Interface and Search Engine. http://www.cs.colorado.edu/lapack, 2008.Google ScholarGoogle Scholar
  25. LAPACK - Linear Algebra PACKage. http://www.netlib.org/lapack/, 2015.Google ScholarGoogle Scholar
  26. C. Lewis. Using the" thinking-aloud" method in cognitive interface design. IBM TJ Watson Research Center, 1982.Google ScholarGoogle Scholar
  27. J. Nielsen. How to conduct a heuristic evaluation. http://www.useit.com/papers/heuristic/heuristic\_evaluation.html, 2007.Google ScholarGoogle Scholar
  28. J. Nielsen. Ten usability heuristics. http://www.useit.com/papers/heuristic/heuristic\_list.html, 2007.Google ScholarGoogle Scholar
  29. NIST. Guide to Available Mathematical Software. http://gams.nist.gov, 2015.Google ScholarGoogle Scholar
  30. U. of Colorado. Compute resources - janus. https://www.rc.colorado.edu/support/user-guide/compute-resources.html#janus, 2015.Google ScholarGoogle Scholar
  31. U. of Florida. The University of Florida Sparse Matrix Collection. http://www.cise.ufl.edu/research/sparse/matrices/, 2015.Google ScholarGoogle Scholar
  32. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers, San Mateo, CA, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. J. Rieman, M. Franzke, and D. Redmiles. Usability evaluation with the cognitive walkthrough. http://www.acm.org/sigs/sigchi/chi95/Electronic/documnts/tutors/jr\_bdy.htm, 2004.Google ScholarGoogle Scholar
  34. Scalable Library for Eigenvalue Problem Computations (SLEPc). http://www.grycap.upv.es/slepc/, 2015.Google ScholarGoogle Scholar
  35. J. G. Siek, I. Karlin, and E. R. Jessup. Build to order linear algebra kernels. In Workshop on Performance Optimization for High-Level Languages and Libraries (PO HLL 2008), pages 1--8, April 2008.Google ScholarGoogle ScholarCross RefCross Ref
  36. The Lighthouse Project. http://lighthousehpc.github.io/lighthouse/, 2015.Google ScholarGoogle Scholar
  37. Tpetra. https://trilinos.org/packages/tpetra/. https://trilinos.org/packages/tpetra/, 2015.Google ScholarGoogle Scholar
  38. A. D. T. van Scheltinga, P. G. Myers, and J. D. Pietrzak. A finite element sea ice model of the Canadian Arctic Archipelago. Ocean dynamics, 60(6):1539--1558, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  39. J. Wang, Y. Wang, W.-k. Hu, and J.-k. Du. The high performance of finite element analysis and applications of surface acoustic waves in finite elastic solids. In Piezoelectricity, Acoustic Waves, and Device Applications, 2008. SPAWDA 2008. Symposium on, pages 66--71. IEEE, 2008.Google ScholarGoogle Scholar

Index Terms

  1. Lighthouse: an automated solver selection tool

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        SE-HPCCSE '15: Proceedings of the 3rd International Workshop on Software Engineering for High Performance Computing in Computational Science and Engineering
        November 2015
        35 pages
        ISBN:9781450340120
        DOI:10.1145/2830168

        Copyright © 2015 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 15 November 2015

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate7of12submissions,58%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader