Date of Award
2015-01-01
Degree Name
Master of Science
Department
Computational Science
Advisor(s)
Shirley Moore
Second Advisor
Barry Rountree
Abstract
For many applications, speedup saturates and parallel efficiency decreases if the problem size is held fixed while increasing the number of processors. For some problems, it is possible to maintain a fixed parallel efficiency by increasing both the problem size and the number of processing elements. The rate at which the problem size must increase to maintain constant efficiency for a given rate of increase of the number of processors is given by the iso-efficiency function. We have developed a new scalability function called iso-power-efficiency that determines the rate at which the problem size must increase to maintain constant efficiency for a given rate of increase in the application's power budget. For a given power budget, an application can choose to use a larger number of processors running at lower power. We show that such overprovisioning can lead to better scaling behavior.
Language
en
Provenance
Received from ProQuest
Copyright Date
2015
File Size
39 pages
File Format
application/pdf
Rights Holder
Rogelio Long
Recommended Citation
Long, Rogelio, "ISO-Power-Efficiency: An Approach To Scaling Application Codes With A Power Budget" (2015). Open Access Theses & Dissertations. 1089.
https://scholarworks.utep.edu/open_etd/1089