Perfect strong scaling using no additional energy

James Demmel, Andrew Gearhart, Benjamin Lipshitz, Oded Schwartz

Research output: Contribution to conferencePaperpeer-review

20 Scopus citations


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.

Original languageAmerican English
Number of pages12
StatePublished - 2013
Externally publishedYes
Event27th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2013 - Boston, MA, United States
Duration: 20 May 201324 May 2013


Conference27th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2013
Country/TerritoryUnited States
CityBoston, MA


  • Communication-avoiding algorithms
  • Energy efficient algorithms
  • Energy lower bounds
  • Power efficiency


Dive into the research topics of 'Perfect strong scaling using no additional energy'. Together they form a unique fingerprint.

Cite this