Lightweight, Generative Variant Exploration for High-Performance Graphics Applications

Publikation: Beitrag in Buch/Bericht/Sammelwerk/KonferenzbandAufsatz in KonferenzbandForschungPeer-Review

Autoren

  • Kai Selgrad
  • Alexander Lier
  • Franz Köferl
  • Marc Stamminger
  • Daniel Lohmann

Externe Organisationen

  • Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU Erlangen-Nürnberg)
Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Titel des SammelwerksGPCE 2015: Proceedings of the 2015 ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences
Herausgeber/-innenChristian Kastner, Aniruddha Gokhale
Seiten141-150
Seitenumfang10
ISBN (elektronisch)9781450336871
PublikationsstatusVeröffentlicht - Okt. 2015
Extern publiziertJa
Veranstaltung14th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences, GPCE 2015 - Pittsburgh, USA / Vereinigte Staaten
Dauer: 26 Okt. 201527 Okt. 2015

Abstract

Rendering performance is an everlasting goal of computer graphics and significant driver for advances in both, hardware architecture and algorithms. Thereby, it has become possible to apply advanced computer graphics technology even in low-cost embedded appliances, such as car instruments. Yet, to come up with an efficient implementation, developers have to put enormous efforts into hardware/problem-specific tailoring, fine-tuning, and domain exploration, which requires profound expert knowledge. If a good solution has been found, there is a high probability that it does not work as well with other architectures or even the next hardware generation. Generative DSL-based approaches could mitigate these efforts and provide for an efficient exploration of algorithmic variants and hardware-specific tuning ideas. However, in vertically organized industries, such as automotive, suppliers are reluctant to introduce these techniques as they fear loss of control, high introduction costs, and additional constraints imposed by the OEM with respect to software and tool-chain certification. Moreover, suppliers do not want to share their generic solutions with the OEM, but only concrete instances. To this end, we propose a light-weight and incremental approach for meta programming of graphics applications. Our approach relies on an existing formulation of C-like languages that is amenable to meta programming, which we extend to become a lightweight language to combine algorithmic features. Our method provides a concise notation for meta programs and generates easily sharable output in the appropriate C-style target language.

ASJC Scopus Sachgebiete

Zitieren

Lightweight, Generative Variant Exploration for High-Performance Graphics Applications. / Selgrad, Kai; Lier, Alexander; Köferl, Franz et al.
GPCE 2015: Proceedings of the 2015 ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences. Hrsg. / Christian Kastner; Aniruddha Gokhale. 2015. S. 141-150.

Publikation: Beitrag in Buch/Bericht/Sammelwerk/KonferenzbandAufsatz in KonferenzbandForschungPeer-Review

Selgrad, K, Lier, A, Köferl, F, Stamminger, M & Lohmann, D 2015, Lightweight, Generative Variant Exploration for High-Performance Graphics Applications. in C Kastner & A Gokhale (Hrsg.), GPCE 2015: Proceedings of the 2015 ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences. S. 141-150, 14th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences, GPCE 2015, Pittsburgh, USA / Vereinigte Staaten, 26 Okt. 2015. https://doi.org/10.1145/2814204.2814220
Selgrad, K., Lier, A., Köferl, F., Stamminger, M., & Lohmann, D. (2015). Lightweight, Generative Variant Exploration for High-Performance Graphics Applications. In C. Kastner, & A. Gokhale (Hrsg.), GPCE 2015: Proceedings of the 2015 ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences (S. 141-150) https://doi.org/10.1145/2814204.2814220
Selgrad K, Lier A, Köferl F, Stamminger M, Lohmann D. Lightweight, Generative Variant Exploration for High-Performance Graphics Applications. in Kastner C, Gokhale A, Hrsg., GPCE 2015: Proceedings of the 2015 ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences. 2015. S. 141-150 doi: 10.1145/2814204.2814220
Selgrad, Kai ; Lier, Alexander ; Köferl, Franz et al. / Lightweight, Generative Variant Exploration for High-Performance Graphics Applications. GPCE 2015: Proceedings of the 2015 ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences. Hrsg. / Christian Kastner ; Aniruddha Gokhale. 2015. S. 141-150
Download
@inproceedings{1dd8cf2dc9d845539c976e2c34585288,
title = "Lightweight, Generative Variant Exploration for High-Performance Graphics Applications",
abstract = "Rendering performance is an everlasting goal of computer graphics and significant driver for advances in both, hardware architecture and algorithms. Thereby, it has become possible to apply advanced computer graphics technology even in low-cost embedded appliances, such as car instruments. Yet, to come up with an efficient implementation, developers have to put enormous efforts into hardware/problem-specific tailoring, fine-tuning, and domain exploration, which requires profound expert knowledge. If a good solution has been found, there is a high probability that it does not work as well with other architectures or even the next hardware generation. Generative DSL-based approaches could mitigate these efforts and provide for an efficient exploration of algorithmic variants and hardware-specific tuning ideas. However, in vertically organized industries, such as automotive, suppliers are reluctant to introduce these techniques as they fear loss of control, high introduction costs, and additional constraints imposed by the OEM with respect to software and tool-chain certification. Moreover, suppliers do not want to share their generic solutions with the OEM, but only concrete instances. To this end, we propose a light-weight and incremental approach for meta programming of graphics applications. Our approach relies on an existing formulation of C-like languages that is amenable to meta programming, which we extend to become a lightweight language to combine algorithmic features. Our method provides a concise notation for meta programs and generates easily sharable output in the appropriate C-style target language.",
keywords = "Exploratory programming, General purpose code generation, Prototyping, Ray tracing",
author = "Kai Selgrad and Alexander Lier and Franz K{\"o}ferl and Marc Stamminger and Daniel Lohmann",
year = "2015",
month = oct,
doi = "10.1145/2814204.2814220",
language = "English",
pages = "141--150",
editor = "Christian Kastner and Aniruddha Gokhale",
booktitle = "GPCE 2015: Proceedings of the 2015 ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences",
note = "14th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences, GPCE 2015 ; Conference date: 26-10-2015 Through 27-10-2015",

}

