Communication Costs of Strassen’s Matrix Multiplication
Proving lower bounds on the communication of algorithms and finding algorithms that attain these bounds are fundamental goals.
James Demmel
Advertisement
Author Archives
A View of the Parallel Computing Landscape
Writing programs that scale with increasing numbers of cores should be as easy as writing programs for sequential computers. Here as a concrete example of a coordinated attack on the problem of parallelism.
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved