PHiPAC
From MaRDI portal
Cited in
(81)- ATLAS
- FLAME
- PAG
- PSPASES
- rchol
- SPIRAL
- Combined selection of tile sizes and unroll factors using iterative compilation
- HPCVIEW
- GEMMW
- OCEANS
- EVENODD
- GEMM
- UHFFT
- Cache optimization for structured and unstructured grid multigrid
- BLAS
- Cache-aware multigrid methods for solving Poisson's equation in two dimensions
- FFTW
- SUMMA
- A methodology for speeding up loop kernels by exploiting the software information and the memory architecture
- PAPI
- Communication lower bounds for distributed-memory matrix multiplication
- OSKI
- PUMMA
- PLuTo
- DynTile
- Optimizing locality and scalability of embedded Runge-Kutta solvers using block-based pipelining
- Algorithm 679
- GotoBLAS
- BLIS
- When cache blocking of sparse matrix vector multiply works and why
- Finding least common ancestors in directed acyclic graphs
- A family of high-performance matrix multiplication algorithms
- Statistical models for automatic performance tuning
- Rescheduling for locality in sparse matrix computations
- BLIS: a framework for rapidly instantiating BLAS functionality
- Reliable generation of high-performance matrix algebra
- BLISlab
- Adaptive Winograd's matrix multiplications
- Knowledge discovery in auto-tuning parallel numerical library
- Parallel information retrieval with query expansion
- A recursive formulation of the inversion of symmetric positive definite matrices in packed storage data format
- Emmerald
- OProfile
- Algorithm 784
- SuperMatrix
- Algorithm 656
- ADAPT
- Accurate Symmetric Indefinite Linear Equation Solvers
- A Supernodal Approach to Sparse Partial Pivoting
- HPF and numerical libraries
- ESSL
- PMLP
- ScaLAPACK Users' Guide
- Optimizing the use of high performance software libraries
- An overview of cache optimization techniques and cache-aware numerical algorithms
- Bibliography of ``Algorithms for memory hierarchies. Advanced lectures
- Code generators for automatic tuning of numerical kernels: Experiences with FFTW (position paper)
- Towards automatic synthesis of high-performance codes for electronic structure calculations: Data locality optimization
- A characterization of temporal locality and its portability across memory hierarchies
- Towards performance evaluation of high-performance computing on multiple Java platforms
- Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Library Software
- An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
- Parallel and fully recursive multifrontal supernodal sparse Cholesky
- Heterogeneous networks of workstations and the parallel matrix multiplication
- Fractal matrix multiplication: A case study on portability of cache performance
- A framework for high-performance matrix multiplication based on hierarchical abstractions, algorithms and optimized low-level kernels
- Emmerald: a fast matrix–matrix multiply using Intel's SSE instructions
- Delayed evaluation, self-optimising software components as a programming model
- A modern framework for portable high-performance numerical linear algebra
- Optimization of algorithms with OPAL
- Analytical modeling is enough for high-performance BLIS
- A recursive formulation of Cholesky factorization of a matrix in packed storage
- Formal derivation of algorithms
- Design, implementation and testing of extended and mixed precision BLAS
- Lowest common ancestors in trees and directed acyclic graphs
- Hierarchical matrix-matrix multiplication based on multiprocessor tasks
- Large-Scale Scientific Computing
- Automated empirical optimizations of software and the ATLAS project
- GPTune
- An efficient time-step-based self-adaptive algorithm for predictor-corrector methods of Runge-Kutta type
- Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform
This page was built for software: PHiPAC