Advanced

A performance and energy evaluation of many-light rendering algorithms

Johnsson, Björn M LU and Akenine-Möller, Tomas LU (2015) In Visual Computer 31(12). p.1671-1681
Abstract
Recently, the performance of many-light algorithms, where thousands of light sources are used to compute the lighting in a scene, has improved so much that they have reached the realm of real-time rendering. In general, the algorithm that is considered “best” is the one that is the fastest in terms of time per frame. Given that power efficiency may become or already is one of the most important optimization factors for both hardware and software vendors for graphics, we take a different route and instead measure both energy usage per frame and frame time for a number of popular many-light rendering algorithms on an Intel Iris Pro. We use Pareto frontiers for each configuration to examine the possibilities for trade-offs between rendering... (More)
Recently, the performance of many-light algorithms, where thousands of light sources are used to compute the lighting in a scene, has improved so much that they have reached the realm of real-time rendering. In general, the algorithm that is considered “best” is the one that is the fastest in terms of time per frame. Given that power efficiency may become or already is one of the most important optimization factors for both hardware and software vendors for graphics, we take a different route and instead measure both energy usage per frame and frame time for a number of popular many-light rendering algorithms on an Intel Iris Pro. We use Pareto frontiers for each configuration to examine the possibilities for trade-offs between rendering time and energy consumption. Furthermore, we examine the optimal algorithms at each configuration, and are able to draw generalized conclusions on when each algorithm is most efficient. We also record several other statistics on the algorithms, e.g., bandwidth, and are able to draw further conclusions with regard to energy consumption. (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to journal
publication status
published
subject
in
Visual Computer
volume
31
issue
12
pages
1671 - 1681
publisher
Springer
external identifiers
  • wos:000364126900007
  • scopus:84945437643
ISSN
0178-2789
DOI
10.1007/s00371-014-1046-y
language
English
LU publication?
yes
id
9a06f61b-0082-4c67-87cb-fc0ca5fa6c5d (old id 7991397)
date added to LUP
2015-09-25 09:51:42
date last changed
2017-01-08 04:23:38
@article{9a06f61b-0082-4c67-87cb-fc0ca5fa6c5d,
  abstract     = {Recently, the performance of many-light algorithms, where thousands of light sources are used to compute the lighting in a scene, has improved so much that they have reached the realm of real-time rendering. In general, the algorithm that is considered “best” is the one that is the fastest in terms of time per frame. Given that power efficiency may become or already is one of the most important optimization factors for both hardware and software vendors for graphics, we take a different route and instead measure both energy usage per frame and frame time for a number of popular many-light rendering algorithms on an Intel Iris Pro. We use Pareto frontiers for each configuration to examine the possibilities for trade-offs between rendering time and energy consumption. Furthermore, we examine the optimal algorithms at each configuration, and are able to draw generalized conclusions on when each algorithm is most efficient. We also record several other statistics on the algorithms, e.g., bandwidth, and are able to draw further conclusions with regard to energy consumption.},
  author       = {Johnsson, Björn M and Akenine-Möller, Tomas},
  issn         = {0178-2789},
  language     = {eng},
  number       = {12},
  pages        = {1671--1681},
  publisher    = {Springer},
  series       = {Visual Computer},
  title        = {A performance and energy evaluation of many-light rendering algorithms},
  url          = {http://dx.doi.org/10.1007/s00371-014-1046-y},
  volume       = {31},
  year         = {2015},
}