On the representation and multiplication of hypersparse matrices

No abstract is available for this paper.

• Publication year

  2008

• Venue

  2008 IEEE International Symposium on Parallel and Distributed Processing

• Publication date

  2008-04-14

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/IPDPS.2008.4536313
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model

  2007cited by this paper
• Efficient MATLAB Computations with Sparse and Factored Tensors

  2007influential reference
• Random web crawls

  2007cited by this paper
• Random graphs

  2006cited by this paper
• Direct methods for sparse linear systems

  2006cited by this paper
• Colored intersection searching via sparse rectangular matrix multiplication

  2006cited by this paper
• Parallel Processing Letters ❢c World Scientific Publishing Company CHALLENGES IN PARALLEL GRAPH PROCESSING

  2006cited by this paper
• Efficient transitive closure of sparse matrices over closed semirings

  2006cited by this paper
• A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L

  2005cited by this paper
• Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication

  2005cited by this paper
• Detecting short directed cycles using rectangular matrix multiplication and dynamic programming

  2004cited by this paper
• Fast sparse matrix multiplication

  2004cited by this paper
• An overview of the sparse basic linear algebra subprograms: The new standard from the BLAS technical forum

  2002cited by this paper
• All pairs shortest paths using bridging sets and rectangular matrix multiplication

  2000cited by this paper
• Fast priority queues for cached memory

  1999cited by this paper
• Caching-efficient multithreaded fast multiplication of sparse matrices

  1998cited by this paper
• The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition

  1997cited by this paper
• Aspect-Oriented Programming of Sparse Matrix Code

  1997cited by this paper
• The art of computer programming: V.1.: Fundamental algorithms

  1997cited by this paper
• Geometric mesh partitioning: implementation and experiments

  1995cited by this paper
• SUMMA: scalable universal matrix multiplication algorithm

  1995influential reference
• On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs

  1995cited by this paper
• Sparse Matrices in MATLAB: Design and Implementation

  1992influential reference
• Fast sparse matrix multiplication

  1992cited by this paper
• Maximum Matchings in General Graphs Through Randomization

  1989cited by this paper
• Minimum-Cost Spanning Tree as a Path-Finding Problem

  1988cited by this paper
• Matrix multiplication via arithmetic progressions

  1987cited by this paper
• The art of computer programming

  1983cited by this paper
• A Unified Approach to Path Problems

  1981cited by this paper
• Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition

  1978cited by this paper
• The Design and Analysis of Computer Algorithms

  1974cited by this paper

• Swift: High-Performance Sparse-Dense Matrix Multiplication on GPUs

  2026cites this paper
• Magellan: A High-Performance Loop-Guided Prefetcher for Indirect Memory Access

  2025cites this paper
• GraphCSR: A Space and Time-Efficient Sparse Matrix Representation for Web-scale Graph Processing

  2025influential citation
• SRSparse: Generating Codes for High-Performance Sparse Matrix-Vector Semiring Computations

  2025cites this paper
• SANST: Sensing Anonymized Network via Sorted Triplets

  2025cites this paper
• LiteForm: Lightweight and Automatic Format Composition for Sparse Matrix-Matrix Multiplication on GPUs

  2025cites this paper
• A tensor-based approach to Dempster-Shafer computing for evidence combination

  2025cites this paper
• Modular Construction and Optimization of the UZP Sparse Format for SpMV on CPUs

  2025cites this paper
• Insum: Sparse GPU Kernels Simplified and Optimized with Indirect Einsums

  2025cites this paper
• GraphCSR: A Degree-Equalized CSR Format for Large-scale Graph Processing

  2025influential citation
• CB-SpMV:A Data Aggregating and Balance Algorithm for for Cache-Friendly Block-Based SpMV on GPUs

  2025cites this paper
• Distributed-memory Algorithms for Sparse Matrix Permutation, Extraction, and Assignment

  2025cites this paper
• Tomofast-x 2.0: an open-source parallel code for inversion of potential field data with topography using wavelet compression

  2024cites this paper
• UniSparse: An Intermediate Language for General Sparse Format Customization

  2024cites this paper
• FSpGEMM: A Framework for Accelerating Sparse General Matrix–Matrix Multiplication Using Gustavson’s Algorithm on FPGAs

  2024cites this paper
• AmgT: Algebraic Multigrid Solver on Tensor Cores

  2024cites this paper
• FastLoad: Speeding Up Data Loading of Both Sparse Matrix and Vector for SpMV on GPUs

  2024cites this paper
