CORE
πΊπ¦Β
Β make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
slides
Graph Expansion and Communication Costs of Fast Matrix Multiplication
Authors
Grey Ballard
James Demmel
Olga Holtz
Oded Schwartz
Publication date
1 January 2011
Publisher
'Association for Computing Machinery (ACM)'
Doi
Cite
View
on
arXiv
Abstract
The communication cost of algorithms (also known as I/O-complexity) is shown to be closely related to the expansion properties of the corresponding computation graphs. We demonstrate this on Strassen's and other fast matrix multiplication algorithms, and obtain first lower bounds on their communication costs. In the sequential case, where the processor has a fast memory of size
M
M
M
, too small to store three
n
n
n
-by-
n
n
n
matrices, the lower bound on the number of words moved between fast and slow memory is, for many of the matrix multiplication algorithms,
Ξ©
(
(
n
M
)
Ο
0
β
M
)
\Omega((\frac{n}{\sqrt M})^{\omega_0}\cdot M)
Ξ©
((
M
β
n
β
)
Ο
0
β
β
M
)
, where
Ο
0
\omega_0
Ο
0
β
is the exponent in the arithmetic count (e.g.,
Ο
0
=
lg
β‘
7
\omega_0 = \lg 7
Ο
0
β
=
l
g
7
for Strassen, and
Ο
0
=
3
\omega_0 = 3
Ο
0
β
=
3
for conventional matrix multiplication). With
p
p
p
parallel processors, each with fast memory of size
M
M
M
, the lower bound is
p
p
p
times smaller. These bounds are attainable both for sequential and for parallel algorithms and hence optimal. These bounds can also be attained by many fast algorithms in linear algebra (e.g., algorithms for LU, QR, and solving the Sylvester equation)
Similar works
Full text
Available Versions
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
Last time updated on 01/04/2019
CiteSeerX
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:CiteSeerX.psu:10.1.1.765.2...
Last time updated on 30/10/2017