FRSZ2 for In-Register Block Compression Inside GMRES on GPUs
Fuente:
arXiv
Saved in:
| Main Authors: | Grützmacher, Thomas, Underwood, Robert, Di, Sheng, Cappello, Franck, Anzt, Hartwig |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Toward Greener Matrix Operations by Lossless Compressed Formats
by: Tosoni, Francesco, et al.
Published: (2024)
by: Tosoni, Francesco, et al.
Published: (2024)
Accurate and Fast Approximate Graph Pattern Mining at Scale
by: Arpaci-Dusseau, Anna, et al.
Published: (2024)
by: Arpaci-Dusseau, Anna, et al.
Published: (2024)
Count-Min Sketch with Conservative Updates: Worst-Case Analysis
by: Mazziane, Younes Ben, et al.
Published: (2024)
by: Mazziane, Younes Ben, et al.
Published: (2024)
Elastic Sketch under Random Stationary Streams: Limiting Behavior and Near-Optimal Configuration
by: Mazziane, Younes Ben, et al.
Published: (2026)
by: Mazziane, Younes Ben, et al.
Published: (2026)
Virtual-Memory Powersort
by: Moltmann, Finn, et al.
Published: (2026)
by: Moltmann, Finn, et al.
Published: (2026)
Less is More: Faster Maximum Clique Search by Work-Avoidance
by: Vandierendonck, Hans
Published: (2025)
by: Vandierendonck, Hans
Published: (2025)
Permutation-Avoiding FFT-Based Convolution
by: Venkovic, Nicolas, et al.
Published: (2025)
by: Venkovic, Nicolas, et al.
Published: (2025)
CAMP: A Cost Adaptive Multi-Queue Eviction Policy for Key-Value Stores
by: Ghandeharizadeh, Shahram, et al.
Published: (2024)
by: Ghandeharizadeh, Shahram, et al.
Published: (2024)
FB$^+$-tree: A Memory-Optimized B$^+$-tree with Latch-Free Update
by: Chen, Yuan, et al.
Published: (2025)
by: Chen, Yuan, et al.
Published: (2025)
PHast -- Perfect Hashing made fast
by: Beling, Piotr, et al.
Published: (2025)
by: Beling, Piotr, et al.
Published: (2025)
Adaptive Hybrid Sort: Dynamic Strategy Selection for Optimal Sorting Across Diverse Data Distributions
by: Balasubramanian, Shrinivass Arunachalam
Published: (2025)
by: Balasubramanian, Shrinivass Arunachalam
Published: (2025)
CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers
by: Wheatman, Brian, et al.
Published: (2023)
by: Wheatman, Brian, et al.
Published: (2023)
Cheesemap: A High-Performance Point-Indexing Data Structure for Neighbor Search in LiDAR Data
by: Laso, Ruben, et al.
Published: (2025)
by: Laso, Ruben, et al.
Published: (2025)
bsort: A theoretically efficient non-comparison-based sorting algorithm for integer and floating-point numbers
by: Guzmán, Benjamín
Published: (2026)
by: Guzmán, Benjamín
Published: (2026)
Revisiting Forest Proximities via Sparse Leaf-Incidence Kernels
by: Aumon, Adrien, et al.
Published: (2026)
by: Aumon, Adrien, et al.
Published: (2026)
Diagonally-Addressed Matrix Nicknack: How to improve SpMV performance
by: Saak, Jens, et al.
Published: (2023)
by: Saak, Jens, et al.
Published: (2023)
RSR-core: A High-Performance Engine for Low-Bit Matrix-Vector Multiplication
by: Dehghankar, Mohsen, et al.
Published: (2026)
by: Dehghankar, Mohsen, et al.
Published: (2026)
The Transient Cost of Learning in Queueing Systems
by: Freund, Daniel, et al.
Published: (2023)
by: Freund, Daniel, et al.
Published: (2023)
Outperforming Dijkstra on Sparse Graphs: The Lightning Network Use Case
by: Valko, Danila, et al.
Published: (2025)
by: Valko, Danila, et al.
Published: (2025)
On the Fair Comparison of Optimization Algorithms in Different Machines
by: Arza, Etor, et al.
Published: (2023)
by: Arza, Etor, et al.
Published: (2023)
Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks
by: Ferreira, Miguel, et al.
Published: (2025)
by: Ferreira, Miguel, et al.
Published: (2025)
Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search
by: Azizi, Ilias, et al.
Published: (2025)
by: Azizi, Ilias, et al.
Published: (2025)
Don't Persist All : Efficient Persistent Data Structures
by: Mahapatra, Pratyush, et al.
Published: (2019)
by: Mahapatra, Pratyush, et al.
Published: (2019)
QR factorization of ill-conditioned tall-and-skinny matrices on distributed-memory systems
by: Mijić, Nenad, et al.
Published: (2024)
by: Mijić, Nenad, et al.
Published: (2024)
DGAP: Efficient Dynamic Graph Analysis on Persistent Memory
by: Islam, Abdullah Al Raqibul, et al.
Published: (2024)
by: Islam, Abdullah Al Raqibul, et al.
Published: (2024)
Accelerating Sparse Tensor Decomposition Using Adaptive Linearized Representation
by: Laukemann, Jan, et al.
Published: (2024)
by: Laukemann, Jan, et al.
Published: (2024)
VMT19937: A SIMD-Friendly Pseudo Random Number Generator based on Mersenne Twister 19937
by: Cannizzo, Fabio
Published: (2023)
by: Cannizzo, Fabio
Published: (2023)
TC-MIS: Maximal Independent Set on Tensor-cores
by: Nijhara, Prajjwal, et al.
Published: (2026)
by: Nijhara, Prajjwal, et al.
Published: (2026)
Competitive Online Optimization under Inventory Constraints
by: Lin, Qiulin, et al.
Published: (2019)
by: Lin, Qiulin, et al.
Published: (2019)
No Cords Attached: Coordination-Free Concurrent Lock-Free Queues
by: Motiwala, Yusuf
Published: (2025)
by: Motiwala, Yusuf
Published: (2025)
Concurrent Deterministic Skiplist and Other Data Structures
by: Sasidharan, Aparna
Published: (2023)
by: Sasidharan, Aparna
Published: (2023)
Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues
by: Williams, Marvin, et al.
Published: (2025)
by: Williams, Marvin, et al.
Published: (2025)
Parallel $k$d-tree with Batch Updates
by: Men, Ziyang, et al.
Published: (2024)
by: Men, Ziyang, et al.
Published: (2024)
Setchain Algorithms for Blockchain Scalability
by: Karmegam, Arivarasan, et al.
Published: (2025)
by: Karmegam, Arivarasan, et al.
Published: (2025)
Practical Parallel Block Tree Construction: First Results
by: Clausecker, Robert, et al.
Published: (2025)
by: Clausecker, Robert, et al.
Published: (2025)
Block Coordinate Descent Methods for Optimization under J-Orthogonality Constraints with Applications
by: He, Di, et al.
Published: (2024)
by: He, Di, et al.
Published: (2024)
HashEvict: A Pre-Attention KV Cache Eviction Strategy using Locality-Sensitive Hashing
by: Liu, Minghui, et al.
Published: (2024)
by: Liu, Minghui, et al.
Published: (2024)
On Optimizing Locality of Graph Transposition on Modern Architectures
by: Esfahani, Mohsen Koohi, et al.
Published: (2025)
by: Esfahani, Mohsen Koohi, et al.
Published: (2025)
Restructuring expression dags for efficient parallelization
by: Wilhelm, Martin
Published: (2018)
by: Wilhelm, Martin
Published: (2018)
Safe Memory Reclamation Techniques
by: Singh, Ajay
Published: (2025)
by: Singh, Ajay
Published: (2025)
Similar Items
-
Toward Greener Matrix Operations by Lossless Compressed Formats
by: Tosoni, Francesco, et al.
Published: (2024) -
Accurate and Fast Approximate Graph Pattern Mining at Scale
by: Arpaci-Dusseau, Anna, et al.
Published: (2024) -
Count-Min Sketch with Conservative Updates: Worst-Case Analysis
by: Mazziane, Younes Ben, et al.
Published: (2024) -
Elastic Sketch under Random Stationary Streams: Limiting Behavior and Near-Optimal Configuration
by: Mazziane, Younes Ben, et al.
Published: (2026) -
Virtual-Memory Powersort
by: Moltmann, Finn, et al.
Published: (2026)