loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fourth Annual ACIS International Conference on Computer and Information Science (ICIS'05)
A General Scalable Parallelizing of Strassen?s Algorithm for Matrix Multiplication on Distributed Memory Computers
Jeju Island, South Korea
July 14-July 16
ISBN: 0-7695-2296-3
ASCII Text
x 
 
Duc Kien Nguyen, Ivan Lavallée, Marc Bui, Quoc Trung Ha, "A General Scalable Parallelizing of Strassen?s Algorithm for Matrix Multiplication on Distributed Memory Computers," Computer and Information Science, ACIS International Conference on, pp. 294-299, Fourth Annual ACIS International Conference on Computer and Information Science (ICIS'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/ICIS.2005.8,
author = {Duc Kien Nguyen and Ivan Lavallée and Marc Bui and Quoc Trung Ha},
title = {A General Scalable Parallelizing of Strassen?s Algorithm for Matrix Multiplication on Distributed Memory Computers},
journal ={Computer and Information Science, ACIS International Conference on},
volume = {0},
year = {2005},
isbn = {0-7695-2296-3},
pages = {294-299},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICIS.2005.8},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer and Information Science, ACIS International Conference on
TI - A General Scalable Parallelizing of Strassen?s Algorithm for Matrix Multiplication on Distributed Memory Computers
SN - 0-7695-2296-3
SP294
EP299
A1 - Duc Kien Nguyen,
A1 - Ivan Lavallée,
A1 - Marc Bui,
A1 - Quoc Trung Ha,
PY - 2005
KW - null
VL - 0
JA - Computer and Information Science, ACIS International Conference on
ER -
 
Duc Kien Nguyen, University of Paris 8
Ivan Lavallée, University of Paris 8
Marc Bui, University of Paris 8
Quoc Trung Ha, Hanoi University of Technology
Strassen?s algorithm to multiply two n ? n matrices reduces the asymptotic operation count from O(n3) of the traditional algorithm to O(n2.38), thus on distributed memory computers, the association of Strassen?s algorithm and the parallel matrix multiplication algorithms always gives remarkable results. Within this association, the application of Strassen?s algorithm at inter-processor level requires us to solve more difficult problems in designing but it forms the most effective algorithms. In this paper, a general model of these algorithms will be presented and we also introduce a scalable method to implement this model on distributed memory computers.
Citation:
Duc Kien Nguyen, Ivan Lavallée, Marc Bui, Quoc Trung Ha, "A General Scalable Parallelizing of Strassen?s Algorithm for Matrix Multiplication on Distributed Memory Computers," icis, pp.294-299, Fourth Annual ACIS International Conference on Computer and Information Science (ICIS'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.