Parallel Numerical Linear Algebra for Future Extreme-Scale Systems

Risultati finali

Final prototype software for different versions of the BLAS

Final implementation and evaluation of different versions of the BLAS based on the final specification from WP7.

Software for partitioning saddle point problems and overdetermined systems; improved block Cimmino methods incorporating new solvers from other deliverables. Includes extensive testing, documentation and benchmarking.

Software integration

Integration of the NLAFET library in the respective application environments.

Novel SVD algorithms

Prototypes for the standard SVD algorithm, the symmetric eigenvalue problem and the QDWH-based SVD algorithm.

Software for highly unsymmetric factorizations

Implementation of proposed methods from D3.4 on top of common task framework. Includes extensive testing, documentation and benchmarking.

Prototypes for tiled one-sided factorizations with algorithm-based fault tolerance

Prototype software for the Cholesky, LU, and QR factorizations with algorithm-based fault tolerance described in D6.6.

Prototype software for eigenvalue problem solvers

Prototypes for reduction to non-symmetric condensed forms (Hessenberg and Hessenberg-triangular), for the symmetric eigenvalue problem and the non-symmetric eigenvalue problems.

Prototype software, phase 2

Prototypes for Krylov-based iterative methods, and multilevel preconditioners.

Bidiagonal factorization

Prototypes for tw-sided bidiagonal factorization.

Prototype software, phase 1

Prototype software for sparse matrix-matrix multiplication and sparse low-rank matrix- approximation.

Prototype software for different versions of the BLAS

Implementation and evaluation of different versions of the BLAS based on the draft specification from WP7.

Software for symmetrically structured factorizations

Implementation and adaption of methods from D3.2 on top of the common task framework. Extension from symmetric to unsymmetric (but symmetrically structured) case. Includes extensive testing, documentation and benchmarking.

Prototypes for runtime systems exhibiting novel types of scheduling

