Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

IPPS
2008
IEEE

favoriteEmaildiscussreport

131views Distributed And Parallel Com...» more IPPS 2008»

Avoiding communication in sparse matrix computations

13 years 11 months ago

Avoiding communication in sparse matrix computations

Download bebop.cs.berkeley.edu

James Demmel, Mark Hoemmen, Marghoob Mohiyuddin, K

Real-time Traffic

Distributed And Parallel Computing | IPPS 2008 |

claim paper

Related Content

» Minimizing communication in sparse matrix solvers

» Challenges and Advances in Parallel Sparse MatrixMatrix Multiplication

» Ordering Unstructured Meshes for Sparse Matrix Computations on Leading Parallel Systems

» Sparse Matrix BlockCyclic Redistribution

» RunTime Optimization of Sparse MatrixVector Multiplication on SIMD Machines

» On the Scalability of Hypergraph Models for Sparse Matrix Partitioning

» Minimizing Communication Cost in FineGrain Partitioning of Sparse Matrices

» On TwoDimensional Sparse Matrix Partitioning Models Methods and a Recipe

» Parallel Solution of Irregular Sparse Matrix Problems Using High Performance Fortran

Post Info
More Details (n/a)

Added	31 May 2010
Updated	31 May 2010
Type	Conference
Year	2008
Where	IPPS
Authors	James Demmel, Mark Hoemmen, Marghoob Mohiyuddin, Katherine A. Yelick

Comments (0)