On the Power Consumption of Digital Computing Systems;
No Thumbnail Available
Date
2005
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Open Access Color
OpenAIRE Downloads
OpenAIRE Views
Abstract
In this paper, the predictability of power consumption of digital computing systems is investigated by using the abstract Turing machine model which is known to be a universal computer. An upper bound for power consumption of such machine model is defined. Also, a polynomial-time algorithm that can automatically produce a two-tape Turing machine which can record power consumption of an arbitrarily given standart Turing machine, is developed. ©2005 IEEE.
Description
Keywords
[No Keyword Available]
Turkish CoHE Thesis Center URL
Fields of Science
Citation
WoS Q
Scopus Q
Source
Proceedings of the IEEE 13th Signal Processing and Communications Applications Conference, SIU 2005 -- IEEE 13th Signal Processing and Communications Applications Conference, SIU 2005 -- 16 May 2005 through 18 May 2005 -- Kayseri -- 69003
Volume
2005
Issue
Start Page
41
End Page
44