A performance and energy evaluation of many-light rendering algorithms

Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

Standard

A performance and energy evaluation of many-light rendering algorithms. / Johnsson, Björn M; Akenine-Möller, Tomas.

I: Visual Computer, Vol. 31, Nr. 12, 2015, s. 1671-1681.

Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskrift

Harvard

APA

CBE

MLA

Vancouver

Author

RIS

TY - JOUR

T1 - A performance and energy evaluation of many-light rendering algorithms

AU - Johnsson, Björn M

AU - Akenine-Möller, Tomas

PY - 2015

Y1 - 2015

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

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

U2 - 10.1007/s00371-014-1046-y

DO - 10.1007/s00371-014-1046-y

M3 - Article

VL - 31

SP - 1671

EP - 1681

JO - Visual Computer

JF - Visual Computer

SN - 0178-2789

IS - 12

ER -