Show simple item record

dc.contributor.authorChandrajit Bajajen_US
dc.contributor.authorInsung Ihmen_US
dc.contributor.authorJungki Minen_US
dc.contributor.authorJinsang Ohen_US
dc.date.accessioned2015-02-19T07:42:19Z
dc.date.available2015-02-19T07:42:19Z
dc.date.issued2004en_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttp://dx.doi.org/10.1111/j.1467-8659.2004.00803.xen_US
dc.description.abstractThe increased programmability of graphics hardware allows efficient graphical processing unit (GPU) implementations of a wide range of general computations on commodity PCs. An important factor in such implementations is how to fully exploit the SIMD computing capacities offered by modern graphics processors. Linear expressions in the form of , where A is a matrix, and and are vectors, constitute one of the most basic operations in many scientific computations. In this paper, we propose a SIMD code optimization technique that enables efficient shader codes to be generated for evaluating linear expressions. It is shown that performance can be improved considerably by efficiently packing arithmetic operations into four-wide SIMD instructions through reordering of the operations in linear expressions. We demonstrate that the presented technique can be used effectively for programming both vertex and pixel shaders for a variety of mathematical applications, including integrating differential equations and solving a sparse linear system of equations using iterative methods.en_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltd.en_US
dc.titleSIMD Optimization of Linear Expressions for Programmable Graphics Hardwareen_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume23en_US
dc.description.number4en_US
dc.identifier.doi10.1111/j.1467-8659.2004.00803.xen_US
dc.identifier.pages697-714en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record