Geometry types for graphics programming

Geisler, Dietrich; Yoon, Irene; Kabra, Aditi; He, Horace; Sanders, Yinnon; Sampson, Adrian

doi:10.1145/3428241

Cited by 4 publications

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…But higher clock frequencies often require higher voltage levels, resulting in increased power consumption [3,4,10]. To enhance both speed and the quality of rendering, while considering the significance of textures and geometry, cutting-edge, highperformance texture streaming systems have been developed [11,12]. The power consumption in shaders is influenced by a combination of factors related to the complexity of the shader code, the number of shader invocations, and memory access patterns.…”

Section: Introductionmentioning

confidence: 99%

GPU Shader Analysis and Power Optimization Model

Konnurmath,

Chickerur

2024

Eng. Technol. Appl. Sci. Res.

View full text Add to dashboard Cite

With the rapid advancements in 3D game technology, workload characterization has become crucial for each new generation of games. The increased complexity of scenes in 3D games allows for stunning real-time visual quality. However, handling such workloads results in significant power consumption over the GPU rendering pipeline. The focus of the current paper is low power optimization, targeting texture memory, geometry engine, pixel, and rasterization, as these components are significant contributors to the power consumption of a typical GPU. The proposed methodology integrates the Dynamic Voltage Frequency Scaling (DVFS) technique, adjusting voltage and frequency based on the workload analysis of frame rates with respect to the scenes of 3D games. Frame rates of 60 fps and 30 fps are set up to understand and manage the workload on frames. Furthermore, for comparative analysis, various frame-level power analysis schemes such as No DVFS implemented, Frame History Method, Frame Signature Method, and Tiled History-based are introduced. The proposed scheme consistently surpasses these frame-level schemes, with fewer missed deadlines, while having the lowest energy consumption per frame rate. The implementation resulted in a remarkable 65% improvement in quality, indicated by a reduction in deadline misses, along with a substantial 60% energy saving.

show abstract

Section: Introductionmentioning

confidence: 99%

GPU Shader Analysis and Power Optimization Model

Konnurmath,

Chickerur

2024

Eng. Technol. Appl. Sci. Res.

View full text Add to dashboard Cite

show abstract

Online verification of commutativity

Kabra

Geisler

Sampson

2020

Proceedings of the 11th ACM SIGPLAN International Workshop on Tools for Automatic Program Analysis

Self Cite

View full text Add to dashboard Cite

Systems of transformations arise in many programming systems, such as in graphs of implicit type conversion functions. It is important to ensure that these diagrams commute: that composing any path of transformations from the same source to the same destination yields the same result. However, a straightforward approach to verifying commutativity must contend with cycles, and even so it runs in exponential time. Previous work has shown how to verify commutativity in the special case of acyclic diagrams in (| | 4 | | 2) time, but this is a batch algorithm: the entire diagram must be known ahead of time. We present an online algorithm that efficiently verifies that a commutative diagram remains commutative when adding a new edge. The new incremental algorithm runs in (| | 2 (| | + | |)) time. For the case when checking the equality of paths is expensive, we also present an optimization that runs in (| | 4) time but reduces to the minimum possible number of equality checks. We implement the algorithms and compare them to batch baselines, and we demonstrate their practical application in the compiler of a domain-specific language for geometry types. To study the algorithms' scalability to large diagrams, we apply them to discover discrepancies in currency conversion graphs.

show abstract

I♥la

Kamil

Jacobson

et al. 2021

ACM Trans. Graph.

View full text Add to dashboard Cite

Communicating linear algebra in written form is challenging: mathematicians must choose between writing in languages that produce well-formatted but semantically-underdefined representations such as LaTeX; or languages with well-defined semantics but notation unlike conventional math, such as C++/Eigen. In both cases, the underlying linear algebra is obfuscated by the requirements of esoteric language syntax (as in LaTeX) or awkward APIs due to language semantics (as in C++). The gap between representations results in communication challenges, including underspecified and irrepro-ducible research results, difficulty teaching math concepts underlying complex numerical code, as well as repeated, redundant, and error-prone translations from communicated linear algebra to executable code. We introduce I♥LA, a language with syntax designed to closely mimic conventionally-written linear algebra, while still ensuring an unambiguous, compilable interpretation. Inspired by Markdown, a language for writing naturally-structured plain text files that translate into valid HTML, I♥LA allows users to write linear algebra in text form and compile the same source into LaTeX, C++/Eigen, Python/NumPy/SciPy, and MATLAB, with easy extension to further math programming environments. We outline the principles of our language design and highlight design decisions that balance between readability and precise semantics, and demonstrate through case studies the ability for I♥LA to bridge the semantic gap between conventionally-written linear algebra and unambiguous interpretation in math programming environments.

show abstract

Geometry types for graphics programming

Cited by 4 publications

References 9 publications

GPU Shader Analysis and Power Optimization Model

GPU Shader Analysis and Power Optimization Model

Online verification of commutativity

I♥la

Contact Info

Product

Resources

About