# 125.lud

SPEC ACCEL Benchmark Description File

## Benchmark Name

125.lud

## Benchmark Author

University of Virginia

## Benchmark Program General Category

Dense Linear Algebra, Linear Algebra

## Benchmark Description

LU Decomposition is an algorithm to calculate the solutions of a set of
linear equations. The LUD kernel decomposes a matrix as the product of
a lower triangular matrix and an upper triangular matrix.

## Input Description

The benchmark accepts the size of the problem. It generates
the matrix internally.

## Output Description

Output is the vector W=M*V V={1, 1, 1, ...,1}

The output file lud.out contains detailed timing information about
the run. It also shows which device was selected along with what
devices where available to OpenCL.

## Programming Language

C++

## Known portability issues

None

## Reference

https://www.cs.virginia.edu/~skadron/wiki/rodinia/index.php/Main_Page

[1] S. Che, M. Boyer, J. Meng, D. Tarjan, J. W. Sheaffer, S.-H. Lee, and K. Skadron.
Rodinia: A Benchmark Suite for Heterogeneous Computing. In Proceedings of the IEEE
International Symposium on Workload Characterization (IISWC), pp. 44-54, Oct. 2009.
[2] S. Che, J. W. Sheaffer, M. Boyer, L. G. Szafaryn, L. Wang, and K. Skadron.
A Characterization of the Rodinia Benchmark Suite with Comparison to Contemporary
CMP Workloads. In Proceedings of the IEEE International Symposium on Workload
Characterization, Dec. 2010.

Last Updated: February 3, 2014