Skip to main content
Article thumbnail
Location of Repository

Communication Lower Bounds for Programs that Access Arrays

By Nicholas Knight, Michael Christ, James Demmel, Thomas Scanlon and Katherine Yelick

Abstract

Communication means moving data Serial communication = moving data across memory hierarchy Parallel communication = moving data across networkCommunication is expensive! 2 Communication means moving data Serial communication = moving data across memory hierarchy Parallel communication = moving data across network Communication usually dominates runtime, energy cost ⇒ Avoid communication to save time and energy! 2 Communication is expensive! Communication means moving data Serial communication = moving data across memory hierarchy Parallel communication = moving data across network Communication usually dominates runtime, energy cost ⇒ Avoid communication to save time and energy! How much can you avoid? Lower bound on data movement2 Communication is expensive! Communication means moving data Serial communication = moving data across memory hierarchy Parallel communication = moving data across network Communication usually dominates runtime, energy cost ⇒ Avoid communication to save time and energy! How much can you avoid? Lower bound on data movement Attain lower bound ⇒ Communication-optimal algorithmOutline 1 Avoiding Communication in Linear Algebra Lower bounds for matrix multiplication...... attainable by blockin

Topics: A, B, C are N-b
Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.5236
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.berkeley.edu/~kn... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.