ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2010.08526
  4. Cited By
Communication-Avoiding and Memory-Constrained Sparse Matrix-Matrix
  Multiplication at Extreme Scale

Communication-Avoiding and Memory-Constrained Sparse Matrix-Matrix Multiplication at Extreme Scale

16 October 2020
Md Taufique Hussain
Oguz Selvitopi
A. Buluç
A. Azad
    MoE
ArXivPDFHTML

Papers citing "Communication-Avoiding and Memory-Constrained Sparse Matrix-Matrix Multiplication at Extreme Scale"

4 / 4 papers shown
Title
Optimization of SpGEMM with Risc-V vector instructions
Optimization of SpGEMM with Risc-V vector instructions
Valentin Le Fèvre
Marc Casas
18
0
0
04 Mar 2023
Extreme-scale many-against-many protein similarity search
Extreme-scale many-against-many protein similarity search
Oguz Selvitopi
S. Ekanayake
Giulia Guidi
M. Awan
Georgios A. Pavlopoulos
A. Azad
N. Kyrpides
L. Oliker
Katherine Yelick
A. Buluç
11
6
0
03 Mar 2023
Combinatorial BLAS 2.0: Scaling combinatorial algorithms on
  distributed-memory systems
Combinatorial BLAS 2.0: Scaling combinatorial algorithms on distributed-memory systems
A. Azad
Oguz Selvitopi
Md Taufique Hussain
J. Gilbert
A. Buluç
27
26
0
28 Jun 2021
Scaling betweenness centrality using communication-efficient sparse
  matrix multiplication
Scaling betweenness centrality using communication-efficient sparse matrix multiplication
Edgar Solomonik
Maciej Besta
Flavio Vella
Torsten Hoefler
51
77
0
22 Sep 2016
1