Bernhard Kerbl
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Bernhard Kerbl has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Dieter Schmalstieg
VISUS, University of Stuttgart, Stuttgart, Germany
2 shared publications - Denis Kalkofen
Graz University of Technology
1 shared publication - Hans-Peter Seidel
MPI Informatik Germany
1 shared publication - Markus Steinberger
Graz University of Technology
1 shared publication - Markus Steinberger
Max Planck Institute for Informatics Saarbrücken Germany
1 shared publication - Michael Kenzel
Graz University of Technology Graz Austria
1 shared publication
Latest Publications
- 5 December 2016
- Published by Wiley in Computer Graphics Forum
- Vol. 36 (8) , 232-246
Hierarchical Bucket Queuing for Fine‐Grained Priority Scheduling on the GPU
While the modern graphics processing unit (GPU) offers massive parallel compute power, the ability to influence the scheduling of these immense resources is severely limited. Therefore, the GPU is widely considered to be only suitable as an externally controlled co‐processor for homogeneous workloads which greatly restricts the potential applications of GPU computing. To address this issue, we present a new method to achieve fine‐grained priority scheduling on the GPU: hierarchical bucket queuing. By carefully distributing the workload among multiple queues and efficiently deciding which queue to draw work from next, we enable a variety of scheduling strategies. These strategies include fair‐scheduling, earliest‐deadline‐first scheduling and user‐defined dynamic priority scheduling. In a comparison with a sorting‐based approach, we reveal the advantages of hierarchical bucket queuing over previous work. Finally, we demonstrate the benefits of using priority scheduling in real‐world applications by example of path tracing and foveated micropolygon rendering.
- 5 December 2016
- Published by Wiley in Computer Graphics Forum
- Vol. 36 (8) , 232-246
Hierarchical Bucket Queuing for Fine‐Grained Priority Scheduling on the GPU
While the modern graphics processing unit (GPU) offers massive parallel compute power, the ability to influence the scheduling of these immense resources is severely limited. Therefore, the GPU is widely considered to be only suitable as an externally controlled co‐processor for homogeneous workloads which greatly restricts the potential applications of GPU computing. To address this issue, we present a new method to achieve fine‐grained priority scheduling on the GPU: hierarchical bucket queuing. By carefully distributing the workload among multiple queues and efficiently deciding which queue to draw work from next, we enable a variety of scheduling strategies. These strategies include fair‐scheduling, earliest‐deadline‐first scheduling and user‐defined dynamic priority scheduling. In a comparison with a sorting‐based approach, we reveal the advantages of hierarchical bucket queuing over previous work. Finally, we demonstrate the benefits of using priority scheduling in real‐world applications by example of path tracing and foveated micropolygon rendering.
- 1 May 2015
- Published by Wiley in Computer Graphics Forum
- Vol. 34 (2) , 287-297
Interactive Disassembly Planning for Complex Objects
We present an approach for the automatic generation, interactive exploration and real‐time modification of disassembly procedures for complex, multipartite CAD data sets. In order to lift the performance barriers prohibiting interactive disassembly planning, we run a detailed analysis on the input model to identify recurring part constellations and efficiently determine blocked part motions in parallel on the GPU. Building on the extracted information, we present an interface for computing and editing extensive disassembly sequences in real‐time while considering user‐defined constraints and avoiding unstable configurations. To evaluate the performance of our C++/CUDA implementation, we use a variety of openly available CAD data sets, ranging from simple to highly complex. In contrast to previous approaches, our work enables interactive disassembly planning for objects which consist of several thousand parts and require cascaded translations during part removal.
- 1 May 2015
- Published by Wiley in Computer Graphics Forum
- Vol. 34 (2) , 287-297
Interactive Disassembly Planning for Complex Objects
We present an approach for the automatic generation, interactive exploration and real‐time modification of disassembly procedures for complex, multipartite CAD data sets. In order to lift the performance barriers prohibiting interactive disassembly planning, we run a detailed analysis on the input model to identify recurring part constellations and efficiently determine blocked part motions in parallel on the GPU. Building on the extracted information, we present an interface for computing and editing extensive disassembly sequences in real‐time while considering user‐defined constraints and avoiding unstable configurations. To evaluate the performance of our C++/CUDA implementation, we use a variety of openly available CAD data sets, ranging from simple to highly complex. In contrast to previous approaches, our work enables interactive disassembly planning for objects which consist of several thousand parts and require cascaded translations during part removal.