Technical Reports

The ICICS/CS Reading Room

UBC CS TR-2008-03 Summary

Computation with Energy-Time Trade-Offs: Models, Algorithms and Lower-Bounds, April 10, 2008 Bradley D. Bingham and Mark R. Greenstreet, 11 pages

Power consumption has become one of the most critical concerns for processor design. This motivates designing algorithms for minimum execution time subject to energy constraints. We propose simple models for analysing algorithms that reflect the energy-time trade-offs of CMOS circuits. Using these models, we derive lower bounds for the energy-constrained execution time of sorting, addition and multiplication, and we present algorithms that meet these bounds. We show that minimizing time under energy constraints is not the same as minimizing operation count or computation depth.

If you have any questions or comments regarding this page please send mail to