Prototype for runtime systems capable of scheduling at a varying level of granularity/abstraction (i.e., basic kernels, BLAS, LAPACK, etc, and runtime systems that can execute the tasks along the critical path with an adaptive level of parallelism.

Algorithm design for symmetrically structured factorizations

Report on algorithm design and approaches to address issues around use of DAGs for sparse factorizations. Includes reporting on prototype code testing possible solutions.

Scalability and tunability of factorization algorithms

Report on scalability and tunability of the software implementing novel factorisation algorithms.

One-sided matrix factorizations

Report on tile algorithms and new experimental algorithms for matrix factorizations (LU, Cholesky, symmetric indefinite and QR). Includes reporting on and documentation of prototype code developed.

Analysis and algorithm design

Report on novel Krylov methods and multilevel preconditioners, focusing on numerical efficiency and theoretical properties.

Eigenvalue solvers for nonsymmetric problems

Evaluation of new eigenvalue solvers for the non-symmetric eigenvalue problem, including Krylov methods.

Draft specification for Hybrid BLAS

Requirements and draft specification for a common set of high performance linear algebra kernels on hybrid systems: Hybrid BLAS.

Evaluation of software prototypes

Report evaluating the prototype software developed in task 6.1 with regard to overall system performance on a selection of linear algebra algorithms.

Integration

Report on the integration of preconditioners and iterative methods from D4.3 into the NLAFET library. Evaluation of the parallel efficiency of the new preconditioned iterative solvers.

Algorithm design for highly unsymmetric factorizations

Report on experimental algorithms for parallel Markowitz ordering, analyzing various approaches and highlighting issues arising. Includes reporting on prototype code testing possible algorithms and solutions.

Evaluation of auto-tuning techniques

Report on the effect of applying the novel scheduling and auto-tuning prototypes to various linear algebra problems.

Novel methods for static and dynamic scheduling

Evaluation of existing and novel methods for static and dynamic scheduling in various types of HPC systems. Includes documentation of algorithms and prototypes developed.

Requirements analysis

Report describing the outcome of the requirements analysis for all applications.

First dissemination report

Dissemination report for the first reporting period, M1-M18.

Dissemination and community outreach plan

Plan for how to disseminate new results and interact with the broader community.

An off-line auto-tuning framework based on heuristic search

Review of techniques for pruning the search space in the context of auto-tuning, resulting in prototypes for an offline auto-tuning framework based on heuristic search. Includes reporting on optimal circumstances for switching scheduling approaches at run-time.

Second dissemination report

Final dissemination report, covering M19-M36.

Algorithm design for hybrid methods

Report on partitioning techniques and performance bottlenecks for hybrid methods including block Cimmino. Analysis of methods for saddle-point and overdetermined systems.

Eigenvalue problem solvers

Report on computation of eigenvectors and reordering of eigenvalues in Schur and generalized Schur forms. Includes evaluation of the scalability and tunability of the prototype software developed.

Theoretical bounds for communication in sparse operations

Report on theoretical lower bounds for key sparse matrix operations such as matrix-matrix multiplication and factorization.

Performance evaluation

Evaluation of the communication complexity and parallel performance of the prototypes from D4.3.

Final Hybrid BLAS specification

Revised versions of the BLAS specification based on collaborations with academic institutions and hardware vendors.

Algorithm-based fault tolerance techniques

Report on algorithm-based fault tolerance applied to the tiled Cholesky, LU, and/or QR factorizations.

Validation and evaluation

Evaluation of the NLAFET library in the context of the applications, leading to validation of the library and recommendations for future improvements.

Collaborative infrastructure

Project website (will contain both public parts, and parts that are restricted to the consortium), public and private source code repositories, bug tracking system, online forum, coding style, and developer guidelines.

Beta release of the NLAFET library

Beta release of parts of the NLAFET library and User's Guide.

Release of the NLAFET library

First complete release of the NLAFET library and associated User's Guide.

Pubblicazioni

A synchronization-free algorithm for parallel sparse triangular solves.

Autori: W. Liu , A. Li , J. Hogg, I. Duff, B Vinter
Pubblicato in: Proceedings of Euro-Par 2016, Springer Lecture Notes, Numero 9833, 2016, Pagina/e 617-630, ISBN 978-3-319-43658-6
Editore: Springer Verlag
DOI: 10.1007/978-3-319-43659-3_45

Creating a Standardised Set of Batched BLAS Routines

Autori: Jack Dongarra and Sven Hammarling and Nicholas J. Higham and Samuel D. Relton and Pedro Valero-Lara and Mawussi Zounon
Pubblicato in: Proceedings of the Fourth Workshop on Sustainable Software for Science: Practice and Experiences (WSSSPE4, 2016), 2016
Editore: CEUR Workshop Proceedings

A 3D Parallel Algorithm for QR Decomposition

Autori: Grey Ballard, James Demmel, Laura Grigori, Mathias Jacquelin, Nicholas Knight
Pubblicato in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18, 2018, Pagina/e 55-65, ISBN 9781-450357999
Editore: ACM Press
DOI: 10.1145/3210377.3210415

An Auto-Tuning Framework for a NUMA-Aware Hessenberg Reduction Algorithm

Autori: Mahmoud Eljammaly, Lars Karlsson, Bo Kågström
Pubblicato in: Companion of the 2018 ACM/SPEC International Conference on Performance Engineering - ICPE '18, 2018, Pagina/e 5-8, ISBN 9781-450356299
Editore: ACM Press
DOI: 10.1145/3185768.3186304

Harnessing GPU’s Tensor Cores for Fast FP16 Arithmetic to Speedup Mixed-Precision Iterative Refinement Solvers

Autori: Azzam Haidar, Stanimire Tomov, Jack Dongarra, Nick Higham
Pubblicato in: Proceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis, 2019
Editore: Association for Computing Machinery

Distributed One-Stage Hessenberg Triangular Reduction with Wavefront Scheduling

Autori: B. Adlerborn, L. Karlsson, and B. Kågström
Pubblicato in: NLAFET Working Papers, Numero 1, 2016
Editore: Umeå University, the NLAFET project

PDHGEQZ User Guide

Autori: B. Adlerborn, B. Kågström, D. Kressner
Pubblicato in: NLAFET Working Notes, Numero 2, 2016
Editore: Umeå University, NLAFET project

A Proposed API for Batched Basic Linear Algebra Subprograms

Autori: J. Dongarra, I. Duff, J Hogg, M. Gates, A. Haidar, S. Hammarling, N. J. Higham, P.V.-Lara, S.D. Relton, S. Tomov, M. Zounon
Pubblicato in: 2016, ISSN 1749-9097
Editore: University of Manchester

Experiments with sparse Cholesky using runtime systems

Autori: I. Duff, J. Hogg, and F. Lopez
Pubblicato in: NLAFET Working Notes, Numero 7, 2016
Editore: Umeå University, STFC

Workshop on Batched, Reproducible, and Reduced Precision BLAS

Autori: S. Hammarling
Pubblicato in: NLAFET Working Notes, Numero 4, 2016
Editore: Umeå University, University of Manchester

Low rank approximation of a sparse matrix based on LU factorization with column and row tournament pivoting

Autori: L. Grigori, S. Cayrols, and J. Demmel
Pubblicato in: NLAFET Working Notes, Numero 3, 2016
Editore: Umeå University, INRIA

A Comparison of Potential Interfaces for Batched BLAS Computations

Autori: S.D. Relton, P. Valero-Lara, and M. Zounon
Pubblicato in: NLAFET Working Notes, Numero 5, 2016
Editore: Umeå University, University of Manchester

A new sparse solver using a posteriori threshold pivoting

Autori: Jonathan Hogg
Pubblicato in: NLAFET Working Notes, Numero 6, 2016
Editore: Umeå University, STFC

Linear-time CUR approximation of BEM matrices

Autori: Ayala, Alan; Claeys, Xavier; Grigori, Laura
Pubblicato in: https://hal.inria.fr/hal-01893036, Numero 1, 2018
Editore: INRIA

A multilevel algebraic error estimator and the corresponding iterative solver with $p$-robust behavior

Autori: Miraçi, Ani; Papež, Jan; Vohralík, Martin
Pubblicato in: https://hal.archives-ouvertes.fr/hal-02070981, Numero 1, 2019
Editore: INRIA

Scalable Linear Solvers based on Enlarged Krylov subspaces with Dynamic Reduction of Search Directions

Autori: Laura Grigori, Olivier Tissot
Pubblicato in: 2018
Editore: INRIA

Reducing the communication and computational costs of enlarged Krylov subspaces conjugate gradient

Autori: Laura Grigori, Olivier Tissot
Pubblicato in: 2017
Editore: INRIA

A Multilevel Schwarz Preconditioner Based on a Hierarchy of Robust Coarse Spaces

Autori: Hussam Al Daas, Laura Grigori, Pierre Jolivet, Pierre-Henri Tournier
Pubblicato in: 2019
Editore: INRIA

Experiments with sparse Cholesky using a parametrized task graph implementation.

Autori: Iain Duff and Florent Lopez
Pubblicato in: NLAFET Working Notes, Numero 14, 2017
Editore: Umeå University, also as Technical Report RAL-TR-2017-006, Science & Technology Facilities Council, UK.

PLASMA 17 Functionality Report: Parallel BLAS and Norms, Linear Systems and Least Squares, Mixed Precision and Matrix Inversion

Autori: Maksims Abalenkovs, Jack Dongarra, Mark Gates, Azzam Haidar, Jakub Kurzak, Piotr Luszczek, Mawussi Zounon, Samuel Relton, Jakub Sistek, David Stevens, Ichitaro Yamazaki, Asim YarKhan
Pubblicato in: NLAFET Working Notes, Numero 15, 2017
Editore: Umeå University, also as LAPACK Working Notes 293

Solving linear equations with messenger-field and conjugate gradients techniques – an application to CMB data analysis

Autori: Jan Papez, Laura Grigori, Radoslav Stompor
Pubblicato in: NLAFET Working Notes, Numero 19, 2018
Editore: Umeå University. Also as INRIA Research Report 9157, France

Sparse direct solution on parallel computers

Autori: Iain Duff, Florent Lopez and Stojce Nakov
Pubblicato in: NLAFET Working Notes, Numero 17, 2017
Editore: Umeå University. Also published as Technical Report RAL-TR-2017-010, STFC, UK.

Parallelization of the solve phase in a task-based Cholesky solver using a sequential task flow model

Autori: Sébastien Cayrols, Iain Duff and Florent Lopez
Pubblicato in: NLAFET Working Notes, Numero 20, 2018
Editore: Umeå University. Also published as Technical Report RAL-TR-2018-008, STFC, UK

PLASMA 17 Performance Report. Linear Systems and Least Squares; Haswell, Knights Landing, POWER8.

Autori: Maksims Abalenkovs, Negin Bagherpour, Jack Dongarra, Mark Gates, Azzam Haidar, Jakub Kurzak, Piotr Luszczek, Samuel Relton, Jakub Sistek, David Stevens, PanruoWu, Ichitaro Yamazaki, Asim YarKhan, Mawussi Zounon
Pubblicato in: NLAFET Working Notes, Numero 16, 2017
Editore: Umeå university, also published as LAPACK Working Notes 292

An Auto-Tuning Framework for a NUMA-Aware Hessenberg Reduction Algorithm

Autori: Mahmoud Eljammaly, Lars Karlsson and Bo Kågström
Pubblicato in: NLAFET Working Notes, Numero 18, 2017
Editore: Umeå University

A new sparse symmetric indefinite solver using A Posteriori Threshold Pivoting

Autori: Iain Duff, Jonathan Hogg and Florent Lopez
Pubblicato in: NLAFET Working Notes, Numero 21, 2018
Editore: Umeå University. Also published as Technical Report RAL-TR-2018-012, STFC, UK

Design and implementation of a parallel Markowitz threshold algorithm

Autori: Timothy Davis, Iain Duff, Stojce Nakov
Pubblicato in: NLAFET Working Notes, Numero 22, 2019
Editore: Umeå University. Also published as Technical Report RAL-TR-2019-003, STFC, UK

Reducing the communication and computational costs of Enlarged Krylov subspaces Conjugate Gradient

Autori: L. Grigori and O. Tissot
Pubblicato in: NLAFET Working Note, Numero 13, 2017
Editore: Umeå University, also INRIA Research Report 9023

Evaluation of the Tunability of a New NUMA-Aware Hessenberg Reduction Algorithm

Autori: M. Eljammaly, L. Karlsson, and B. Kågström
Pubblicato in: NLAFET Working Notes, Numero 8, 2017
Editore: Umeå University, the NLAFET project

Second Workshop on Batched, Reproducible, and Reduced Precision BLAS.

Autori: Sven Hammarling
Pubblicato in: NLAFET Working Notes, Numero 12, 2017
Editore: Umeå University, University of Manchester

Towards Highly Parallel and Compute-Bound Computation of Eigenvectors of Matrices in Schur Form

Autori: B. Adlerborn, C.C. Kjelgaard Mikkelsen, L. Karlsson, and B. Kågström
Pubblicato in: NLAFET Working Notes, Numero 10, 2017
Editore: Umeå University, the NLAFET project

Robust solution of triangular linear systems

Autori: C.C. Kjelgaard Mikkelsen and L. Karlsson
Pubblicato in: NLAFET Working Notes, Numero 9, 2017
Editore: Umeå University

Task-Based Parallel Algorithms for Reordering of Matrices in Real Schur Form

Autori: M. Myllykoski, C.C. Kjelgaard Mikkelsen, L. Karlsson, and B. Kågström.
Pubblicato in: NLAFET Working Notes, Numero 11, 2017
Editore: Umeå University, the NLAFET project

Solving linear equations with messenger-field and conjugate gradient techniques: An application to CMB data analysis

Autori: J. Papež, L. Grigori, R. Stompor
Pubblicato in: Astronomy & Astrophysics, Numero 620, 2018, Pagina/e A59, ISSN 0004-6361
Editore: Springer Verlag
DOI: 10.1051/0004-6361/201832987

The Design and Performance of Batched BLAS on Modern High-Performance Computing Systems

Autori: Jack Dongarra, Sven Hammarling, Nicholas J. Higham, Samuel D. Relton, Pedro Valero-Lara, Mawussi Zounon
Pubblicato in: Procedia Computer Science, Numero 108, 2017, Pagina/e 495-504, ISSN 1877-0509
Editore: Elsevier
DOI: 10.1016/j.procs.2017.05.138

A Householder-Based Algorithm for Hessenberg-Triangular Reduction

Autori: Zvonimir Bujanović, Lars Karlsson, Daniel Kressner
Pubblicato in: SIAM Journal on Matrix Analysis and Applications, Numero 39/3, 2018, Pagina/e 1270-1294, ISSN 0895-4798
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/17m1153637

Distributed One-Stage Hessenberg-Triangular Reduction with Wavefront Scheduling

Autori: Björn Adlerborn, Lars Karlsson, Bo Kågström
Pubblicato in: SIAM Journal on Scientific Computing, Numero 40/2, 2018, Pagina/e C157-C180, ISSN 1064-8275
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/16m1103890

ALORA: Affine Low-Rank Approximations

Autori: Alan Ayala, Xavier Claeys, Laura Grigori
Pubblicato in: Journal of Scientific Computing, Numero 79/2, 2019, Pagina/e 1135-1160, ISSN 0885-7474
Editore: Kluwer Academic/Plenum Publishers
DOI: 10.1007/s10915-018-0885-5

PLASMA

Autori: Jack Dongarra, Negin Bagherpour, Sven Hammarling, Jakub Šístek, David Stevens, Mawussi Zounon, Samuel D. Relton, Mark Gates, Azzam Haidar, Jakub Kurzak, Piotr Luszczek, Panruo Wu, Ichitaro Yamazaki, Asim Yarkhan, Maksims Abalenkovs
Pubblicato in: ACM Transactions on Mathematical Software, Numero 45/2, 2019, Pagina/e 1-35, ISSN 0098-3500
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3264491

Experiments with sparse Cholesky using a sequential task-flow implementation

Autori: Iain Duff, Jonathan Hogg, Florent Lopez
Pubblicato in: Numerical Algebra, Control & Optimization, Numero 8/2, 2018, Pagina/e 237-260, ISSN 2155-3297
Editore: American Institute of Mathematical Sciences
DOI: 10.3934/naco.2018014

A Guide for Achieving High Performance with Very Small Matrices on GPU: A Case Study of Batched LU and Cholesky Factorizations

Autori: Azzam Haidar, Ahmad Abdelfattah, Mawussi Zounon, Stanimire Tomov, Jack Dongarra
Pubblicato in: IEEE Transactions on Parallel and Distributed Systems, Numero 29/5, 2018, Pagina/e 973-984, ISSN 1045-9219
Editore: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tpds.2017.2783929

Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting

Autori: Laura Grigori, Sebastien Cayrols, James W. Demmel
Pubblicato in: SIAM Journal on Scientific Computing, Numero 40/2, 2018, Pagina/e C181-C209, ISSN 1064-8275
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/16m1074527

Parallel robust solution of triangular linear systems

Autori: Carl Christian Kjelgaard Mikkelsen, Angelika Beatrix Schwarz, Lars Karlsson
Pubblicato in: Concurrency and Computation: Practice and Experience, 2017, Pagina/e e5064, ISSN 1532-0626
Editore: John Wiley & Sons Inc.
DOI: 10.1002/cpe.5064

Fast synchronization-free algorithms for parallel sparse triangular solves with multiple right-hand sides

Autori: Weifeng Liu, Ang Li, Jonathan D. Hogg, Iain S. Duff, Brian Vinter
Pubblicato in: Concurrency and Computation: Practice and Experience, Numero 29/21, 2017, Pagina/e e4244, ISSN 1532-0626
Editore: John Wiley & Sons Inc.
DOI: 10.1002/cpe.4244

On solving separable block tridiagonal linear systems using a GPU implementation of radix-4 PSCR method

Autori: M. Myllykoski, T. Rossi, J. Toivanen
Pubblicato in: Journal of Parallel and Distributed Computing, Numero 115, 2018, Pagina/e 56-66, ISSN 0743-7315
Editore: Academic Press
DOI: 10.1016/j.jpdc.2018.01.004

Scalable eigenvector computation for the non-symmetric eigenvalue problem

Autori: Angelika Schwarz, Lars Karlsson
Pubblicato in: Parallel Computing, Numero 85, 2019, Pagina/e 131-140, ISSN 0167-8191
Editore: Elsevier BV
DOI: 10.1016/j.parco.2019.04.001

Symmetric Indefinite Linear Solver Using OpenMP Task on Multicore Architectures

Autori: Ichitaro Yamazaki, Jakub Kurzak, Panruo Wu, Mawussi Zounon, Jack Dongarra
Pubblicato in: IEEE Transactions on Parallel and Distributed Systems, Numero 29/8, 2018, Pagina/e 1879-1892, ISSN 1045-9219
Editore: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tpds.2018.2808964

Optimized Batched Linear Algebra for Modern Architectures

Autori: Jack Dongarra, Sven Hammarling, Nicholas J. Higham, Samuel D. Relton, Mawussi Zounon
Pubblicato in: Euro-Par 2017: Parallel Processing, Numero 10417, 2017, Pagina/e 511-522, ISBN 978-3-319-64202-4
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-64203-1_37

Sparse Direct Solution on Parallel Computers

Autori: Iain Duff, Florent Lopez, Stojce Nakov
Pubblicato in: Numerical Analysis and Optimization, Numero 235, 2018, Pagina/e 67-98, ISBN 978-3-319-90025-4
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-90026-1_4

On the Tunability of a New Hessenberg Reduction Algorithm Using Parallel Cache Assignment

Autori: Mahmoud Eljammaly, Lars Karlsson, Bo Kågström
Pubblicato in: Parallel Processing and Applied Mathematics, Numero 10777, 2018, Pagina/e 579-589, ISBN 978-3-319-78023-8
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-78024-5_50

Experiments with Sparse Cholesky Using a Parametrized Task Graph Implementation

Autori: Iain Duff, Florent Lopez
Pubblicato in: Parallel Processing and Applied Mathematics, Numero 10777, 2018, Pagina/e 197-206, ISBN 978-3-319-78023-8
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-78024-5_18

The Design of Fast and Energy-Efficient Linear Solvers: On the Potential of Half-Precision Arithmetic and Iterative Refinement Techniques

Autori: Azzam Haidar, Ahmad Abdelfattah, Mawussi Zounon, Panruo Wu, Srikara Pranesh, Stanimire Tomov, Jack Dongarra
Pubblicato in: Computational Science – ICCS 2018, Numero 10860, 2018, Pagina/e 586-600, ISBN 978-3-319-93697-0
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-93698-7_45

Blocked Algorithms for Robust Solution of Triangular Linear Systems

Autori: Carl Christian Kjelgaard Mikkelsen, Lars Karlsson
Pubblicato in: Parallel Processing and Applied Mathematics, Numero 10777, 2018, Pagina/e 68-78, ISBN 978-3-319-78023-8
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-78024-5_7

A Task-Based Algorithm for Reordering the Eigenvalues of a Matrix in Real Schur Form

Autori: Mirko Myllykoski
Pubblicato in: Parallel Processing and Applied Mathematics, Numero 10777, 2018, Pagina/e 207-216, ISBN 978-3-319-78023-8
Editore: Springer International Publishing
DOI: 10.1007/978-3-319-78024-5_19

È in corso la ricerca di dati su OpenAIRE...

Risultati finali

Pubblicazioni

Condividi questa pagina

Scarica