loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-Assembling Wireless Networks (SNPD/SAWN'05)
A General Scalable Implementation of Fast Matrix Multiplication Algorithms on Distributed Memory Computers
Towson University, Towson, Maryland, USA
May 23-May 25
ISBN: 0-7695-2294-7
ASCII Text
x 
 
Duc Kien Nguyen, Ivan Lavall?, Marc Bui, Quoc Trung Ha, "A General Scalable Implementation of Fast Matrix Multiplication Algorithms on Distributed Memory Computers," Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, International Conference on & Self-Assembling Wireless Networks, International Workshop on, pp. 116-122, Sixth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-Assembling Wireless Networks (SNPD/SAWN'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/SNPD-SAWN.2005.2,
author = {Duc Kien Nguyen and Ivan Lavall? and Marc Bui and Quoc Trung Ha},
title = {A General Scalable Implementation of Fast Matrix Multiplication Algorithms on Distributed Memory Computers},
journal ={Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, International Conference on & Self-Assembling Wireless Networks, International Workshop on},
volume = {0},
year = {2005},
isbn = {0-7695-2294-7},
pages = {116-122},
doi = {http://doi.ieeecomputersociety.org/10.1109/SNPD-SAWN.2005.2},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, International Conference on & Self-Assembling Wireless Networks, International Workshop on
TI - A General Scalable Implementation of Fast Matrix Multiplication Algorithms on Distributed Memory Computers
SN - 0-7695-2294-7
SP116
EP122
A1 - Duc Kien Nguyen,
A1 - Ivan Lavall?,
A1 - Marc Bui,
A1 - Quoc Trung Ha,
PY - 2005
KW - null
VL - 0
JA - Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, International Conference on & Self-Assembling Wireless Networks, International Workshop on
ER -
 
Duc Kien Nguyen, University of Paris 8
Ivan Lavall?, University of Paris 8
Marc Bui, University of Paris 8
Quoc Trung Ha, Hanoi University of Technology
Fast matrix multiplication (FMM) algorithms to multiply two n ? n matrices reduce the asymptotic operation count from O(n^3) of the traditional algorithm to O(n^2.38), thus on distributed memory computers, the association of FMM algorithms and the parallel matrix multiplication algorithms always gives remarkable results. Within this association, the application of FMM algorithms at interprocessor 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?, Marc Bui, Quoc Trung Ha, "A General Scalable Implementation of Fast Matrix Multiplication Algorithms on Distributed Memory Computers," snpd-sawn, pp.116-122, Sixth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-Assembling Wireless Networks (SNPD/SAWN'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.