Sciweavers

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

13

SC
2009
ACM

favoriteEmaildiscussreport

234views Applied Computing» more SC 2009»

Minimizing communication in sparse matrix solvers

13 years 11 months ago

Minimizing communication in sparse matrix solvers

Download bebop.cs.berkeley.edu

Marghoob Mohiyuddin, Mark Hoemmen, James Demmel, K

Real-time Traffic

Applied Computing | SC 2009 |

claim paper

Related Content

» RunTime Optimization of Sparse MatrixVector Multiplication on SIMD Machines

» Minimizing Communication Cost in FineGrain Partitioning of Sparse Matrices

» Sparse MatrixVector Multiplication Design on FPGAs

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

» CoarseGrained Parallel MatrixFree Solution of a ThreeDimensional Elliptic Prototype Proble...

» TaskQueue Based Hybrid Parallelism A Case Study

» Improved MFOCUSS Algorithm With Overlapping Blocks for Locally Smooth Sparse Signals

» Fixedrank representation for unsupervised visual learning

» Multiple Target Localization Using Compressive Sensing

Post Info
More Details (n/a)

Added	19 May 2010
Updated	19 May 2010
Type	Conference
Year	2009
Where	SC
Authors	Marghoob Mohiyuddin, Mark Hoemmen, James Demmel, Katherine A. Yelick

Comments (0)