Skip to main content
Article thumbnail
Location of Repository

Perfect Strong Scaling Using No Additional Energy

By James Demmel, Andrew Gearhart, Benjamin Lipshitz and Oded Schwartz

Abstract

Abstract—Energy efficiency of computing devices has become a dominant area of research interest in recent years. Most previous work has focused on architectural techniques to improve power and energy efficiency; only a few consider saving energy at the algorithmic level. We prove that a region of perfect strong scaling in energy exists for matrix multiplication (classical and Strassen) and the direct n-body problem via the use of algorithms that use all available memory to replicate data. This means that we can increase the number of processors by some factor and decrease the runtime (both computation and communication) by the same factor, without changing the total energy use. Keywords-Energy lower bounds, Communicationavoiding algorithms, Energy efficient algorithms, Powe

Topics: efficiency
Year: 2012
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.7711
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/~od... (external link)
  • Suggested articles


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