Back to Results
First PageMeta Content
Group theory / Abelian group / Niels Henrik Abel / Finitely-generated abelian group / Torsion / Matrix / Vector space / Abstract algebra / Algebra / Mathematics


Communication Lower Bounds and Optimal Algorithms for Programs That Reference Arrays — Part 1 (REVISED∗) Michael Christ†, James Demmel‡, Nicholas Knight§, Thomas Scanlon¶, and Katherine Yelickk September 3, 201
Add to Reading List

Document Date: 2013-09-03 21:02:11

Open Document

File Size: 699,23 KB

Share Result on Facebook

City

Toledo / Tiskin / /

Company

Tj / HBL / Gj / /

/

IndustryTerm

faster algorithms / rational solution / positive solution / communication-optimal sequential algorithms / less energy / body algorithm / parallel algorithm / blocked algorithm / matrix algorithms / direct linear algebra algorithms / finite / parallel processors / graph algorithms / linear algebra algorithms / communication-optimal sequential algorithm / energy / /

Organization

Univ. of California / /

Person

Thomas Scanlon / Katherine Yelickk / Lawrence Berkeley Natl / James Demmel / Berkeley Berkeley / Nicholas Knight / Michael Christ / /

Position

Prime Minister / /

Product

M-16 / /

ProgrammingLanguage

EC / C / /

ProvinceOrState

California / /

Technology

graph algorithms / body algorithm / one processor / linear algebra algorithms / direct N-body algorithm / 1 Introduction Algorithms / direct linear algebra algorithms / matrix algorithms / parallel algorithm / asymptotically faster algorithms / pdf / /

URL

http /

SocialTag