English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 6507/11669
造訪人次 : 29621155      線上人數 : 291
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 進階搜尋

請使用永久網址來引用或連結此文件: http://ir.ncue.edu.tw/ir/handle/987654321/15815

題名: Parallelizing Strassen's Method for Matrix Multiplication on Distributed-Memory MIMD Architectures
作者: Chou, Chung-Chiang;Deng, Y.;Li, G.;Wang, Y.
貢獻者: 數學系
關鍵詞: Matrix multiplication;Parallel computation;Strassen's method
日期: 1995-07
上傳時間: 2013-03-12T04:07:54Z
出版者: Pergamon Press
摘要: We present a parallel method for matrix multiplication on distributed-memory MIMD architectures based on Strassen's method. Our timing tests, performed on a 56-node Intel Paragon, demonstrate the realization of the potential of the Strassen's method with a complexity of 4.7 M2.807 at the system level rather than the node level at which several earlier works have been focused. The parallel efficiency is nearly perfect when the processor number is the power of 7. The parallelized Strassen's method seems always faster than the traditional matrix multiplication methods whose complexity is 2M3 coupled with the BMR method and the Ring method at the system level. The speed gain depends on matrix order M: 20% for M ≈ 1000 and more than 100% for M ≈ 5000.
關聯: Computers and Mathematics with Applications, 30(2): 49-69
顯示於類別:[數學系] 期刊論文

文件中的檔案:

檔案 大小格式瀏覽次數
index.html0KbHTML606檢視/開啟


在NCUEIR中所有的資料項目都受到原著作權保護.

 


DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