GHOST: Building blocks for high performance sparse linear algebra on heterogeneous systems

Abstract

While many of the architectural details of future exascale-class high performance computer systems are still a matter of intense research, there appears to be a general consensus that they will be strongly heterogeneous, featuring "standard" as well as "accelerated" resources. Today, such resources are available as multicore processors, graphics processing units (GPUs), and other accelerators such as the Intel Xeon Phi. Any software infrastructure that claims usefulness for such environments must be able to meet their inherent challenges: massive multi-level parallelism, topology, asynchronicity, and abstraction. The "General, Hybrid, and Optimized Sparse Toolkit" (GHOST) is a collection of building blocks that targets algorithms dealing with sparse matrix representations on current and future large-scale systems. It implements the "MPI+X" paradigm, has a pure C interface, and provides hybrid-parallel numerical kernels, intelligent resource management, and truly heterogeneous parallelism for multicore CPUs, Nvidia GPUs, and the Intel Xeon Phi. We describe the details of its design with respect to the challenges posed by modern heterogeneous supercomputers and recent algorithmic developments. Implementation details which are indispensable for achieving high efficiency are pointed out and their necessity is justified by performance measurements or predictions based on performance models. The library code and several applications are available as open source. We also provide instructions on how to make use of GHOST in existing software packages, together with a case study which demonstrates the applicability and performance of GHOST as a component within a larger software stack.

32 pages, 11 figures

References in corpus (7)

• A Density Matrix-based Algorithm for Solving Eigenvalue Problems
• PT-Scotch: A tool for efficient parallel graph ordering
• The fate of topological-insulator surface states under strong disorder
• High-performance implementation of Chebyshev filter diagonalization for interior eigenvalue computations
• Performance Engineering of the Kernel Polynomial Method on Large-Scale CPU-GPU Systems
• Pipelined Iterative Solvers with Kernel Fusion for Graphics Processing Units
• Dot-bound and dispersive states in graphene quantum dot superlattices

Cited by in corpus (7)

• KITE: high-performance accurate modelling of electronic structure and response functions of large molecules, disordered crystals and heterostructures
• Kerncraft: A Tool for Analytic Performance Modeling of Loop Kernels
• Chebyshev Filter Diagonalization on Modern Manycore Processors and GPGPUs
• The Role of Idle Waves, Desynchronization, and Bottleneck Evasion in the Performance of Parallel Programs
• Performance Engineering for Real and Complex Tall & Skinny Matrix Multiplication Kernels on GPUs
• A domain-specific language and matrix-free stencil code for investigating electronic properties of Dirac and topological materials
• Orthogonal layers of parallelism in large-scale eigenvalue computations