Computation with Energy-Time Trade-Offs: Models, Algorithms and Lower-Bounds

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 m...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2008 IEEE International Symposium on Parallel and Distributed Processing with Applications s. 143 - 152
Hlavní autoři: Bingham, B.D., Greenstreet, M.R.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.12.2008
Témata:
Algorithm design and analysis
CMOS logic circuits
complexity
Computational modeling
Concurrent computing
energy-time trade-offs
models of computation
Parallel processing
Programming profession
Semiconductor device modeling
Sorting
Topology
Voltage
ISBN:9780769534718, 0769534716
ISSN:2158-9178
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISBN:9780769534718
0769534716
ISSN:2158-9178
DOI:10.1109/ISPA.2008.127