A New Direction to Parallelize Winograd’s Algorithm on Distributed Memory Computers
D. K. Nguyen (),
I. Lavallee () and
M. Bui ()
Additional contact information
D. K. Nguyen: CHArt - Ecole Pratique des Hautes Etudes & Université Paris 8
I. Lavallee: LaISC - Ecole Pratique des Hautes Etudes
M. Bui: LaISC - Ecole Pratique des Hautes Etudes
A chapter in Modeling, Simulation and Optimization of Complex Processes, 2008, pp 445-457 from Springer
Abstract:
Abstract Winograd’s algorithm to multiply two n × n matrices reduces the asymptotic operation count from O(n 3) of the traditional algorithm to O(n 2.81), hence on distributed memory computers, the combination of Winograd’s algorithm and the parallel matrix multiplication algorithms always gives remarkable results. Within this combination, the application of Winograd’s algorithm at the inter-processor level requires us to solve more difficult problems but it leads to more effective algorithms. In this paper, a general formulation of these algorithms will be presented. We also introduce a scalable method to implement these algorithms on distributed memory computers. This work also opens a new direction to parallelize Winograd’s algorithm based on the generalization of Winograd’s formula for the case where the matrices are partitioned into 2 k parts (the case k = 2 gives us the original formula).
Date: 2008
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-79409-7_31
Ordering information: This item can be ordered from
http://www.springer.com/9783540794097
DOI: 10.1007/978-3-540-79409-7_31
Access Statistics for this chapter
More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().