| dc.contributor.author | Smit, J. | en_US |
| dc.contributor.author | Bosma, M. | en_US |
| dc.contributor.editor | Bengt-Olaf Schneider and Andreas Schilling | en_US |
| dc.date.accessioned | 2014-02-06T14:33:57Z | |
| dc.date.available | 2014-02-06T14:33:57Z | |
| dc.date.issued | 1996 | en_US |
| dc.identifier.isbn | - | en_US |
| dc.identifier.issn | - | en_US |
| dc.identifier.uri | http://dx.doi.org/10.2312/EGGH/EGGH96/093-101 | en_US |
| dc.description.abstract | A 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.publisher | The Eurographics Association | en_US |
| dc.title | On the energy complexity of Algorithms realized in CMOS, a Graphics Example | en_US |
| dc.description.seriesinformation | Eurographics Workshop on Graphics Hardware | en_US |
