fast sequential algorithms

IPPS
1998
IEEE

96views Distributed And Parallel Com...» more IPPS 1998»

Caching-Efficient Multithreaded Fast Multiplication of Sparse Matrices

14 years 3 months ago

Several fast sequential algorithms have been proposed in the past to multiply sparse matrices. These algorithms do not explicitlyaddresstheimpactofcachingonperformance. We show th...

Peter Sulatycke, Kanad Ghose

claim paper

Read More »

click to vote

IPPS
1999
IEEE

137views Distributed And Parallel Com...» more IPPS 1999»

Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System

14 years 3 months ago

Download ipdps.cc.gatech.edu

The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity ON , where 2 3. The current best value of is less than 2.3755....

Keqin Li, Victor Y. Pan

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers