SEARCH

SEARCH BY CITATION

Keywords:

  • programmable GPU;
  • vertex shader;
  • pixel shader;
  • numerical computing;
  • linear expression;
  • SIMD;
  • shader code optimization;
  • I.3.1 Computer Graphics: Graphics processors, Parallel processing, Programmable shader;
  • G.1.3 Numerical Analysis—Numerical linear algebra, Sparse systems;
  • G.1.6 Numerical Analysis—Optimization

Abstract

The 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 ofinline image, where A is a matrix, andinline image and inline imageare 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.