English  |  正體中文  |  简体中文  |  Items with full text/Total items : 6491/11663
Visitors : 24649152      Online Users : 87
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item: http://ir.ncue.edu.tw/ir/handle/987654321/15815

Title: Parallelizing Strassen's Method for Matrix Multiplication on Distributed-Memory MIMD Architectures
Authors: Chou, Chung-Chiang;Deng, Y.;Li, G.;Wang, Y.
Contributors: 數學系
Keywords: Matrix multiplication;Parallel computation;Strassen's method
Date: 1995-07
Issue Date: 2013-03-12T04:07:54Z
Publisher: Pergamon Press
Abstract: 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.
Relation: Computers and Mathematics with Applications, 30(2): 49-69
Appears in Collections:[數學系] 期刊論文

Files in This Item:

File SizeFormat

All items in NCUEIR are protected by copyright, with all rights reserved.


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