Improving the Communication Pattern in Matrix-Vector Operations for Large Scale-Free Graphs by Disaggregation

DOI10.1137/12088313XzbMath1280.05124MaRDI QIDQ2870705

Panayot S. Vassilevski, Verena Kuhlemann

Publication date: 21 January 2014

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

zbMATH Keywords

disaggregationparallel computationscale-free graphsLaplacian matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Parallel numerical computation (65Y05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

1.5D Parallel Sparse Matrix-Vector Multiply ⋮ Extending bootstrap AMG for clustering of attributed graphs ⋮ Modifying AMG Coarse Spaces with Weak Approximation Property to Exhibit Approximation in Energy Norm ⋮ Commuting projections on graphs

Uses Software

• SLEPc
• PETSc
• PT-Scotch
• Zoltan