On the energy complexity of Algorithms realized in CMOS, a Graphics Example

Simple item page
dc.contributor.authorSmit, J.en_US
dc.contributor.authorBosma, M.en_US
dc.contributor.editorBengt-Olaf Schneider and Andreas Schillingen_US
dc.date.accessioned2014-02-06T14:33:57Z
dc.date.available2014-02-06T14:33:57Z
dc.date.issued1996en_US
dc.description.abstractA theory about the energy consumption of algorithms realized in CMOS, presented in related work, makes it possible to calculate the minimal amount of energy dissipated for the execution of an algorithm. The rendering of a dense dataset with three variants of the Volume Rendering algorithm wi11 be considered as an example of the methodology. The absolute lower bound of the energy consumption is calculated for the rendering of a dense 256"3 dataset using implementations of the algorithms in an 1um CMOS process. Predictions of the energy consumption in future CMOS generations are given as well.en_US
dc.description.seriesinformationEurographics Workshop on Graphics Hardwareen_US
dc.identifier.isbn-en_US
dc.identifier.issn-en_US
dc.identifier.urihttps://doi.org/10.2312/EGGH/EGGH96/093-101en_US
dc.publisherThe Eurographics Associationen_US
dc.titleOn the energy complexity of Algorithms realized in CMOS, a Graphics Exampleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
093-101.pdf
Size:
897.34 KB
Format:
Adobe Portable Document Format
Download
Collections
EGGH96: Eurographics Workshop on Graphics Hardware 1996