Parallel Processing and Applied Mathematics

DOI10.1007/11752578zbMATH Open1182.65070OpenAlexW4300925407MaRDI QIDQ5899149FDOQ5899149

Authors: Christoph Zenger, Michael Bader 

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11752578

Recommendations

• Cache oblivious matrix multiplication using an element ordering based on a Peano curve
• A Cache-Oblivious Sparse Matrix–Vector Multiplication Scheme Based on the Hilbert Curve
• Cache oblivious sparse matrix multiplication
• Cache-Oblivious Sparse Matrix–Vector Multiplication by Using Sparse Matrix Partitioning Methods
• A Cache‐Aware Algorithm for PDEs on Hierarchical Data Structures Based on Space‐Filling Curves
• On the Limits of Cache-Oblivious Matrix Transposition
• Cache-Aided Matrix Multiplication Retrieval

Mathematics Subject Classification ID

Numerical algorithms for specific classes of architectures (65Y10)

Cited In (4)

• An empirical study of cache-oblivious polygon indecomposability testing
• A Cache‐Aware Algorithm for PDEs on Hierarchical Data Structures Based on Space‐Filling Curves
• A Cache-Oblivious Sparse Matrix–Vector Multiplication Scheme Based on the Hilbert Curve
• Cache oblivious matrix multiplication using an element ordering based on a Peano curve

Uses Software

• ATLAS

This page was built for publication: Parallel Processing and Applied Mathematics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899149)