Sciweavers

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

6

CLUSTER
2006
IEEE

favoriteEmaildiscussreport

127views Distributed And Parallel Com...» more CLUSTER 2006»

Matrix Multiplication on Two Interconnected Processors

13 years 10 months ago

Matrix Multiplication on Two Interconnected Processors

Download www.csi.ucd.ie

This paper presents a new partitioning algorithm to perform matrix multiplication on two interconnected heterogeneous processors. Data is partitioned in a way which minimizes the total volume of communication between the processors compared to more general partitionings, resulting in a lower total execution time whenever the power ratio between the processors is

Brett A. Becker, Alexey L. Lastovetsky

Real-time Traffic

CLUSTER 2006 | Cluster Computing | Interconnected Heterogeneous Processors | Lower Total Execution | Matrix Multiplication |

claim paper

Related Content

» A SelfReconfigurable Lightweight Interconnect for Scalable Processor Fabrics

» TwoDimensional Matrix Partitioning for Parallel Computing on Heterogeneous Processors Base...

» Experimental Study of Six Different Implementations of Parallel Matrix Multiplication on H...

» Bit matrix multiplication in commodity processors

» On TwoDimensional Sparse Matrix Partitioning Models Methods and a Recipe

» A Fast Scalable Universal Matrix Multiplication Algorithm on DistributedMemory Concurrent ...

» Reconfigurable Sparse MatrixVector Multiplication on FPGAs

» Scalable Parallel Matrix Multiplication on Distributed Memory Parallel Computers

» A new parallel matrix multiplication algorithm on distributedmemory concurrent computers

Post Info
More Details (n/a)

Added	10 Jun 2010
Updated	10 Jun 2010
Type	Conference
Year	2006
Where	CLUSTER
Authors	Brett A. Becker, Alexey L. Lastovetsky

Comments (0)