• SuperCSR: A Space-Time-Efficient CSR Representation for Large-scale Graph Applications on Supercomputers

  2024influential citation
• Optimization of Sparse Matrix Computation for Algebraic Multigrid on GPUs

  2024cites this paper
• On Efficient Large Sparse Matrix Chain Multiplication

  2024cites this paper
• Predicting optimal sparse general matrix-matrix multiplication algorithm on GPUs

  2024cites this paper
• HAM-SpMSpV: an Optimized Parallel Algorithm for Masked Sparse Matrix-Sparse Vector Multiplications on multi-core CPUs

  2024cites this paper
• A Sparsity-Aware Distributed-Memory Algorithm for Sparse-Sparse Matrix Multiplication

  2024cites this paper
• Batch Updates of Distributed Streaming Graphs using Linear Algebra

  2024cites this paper
• Compilation of Modular and General Sparse Workspaces

  2024cites this paper
• Doubling Graph Traversal Efficiency to 198 TeraTEPS on the Supercomputer Fugaku

  2024cites this paper
• Distributed-Memory Parallel Algorithms for Sparse Matrix and Sparse Tall-and-Skinny Matrix Multiplication

  2024cites this paper
• GraphService: Topology-aware Constructor for Large-scale Graph Applications

  2024cites this paper
• A parallel viscoplastic multiscale reservoir geomechanics simulator

  2023cites this paper
• Algorithm 1037: SuiteSparse:GraphBLAS: Parallel Graph Algorithms in the Language of Sparse Linear Algebra

  2023cites this paper
• ClipSim: A GPU-friendly Parallel Framework for Single-Source SimRank with Accuracy Guarantee

  2023cites this paper
• Multi-Mode SpMV Accelerator for Transprecision PageRank With Real-World Graphs

  2023cites this paper
• A Tensor Marshaling Unit for Sparse Tensor Algebra on General-Purpose Processors

  2023cites this paper
• Accelerating Unstructured SpGEMM using Structured In-situ Computing

  2023cites this paper
• HASpGEMM: Heterogeneity-Aware Sparse General Matrix-Matrix Multiplication on Modern Asymmetric Multicore Processors

  2023cites this paper
• Symphony: Orchestrating Sparse and Dense Tensors with Hierarchical Heterogeneous Processing

  2023cites this paper
• ASA: Accelerating Sparse Accumulation in Column-wise SpGEMM

  2022influential citation
• Distributed-Memory Parallel Contig Generation for De Novo Long-Read Genome Assembly

  2022cites this paper
• Extreme-Scale Many-against-Many Protein Similarity Search

  2022cites this paper
• Autoscheduling for sparse tensor algebra with an asymptotic cost model

  2022cites this paper
• täkō: a polymorphic cache hierarchy for general-purpose optimization of data movement

  2022cites this paper
• SparseTIR: Composable Abstractions for Sparse Compilation in Deep Learning

  2022cites this paper
• GreenBFS: Space-Efficient BFS Engine for Power-aware Graph Processing

  2022influential citation
• Analyzing Multi-trillion Edge Graphs on Large GPU Clusters: A Case Study with PageRank

  2022influential citation
• TileSpGEMM: a tiled algorithm for parallel sparse general matrix-matrix multiplication on GPUs

  2022cites this paper
• Towards Real-Time Temporal Graph Learning

  2022cites this paper
• Fast Dynamic Updates and Dynamic SpGEMM on MPI-Distributed Graphs

  2022cites this paper
• Compiler Support for Sparse Tensor Computations in MLIR

  2022influential citation
• Polyhedral Specification and Code Generation of Sparse Tensor Contraction with Co-iteration

  2022cites this paper
• Sparse tensor storage by tensor unfolding

  2022cites this paper
• pylspack: Parallel Algorithms and Data Structures for Sketching, Column Subset Selection, Regression, and Leverage Scores

  2022cites this paper
• M3FPU: Multiformat Matrix Multiplication FPU Architectures for Neural Network Computations

  2022cites this paper
• A High-Performance Sparse Tensor Algebra Compiler in Multi-Level IR

  2021cites this paper
• Distributed-memory parallel algorithms for sparse times tall-skinny-dense matrix multiplication

  2021cites this paper
• SPbLA: The Library of GPGPU-Powered Sparse Boolean Linear Algebra Operations

  2021cites this paper
• Hybrid parallel iterative sparse linear solver framework for reservoir geomechanical and flow simulation

  2021cites this paper
• SPA-GCN: Efficient and Flexible GCN Accelerator with Application for Graph Similarity Computation

  2021cites this paper
• Combinatorial BLAS 2.0: Scaling Combinatorial Algorithms on Distributed-Memory Systems

  2021cites this paper
• NDS: N-Dimensional Storage

  2021cites this paper
• Mathematics of Digital Hyperspace

  2021cites this paper
• Parallel Algorithms for Masked Sparse Matrix-Matrix Products

  2021influential citation
• LAGraph: Linear Algebra, Network Analysis Libraries, and the Study of Graph Algorithms

  2021cites this paper
• An Asymptotic Cost Model for Autoscheduling Sparse Tensor Programs

  2021cites this paper
• Accelerating Clique Counting in Sparse Real-World Graphs via Communication-Reducing Optimizations

  2021cites this paper
• SortCache

  2021cites this paper
• Learning Sparse Matrix Row Permutations for Efficient SpMM on GPU Architectures

  2021influential citation
• Streaming Sparse Graphs using Efficient Dynamic Sets

  2021cites this paper
• Vertical, Temporal, and Horizontal Scaling of Hierarchical Hypersparse GraphBLAS Matrices

  2021cites this paper
• Reducing Communication in Graph Neural Network Training

  2020cites this paper
• Sparse Tensor Transpositions

  2020cites this paper
• Performance Evaluation of Algorithms for Sparse-Dense Matrix Product

  2020cites this paper
• On Optimal Partitioning For Sparse Matrices In Variable Block Row Format

  2020influential citation
• Automatic generation of efficient sparse tensor format conversion routines

  2020cites this paper
• Graphite

  2020cites this paper
• Parallel GraphBLAS with OpenMP

  2020cites this paper
• Synergistic CPU-FPGA Acceleration of Sparse Linear Algebra

  2020cites this paper
• Hardware Acceleration of Sparse and Irregular Tensor Computations of ML Models: A Survey and Insights

  2020cites this paper
• Efficient Processing of Deep Neural Networks

  2020cites this paper
• Optimizing High Performance Markov Clustering for Pre-Exascale Architectures

  2020cites this paper
• Accelerating Distributed Inference of Sparse Deep Neural Networks via Mitigating the Straggler Effect

  2020cites this paper
• A Systematic Survey of General Sparse Matrix-matrix Multiplication

  2020cites this paper
• Parallel String Graph Construction and Transitive Reduction for De Novo Genome Assembly

  2020cites this paper
• Computing PageRank Scores of Web Crawl Data Using DGX A100 Clusters

  2020cites this paper
• Studying the Effects of Hashing of Sparse Deep Neural Networks on Data and Model Parallelisms

  2020cites this paper
• Bandwidth Optimized Parallel Algorithms for Sparse Matrix-Matrix Multiplication using Propagation Blocking

  2020cites this paper
• Distributed Many-to-Many Protein Sequence Alignment using Sparse Matrices

  2020cites this paper
• Efficient Block Algorithms for Parallel Sparse Triangular Solve

  2020cites this paper
• Empowering big data analytics with polystore and strongly typed functional queries

  2020cites this paper
• Efficient implementation of sparse matrix-sparse vector multiplication for large scale graph analytics

  2019influential citation
• Distributed-memory tensor completion for generalized loss functions in python using new sparse tensor kernels

  2019influential citation
• Transactions on Large-Scale Data- and Knowledge-Centered Systems XLII

  2019cites this paper
• Polystore and Tensor Data Model for Logical Data Independence and Impedance Mismatch in Big Data Analytics

  2019cites this paper
• Write Quick, Run Fast: Sparse Deep Neural Network in 20 Minutes of Development Time via SuiteSparse:GraphBLAS

  2019cites this paper
• Efficient SpMV Operation for Large and Highly Sparse Matrices using Scalable Multi-way Merge Parallelization

  2019cites this paper
• LAGraph: A Community Effort to Collect Graph Algorithms Built on Top of the GraphBLAS

  2019cites this paper
• A Linear Solver Framework for Flow and Geomechanics Reservoir Simulation

  2019influential citation
• Load-Balanced Sparse MTTKRP on GPUs

  2019cites this paper
• Batched Sparse Matrix Multiplication for Accelerating Graph Convolutional Networks

  2019cites this paper
• Multithreaded Layer-wise Training of Sparse Deep Neural Networks using Compressed Sparse Column

  2019cites this paper
• Matrix Algebra Framework for Portable, Scalable and Efficient Query Engines for RDF Graphs

  2019cites this paper