Download

TY - GEN

T1 - Lightweight, Generative Variant Exploration for High-Performance Graphics Applications

AU - Selgrad, Kai

AU - Lier, Alexander

AU - Köferl, Franz

AU - Stamminger, Marc

AU - Lohmann, Daniel

PY - 2015/10

Y1 - 2015/10

N2 - Rendering performance is an everlasting goal of computer graphics and significant driver for advances in both, hardware architecture and algorithms. Thereby, it has become possible to apply advanced computer graphics technology even in low-cost embedded appliances, such as car instruments. Yet, to come up with an efficient implementation, developers have to put enormous efforts into hardware/problem-specific tailoring, fine-tuning, and domain exploration, which requires profound expert knowledge. If a good solution has been found, there is a high probability that it does not work as well with other architectures or even the next hardware generation. Generative DSL-based approaches could mitigate these efforts and provide for an efficient exploration of algorithmic variants and hardware-specific tuning ideas. However, in vertically organized industries, such as automotive, suppliers are reluctant to introduce these techniques as they fear loss of control, high introduction costs, and additional constraints imposed by the OEM with respect to software and tool-chain certification. Moreover, suppliers do not want to share their generic solutions with the OEM, but only concrete instances. To this end, we propose a light-weight and incremental approach for meta programming of graphics applications. Our approach relies on an existing formulation of C-like languages that is amenable to meta programming, which we extend to become a lightweight language to combine algorithmic features. Our method provides a concise notation for meta programs and generates easily sharable output in the appropriate C-style target language.

AB - Rendering performance is an everlasting goal of computer graphics and significant driver for advances in both, hardware architecture and algorithms. Thereby, it has become possible to apply advanced computer graphics technology even in low-cost embedded appliances, such as car instruments. Yet, to come up with an efficient implementation, developers have to put enormous efforts into hardware/problem-specific tailoring, fine-tuning, and domain exploration, which requires profound expert knowledge. If a good solution has been found, there is a high probability that it does not work as well with other architectures or even the next hardware generation. Generative DSL-based approaches could mitigate these efforts and provide for an efficient exploration of algorithmic variants and hardware-specific tuning ideas. However, in vertically organized industries, such as automotive, suppliers are reluctant to introduce these techniques as they fear loss of control, high introduction costs, and additional constraints imposed by the OEM with respect to software and tool-chain certification. Moreover, suppliers do not want to share their generic solutions with the OEM, but only concrete instances. To this end, we propose a light-weight and incremental approach for meta programming of graphics applications. Our approach relies on an existing formulation of C-like languages that is amenable to meta programming, which we extend to become a lightweight language to combine algorithmic features. Our method provides a concise notation for meta programs and generates easily sharable output in the appropriate C-style target language.

KW - Exploratory programming

KW - General purpose code generation

KW - Prototyping

KW - Ray tracing

UR - http://www.scopus.com/inward/record.url?scp=84963517332&partnerID=8YFLogxK

U2 - 10.1145/2814204.2814220

DO - 10.1145/2814204.2814220

M3 - Conference contribution

AN - SCOPUS:84963517332

SP - 141

EP - 150

BT - GPCE 2015: Proceedings of the 2015 ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences

A2 - Kastner, Christian

A2 - Gokhale, Aniruddha

T2 - 14th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences, GPCE 2015

Y2 - 26 October 2015 through 27 October 2015

ER -