Cache oblivious matrix multiplication using an element ordering based on a Peano curve
From MaRDI portal
Publication:2502879
Recommendations
Cites work
- A Cache‐Aware Algorithm for PDEs on Hierarchical Data Structures Based on Space‐Filling Curves
- Automated empirical optimizations of software and the ATLAS project
- Basic Linear Algebra Subprograms for Fortran Usage
- Cache-oblivious algorithms
- scientific article; zbMATH DE number 3154226 (Why is no real title available?)
- Parallel Processing and Applied Mathematics
Cited in
(10)- A comparative study of fractal dimension calculation methods for rough surface profiles
- A Cache-Oblivious Sparse Matrix–Vector Multiplication Scheme Based on the Hilbert Curve
- Partitioned simulation of fluid-structure interaction on Cartesian grids
- On the Limits of Cache-Oblivious Matrix Transposition
- scientific article; zbMATH DE number 1857504 (Why is no real title available?)
- Cache-Aided Matrix Multiplication Retrieval
- A memetic algorithm to schedule planned maintenance for the national grid
- Computational Science - ICCS 2004
- Parallel Processing and Applied Mathematics
- Cache-oblivious Hilbert curve-based blocking scheme for matrix transposition
This page was built for publication: Cache oblivious matrix multiplication using an element ordering based on a Peano curve
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2502879)