bound until all nodes reach their minimum frequencies or their lower bounds, to compute the overall
energy consumption and performance and selects the optimal vector of the frequency scaling
factors. At each iteration the algorithm determines the slowest node
-according to Equation~\ref{eq:perf}
-%\AG[]{Be consistent: remove word ``Equation'' and add parentheses around equation number, here and all along the rest of the text.}
-and keeps its frequency unchanged,
+according to Equation~\ref{eq:perf} and keeps its frequency unchanged,
while it lowers the frequency of all other nodes by one gear. The new overall
energy consumption and execution time are computed according to the new scaling
factors. The optimal set of frequency scaling factors is the set that gives the
address = {Los Alamitos, CA, USA}
}
-@inproceedings{Le_DVFS.Laws.of.Diminishing.Returns,
- author = {Le Sueur, Etienne and Gernot Heiser},
- month = oct,
- year = {2010},
- title = {Dynamic Voltage and Frequency Scaling: The Laws of Diminishing Returns},
- booktitle = {Proceedings of the 2010 Workshop on Power Aware Computing and Systems (HotPower'10)},
- NOaddress = {Vancouver, Canada}
- }
+2
@inproceedings{Cochran_Pack_and_Cap_Adaptive_DVFS,
author = {Cochran, Ryan and Hankendi, Can and Coskun, Ayse K. and Reda, Sherief},
urldate = {2014-10-16},
institution = {{DTIC} Document},
author = {Luley, Ryan and Usmail, Courtney and Barnell, Mark},
- year = {2011},
+ year = {2011}
}