Author： Baransel Cesur
Publisher： Springer Publishing Company
ISSN： 0920-8542
Source： The Journal of Supercomputing, Vol.62, Iss.1, 2012-10, pp. : 486-509
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
A new parallel implementation of Strassen's matrix multiplication algorithm is proposed for massively parallel supercomputers with 2D, all-port torus interconnection networks. The proposed algorithm employs a special conflict-free routing pattern for better scalability and is able to yield a performance rate very close to the theoretical bound for many practical network and matrix sizes. It effectively scales up to very large networks typically containing hundreds-of-thousands processors where petaflop or exaflop processing rates are sought.
Related content
Buffer management in wormhole-routed torus multicomputer networks
Future Generation Computer Systems, Vol. 16, Iss. 5, 2000-03 ,pp. :
Access to resources
Recommend
