Erik Brunvand
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Erik Brunvand has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Cem Yuksel
University of Utah, Salt Lake City, UT, USA
5 shared publications - Daniel Kopta
University of Utah
5 shared publications - Konstantin Shkurko
School of Computing, University of Utah, Salt Lake city, UT, USA
4 shared publications - Bill Manaris
College of Charleston, Charleston, SC, USA
2 shared publications - Elena Vasiou
School of Computing, University of Utah, Salt Lake city, UT, USA
2 shared publications - Ian Mallett
University of Utah
2 shared publications
Latest Publications
- Open Access
- 29 June 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Computer Graphics and Interactive Techniques
- Vol. 9 (4) , 1-18
Memory-Efficient Bounding Volume Hierarchies with Merged Nodes for Hardware Ray Tracing 48
The performance of hardware-accelerated ray tracing on modern GPUs, even with advances in traversal hardware and BVH compression, is fundamentally limited by memory bandwidth. This makes memory traffic—not compute—the primary bottleneck in ray tracing, and demands data structures and construction algorithms that are explicitly optimized for bandwidth efficiency. We introduce a new block-based representation for wide bounding volume hierarchies (BVHs) that directly targets this bottleneck. Our approach organizes multiple primitives and internal nodes into compact, bandwidth-efficient blocks, reducing the number and cost of memory transactions during traversal. Unlike conventional layouts, our representation enables the merging of both internal and leaf nodes, forming composite bounding volumes that amortize memory accesses across larger portions of the hierarchy. To further align BVH construction with hardware realities, we introduce a memory-centric reformulation of the surface area heuristic (SAH). Rather than modeling traversal cost in terms of compute, our formulation estimates the cost of data movement, yielding a metric that more accurately predicts performance on modern GPUs. Under this model, our merged-node representation achieves substantial reductions in memory traffic. We describe both an optimal construction algorithm and an efficient greedy variant that leverage our representation and bandwidth-driven cost model. Across a range of scenes, our approach reduces acceleration structure size and significantly lowers data movement per ray, resulting in consistently faster rendering. These results demonstrate that treating memory bandwidth as a first-class design constraint leads to more efficient ray tracing acceleration structures.
- 29 June 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Computer Graphics and Interactive Techniques
- Vol. 9 (4) , 1-18
Open AccessMemory-Efficient Bounding Volume Hierarchies with Merged Nodes for Hardware Ray Tracing 48
The performance of hardware-accelerated ray tracing on modern GPUs, even with advances in traversal hardware and BVH compression, is fundamentally limited by memory bandwidth. This makes memory traffic—not compute—the primary bottleneck in ray tracing, and demands data structures and construction algorithms that are explicitly optimized for bandwidth efficiency. We introduce a new block-based representation for wide bounding volume hierarchies (BVHs) that directly targets this bottleneck. Our approach organizes multiple primitives and internal nodes into compact, bandwidth-efficient blocks, reducing the number and cost of memory transactions during traversal. Unlike conventional layouts, our representation enables the merging of both internal and leaf nodes, forming composite bounding volumes that amortize memory accesses across larger portions of the hierarchy. To further align BVH construction with hardware realities, we introduce a memory-centric reformulation of the surface area heuristic (SAH). Rather than modeling traversal cost in terms of compute, our formulation estimates the cost of data movement, yielding a metric that more accurately predicts performance on modern GPUs. Under this model, our merged-node representation achieves substantial reductions in memory traffic. We describe both an optimal construction algorithm and an efficient greedy variant that leverage our representation and bandwidth-driven cost model. Across a range of scenes, our approach reduces acceleration structure size and significantly lowers data movement per ray, resulting in consistently faster rendering. These results demonstrate that treating memory bandwidth as a first-class design constraint leads to more efficient ray tracing acceleration structures.
- Open Access
- 17 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 155-161
Algorithmic Arts: Attracting a New Type of Student to Computing - The Algorithm is the Medium
- 17 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 155-161
Open AccessAlgorithmic Arts: Attracting a New Type of Student to Computing - The Algorithm is the Medium
- Open Access
- 17 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 1631-1632
Algorithmic Arts Degree Programs: A Report on Current Curricular Trends & Pathways for Implementation
- 17 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 1631-1632
Open AccessAlgorithmic Arts Degree Programs: A Report on Current Curricular Trends & Pathways for Implementation
- 18 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Design & Test
- Vol. 43 (2) , 72-91
Semiconductor Microelectronics and Nanoelectronics Research and Education in Academia
Editor’s notes: The need for research, education, and infrastructure of the microelectronic and nanoelectronic design and design automation community has been voiced in several venues. This article focuses on the need for novel design and architecture, affordable access to semiconductor fabrication, future emerging technologies, education and workforce development, and other considerations based on the broad relevance to a larger ecosystem. —Partha Pratim Pande, Washington State University, USA
- 18 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Design & Test
- Vol. 43 (2) , 72-91
Semiconductor Microelectronics and Nanoelectronics Research and Education in Academia
Editor’s notes: The need for research, education, and infrastructure of the microelectronic and nanoelectronic design and design automation community has been voiced in several venues. This article focuses on the need for novel design and architecture, affordable access to semiconductor fabrication, future emerging technologies, education and workforce development, and other considerations based on the broad relevance to a larger ecosystem. —Partha Pratim Pande, Washington State University, USA
- 21 October 2025
- Published by Wiley in Computer Graphics Forum
Arches: A Cycle‐Level Hardware Simulation Framework for Exploring Massively Parallel Ray Tracing Architectures
We introduce Arches, a hardware simulation framework designed to explore and evaluate massively parallel ray‐tracing architectures. Operating at the cycle level, Arches captures detailed performance metrics, including computational throughput, on‐chip data movement across processors, caches, and off‐chip communication via an accurate memory system model. The framework is modular, allowing flexible configuration and interconnection of processor cores, caches, and custom hardware units, enabling easy exploration of diverse hardware architectures. Arches supports high‐performance parallel execution, simulating complex ray tracing workloads to image completion. It leverages the GNU toolchain, allowing users to write C++ software targeting both the simulated architecture and native execution for debugging, including support for custom instructions to control specialized hardware components. The framework provides comprehensive performance instrumentation, offering insights into time‐varying statistics across all modules and identifying performance bottlenecks. Our evaluations demonstrate that Arches delivers performance estimates closely matching real hardware, offering faster and more accurate simulations than existing open‐source hardware simulators. Its modularity also makes it a valuable tool for exploring alternative parallel computing strategies for high‐performance ray tracing, and its extensibility enables adaptation for other workloads or general‐purpose computation.
- 21 October 2025
- Published by Wiley in Computer Graphics Forum
Arches: A Cycle‐Level Hardware Simulation Framework for Exploring Massively Parallel Ray Tracing Architectures
We introduce Arches, a hardware simulation framework designed to explore and evaluate massively parallel ray‐tracing architectures. Operating at the cycle level, Arches captures detailed performance metrics, including computational throughput, on‐chip data movement across processors, caches, and off‐chip communication via an accurate memory system model. The framework is modular, allowing flexible configuration and interconnection of processor cores, caches, and custom hardware units, enabling easy exploration of diverse hardware architectures. Arches supports high‐performance parallel execution, simulating complex ray tracing workloads to image completion. It leverages the GNU toolchain, allowing users to write C++ software targeting both the simulated architecture and native execution for debugging, including support for custom instructions to control specialized hardware components. The framework provides comprehensive performance instrumentation, offering insights into time‐varying statistics across all modules and identifying performance bottlenecks. Our evaluations demonstrate that Arches delivers performance estimates closely matching real hardware, offering faster and more accurate simulations than existing open‐source hardware simulators. Its modularity also makes it a valuable tool for exploring alternative parallel computing strategies for high‐performance ray tracing, and its extensibility enables adaptation for other workloads or general‐purpose computation.
Collective Currents: Exploring Sustainability through a Collaborative and Interactive Installation
Water issues in the western United States include a long history of struggle, controversy and politics. Collaboration and compromise are required to achieve desirable outcomes in water quality and water rights. Collective Currents is an interactive art installation, developed collaboratively by a computer engineer and a multimedia artist, that explores the idea of cooperative experience in both literal and conceptual ways and creates an environment that makes reference to and engages the viewer to think about our ability to understand and solve environmental issues, specifically water quality and conservation, through collaboration.
Collective Currents: Exploring Sustainability through a Collaborative and Interactive Installation
Water issues in the western United States include a long history of struggle, controversy and politics. Collaboration and compromise are required to achieve desirable outcomes in water quality and water rights. Collective Currents is an interactive art installation, developed collaboratively by a computer engineer and a multimedia artist, that explores the idea of cooperative experience in both literal and conceptual ways and creates an environment that makes reference to and engages the viewer to think about our ability to understand and solve environmental issues, specifically water quality and conservation, through collaboration.
- 1 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 28 (3) , 1585-1596
Mach-RT: A Many Chip Architecture for High Performance Ray Tracing
Data movement, particularly access to the main memory, has been the bottleneck of most computing problems. Ray tracing is no exception. We propose an unconventional solution that combines a ray ordering scheme that minimizes access to the scene data with a large on-chip buffer acting as near-compute storage that is spread over multiple chips. We demonstrate the effectiveness of our approach by introducing Mach-RT ( Ma ny ch ip - R ay T racing), a new hardware architecture for accelerating ray tracing. Extending the concept of dual streaming, we optimize the main memory accesses to a level that allows the same memory system to service multiple processor chips at the same time. While a multiple chip solution might seem to imply increased energy consumption as well, because of the reduced memory traffic we are able to demonstrate, performance increases while maintaining reasonable energy usage compared to academic and commercial architectures. This article extends our previous work E. Vasiou, K. Shkurko, E. Brunvand, and C. Yuksel, “Mach-RT: A many chip architecture for high-performance ray tracing,” in Proc. High-Perform. Graph. Conf. , 2019 with design space exploration of the L3 cache size, more detailed evaluation of energy and memory performance, a discussion of energy delay product, and a brief exploration of boards with 16 chips. We also introduce new treelet enqueueing logic for the predictive scheduler.
- 1 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 28 (3) , 1585-1596
Mach-RT: A Many Chip Architecture for High Performance Ray Tracing
Data movement, particularly access to the main memory, has been the bottleneck of most computing problems. Ray tracing is no exception. We propose an unconventional solution that combines a ray ordering scheme that minimizes access to the scene data with a large on-chip buffer acting as near-compute storage that is spread over multiple chips. We demonstrate the effectiveness of our approach by introducing Mach-RT ( Ma ny ch ip - R ay T racing), a new hardware architecture for accelerating ray tracing. Extending the concept of dual streaming, we optimize the main memory accesses to a level that allows the same memory system to service multiple processor chips at the same time. While a multiple chip solution might seem to imply increased energy consumption as well, because of the reduced memory traffic we are able to demonstrate, performance increases while maintaining reasonable energy usage compared to academic and commercial architectures. This article extends our previous work E. Vasiou, K. Shkurko, E. Brunvand, and C. Yuksel, “Mach-RT: A many chip architecture for high-performance ray tracing,” in Proc. High-Perform. Graph. Conf. , 2019 with design space exploration of the L3 cache size, more detailed evaluation of energy and memory performance, a discussion of energy delay product, and a brief exploration of boards with 16 chips. We also introduce new treelet enqueueing logic for the predictive scheduler.
- 30 April 2018
- Published by Springer Nature in The Visual Computer
- Vol. 34 (6-8) , 875-885
A detailed study of ray tracing performance: render time and energy cost
- 30 April 2018
- Published by Springer Nature in The Visual Computer
- Vol. 34 (6-8) , 875-885
A detailed study of ray tracing performance: render time and energy cost
- 20 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 24 (12) , 3225-3238
Time Interval Ray Tracing for Motion Blur
We introduce a new motion blur computation method for ray tracing that provides an analytical approximation of motion blurred visibility per ray. Rather than relying on timestamped rays and Monte Carlo sampling to resolve the motion blur, we associate a time interval with rays and directly evaluate when and where each ray intersects with animated object faces. Based on our simplifications, the volume swept by each animated face is represented using a triangulation of the surface of this volume. Thus, we can resolve motion blur through ray intersections with stationary triangles, and we can use any standard ray tracing acceleration structure without modifications to account for the time dimension. Rays are intersected with these triangles to analytically determine the time interval and positions of the intersections with the moving objects. Furthermore, we explain an adaptive strategy to efficiently shade the intersection intervals. As a result, we can produce noise-free motion blur for both primary and secondary rays. We also provide a general framework for emulating various camera shutter mechanisms and an artistic modification that amplifies the visibility of moving objects for emphasizing the motion in videos or static images.
- 20 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 24 (12) , 3225-3238
Time Interval Ray Tracing for Motion Blur
We introduce a new motion blur computation method for ray tracing that provides an analytical approximation of motion blurred visibility per ray. Rather than relying on timestamped rays and Monte Carlo sampling to resolve the motion blur, we associate a time interval with rays and directly evaluate when and where each ray intersects with animated object faces. Based on our simplifications, the volume swept by each animated face is represented using a triangulation of the surface of this volume. Thus, we can resolve motion blur through ray intersections with stationary triangles, and we can use any standard ray tracing acceleration structure without modifications to account for the time dimension. Rays are intersected with these triangles to analytically determine the time interval and positions of the intersections with the moving objects. Furthermore, we explain an adaptive strategy to efficiently shade the intersection intervals. As a result, we can produce noise-free motion blur for both primary and secondary rays. We also provide a general framework for emulating various camera shutter mechanisms and an artistic modification that amplifies the visibility of moving objects for emphasizing the motion in videos or static images.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 39, 1-6
Power and energy implications of misunderstanding DRAM
When optimizing for energy in a modern computing system, it is critical to understand the primary source of energy usage: the memory system. Performing effective optimization in a traditional memory system requires knowing something about the complex and subtle behavior of dynamic random access memory (DRAM). This includes understanding DRAM chip organization and functionality, the organization of chips and data on a dual inline memory module (DIMM), the structure of modern packaging options, and the behavior of the memory controller. In this position paper we describe some background of DRAM chip and system organization with some specific examples of how this knowledge can be used to enhance system behavior. We then give some examples of how understanding accurate DRAM behavior can influence energy and latency, and describe a detailed DRAM simulator (USIMM) that can be used to add high-fidelity DRAM models to system simulations. We use graphics hardware as a motivating example of a system that is both heavily reliant on the memory system, and that also has interesting latitude in terms of how the application accesses memory.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 39, 1-6
Power and energy implications of misunderstanding DRAM
When optimizing for energy in a modern computing system, it is critical to understand the primary source of energy usage: the memory system. Performing effective optimization in a traditional memory system requires knowing something about the complex and subtle behavior of dynamic random access memory (DRAM). This includes understanding DRAM chip organization and functionality, the organization of chips and data on a dual inline memory module (DIMM), the structure of modern packaging options, and the behavior of the memory controller. In this position paper we describe some background of DRAM chip and system organization with some specific examples of how this knowledge can be used to enhance system behavior. We then give some examples of how understanding accurate DRAM behavior can influence energy and latency, and describe a detailed DRAM simulator (USIMM) that can be used to add high-fidelity DRAM models to system simulations. We use graphics hardware as a motivating example of a system that is both heavily reliant on the memory system, and that also has interesting latitude in terms of how the application accesses memory.