
 Berkeley Multimedia Workload
This benchmark suite follows the MediaBench approach of providing full
applications with extensive data sets. The BMW focuses on image/video
processing and graphics applications and consists of: adpcm, djvu, doom, ghostscript,
gsm, jpeg, lame, mesa,
mpeg2, mpg123, povray, rasta,
rsynth, and timidity.
 Nathan T. Slingerland and Alan Jay Smith, "Design and
Characterization of the Berkeley Multimedia Workload," ACM Transactions
on Multimedia Systems, Vol. 8, No. 4, pp. 315327, July 2002.

DSPstone The main goal of the DSPstone project was the efficiency
evaluation of stateoftheart DSP C compilers. The suite consists of:
 application benchmarks: adpcm
 DSPkernel benchmarks: real_updates, n_real_updates,
complex_updates, n_complex_updates, dot_product,
matrix_1x3, matrix, convolution, fir,
fir2d, iir_biquad_1, iir_biquad_n,
lms, fft_input_scaled, fft_stage_scaled
 HLLkernels that evaluate the performance of the compiler on standard C
constructs.
 V. Zivojnovic, J. M. Velarde, C. Schlager and H. Meyr, "DSPstone: A
DSPoriented benchmarking methodology," Proceedings of the
International Conference on Signal Processing Applications and Technology,
pp. 715720, October 1994.
 UTDSP is a DSP
oriented suite consisting of applications and kernels.
 application benchmarks: adpcm, compress,
edge_detect, g721 (variation 1), g721
(variation b), g722, histogram, jpeg,
lpc, spectral, trellis, v32.modem.
 DSP kernels (each one has two variations): fft, fir,
iir, latnrm, lmsfir, mult.
 Mazen A. R. Saghir, ApplicationSpecific InstructionSet Architectures for
Embedded DSP Applications, Ph.D. Thesis, Department of Electrical and
Computer Engineering, University of Toronto, Canada, 1998.
 MediaBench Widely
used and referenced mediaoriented benchmark suite. MediaBench is composed of
complete applications originating from the image/video processing,
communications and DSP fields. The applications of MediaBench 1.0 are (an updated version, MediaBenchII, is expected to be
released soon): jpeg,
mpeg2, gsm, g721, pgp,
pegwit, ghostscript, mesa, rasta,
epic, adpcm.
 Chunho Lee, Miodrag Potkonjak and William H. Mangione Smith, "
MediaBench: A Tool for Evaluating and Synthesizing Multimedia and
Communications Systems," Proceedings of the 30th IEEE/ACM Symposium on
Microarchitecture, pp. 330335, December 1997.
 Jason Fritts, Architecture and Compiler Design Issues in Programmable
Media Processors, Ph.D. Thesis, Princeton University, June 2000.
 Benjamin Bishop, Thomas P. Kelliher and Mary Jane Irwin, "A Detailed
Analysis of MediaBench," Proceedings of the IEEE International Workshop
on Signal Processing Systems, pp. 448455, Taipei, Taiwan, October 1999.
 MiBench is a benchmark
suite targeting embedded processing environments. The developers of MiBench
specifically had in mind a SimpleScalar/ARM evaluation framework. It can be
considered as an opensource counterpart of the EEMBC
benchmark suite. The MiBench applications are:
 automotive:
basicmath, bitcount, qsort, susan
(3 variations).
 consumer:
jpeg, lame, mad, tiff
(4 variations), typeset.
 office:
ghostscript, ispell, rsynth, sphinx,
stringsearch.
 network: dijkstra, patricia,
(crc32, sha, blowfish are regarded as security applications).
 security: blowfish encoder,
blowfish decoder, pgp sign, pgp verify,
rijndael encoder, rijndael decoder, sha.
 telecommunications: crc32,
fft, ifft, adpcm encoder, adpcm
decoder, gsm encoder, gsm decoder.
 Matthew R. Guthaus, Jeffrey S. Ringenberg, Dan Ernst, Todd M. Austin,
Trevor Mudge and Richard B. Brown, "MiBench: A Free, Commercially
Representative Embedded Benchmark Suite," Proceedings of the IEEE 4th
Annual Workshop on Workload Characterization, December 2001.
 NetBench consists of 9
applications that are representative of commercial applications for network
processors. These can be distinguished into 3 subcategories: microlevel
programs, IPlevel programs and applicationlevel programs as following:
 microlevel programs: crc, tl (table lookup
routine).
 IPlevel programs: route (IPv4 routing), drr
(deficit roundrobin scheduling), nat (network address
translation for IP address simplification and conservation), ipchains
(firewall application).
 applicationlevel programs: url (URLbased switching), dh
(DiffieHellman public key encryption decryption mechanism), md5
(message digest algorithm).
 Gokhan Memik, William H. MangioneSmith and Wendong Hu, "NetBench: A
Benchmarking Suite for Network Processors".
 SPLASH and SPLASH2
benchmarks (Stanford Parallel Applications for Shared Memory aim the
workload characterization of multiprocessor applications. SPLASH2 consists
of:
 applications:
 barnes: BarnesHut method for Nbody simulation
 fmm: a parallel adaptive Fast Multipole Method for Nbosy
simulation
 ocean (2 variations): simulates largescale ocean movements
based on eddy and boundary currents.
 radiosity: computes the equilibrium distribution of light in
a scene using the sequential hierarchical radiosity method.
 raytrace: renders a threedimensional scene onto a twodimensional
image plane using optimized ray tracing
 volrend: renders a threedimensional volume onto a twodimensional
image plane using an optimized ray casting technique.
 waternsquared: evaluates forces and potentials that
occur over time in a system of water molecules.
 waterspatial: a different algorithm for solving the water
molecule problem.
 kernels:
 cholesky: blocked Cholesky Factorization on a sparse matrix.
 fft: a complex, onedimensional version of the "SixStep" FFT.
 lu: factors a dense matrix into the product of a lower triangular and an upper triangular matrix.
 radix: integer radix sort algorithm
 Jaswinder Pal Singh, WolfDietrich Weber and Anoop Gupta, "SPLASH: Stanford Parallel Applications for
SharedMemory," In Computer Architecture News, Vol. 20, No. 1, pp. 544.
 Steven Cameron Woo, Moriyoshi Ohara, Evan Torrie, Jaswinder Pal Singh and Anoop
Gupta,"The SPLASH2 Programs: Characterization and Methodological
Considerations," In Proceedings of the 22nd International Symposium on Computer Architecture,
pp. 2436, Santa Margherita Ligure, Italy, June 1995.
 The RAW
benchmark suite has been designed to facilitate benchmarking and
comparing reconfigurable computing systems. The benchmarks are provided in
the form of behavioral Verilog and the corresponding C versions. intmatmul
(integer matrix multiply), jacobi (differential equation solver), life
(Conway's game of life), mergesort, nqueens (Nqueens problem).
 bheap: binary heap
 bubblesort
 des: Data Encryption Standard
 fft
 graph: semiring graph benchmark
 intmatmul: integer matrix multiply
 jacobi: differential equation solver
 life: Conway's game of life
 mergesort
 nqueens: Nqueens problem
 J. Babb, M. Frank, V. Lee, E. Waingold, M. Taylor, J. Kim, S. Devabhaktuni
and A. Agarwal, "The RAW Benchmark Suite: Computation Structures for
General Purpose Computing," IEEE Symposium for Custom Computing
Machines, Napa Valley, CA, USA, April 1997.
 VersaBench
is a benchmark suite for versatile architectures. Its goal is to provide
sufficient test cases for measuring a single metric, Versatility, in order
to quantify the ability of a versatile architecture to effectively execute
a broad set of applications. The VersaBench suite consists of desktop
integer, desktop floating point, server, embedded streaming and embedded
bitlevel applications.
 desktop integer
 mcf: combinatorial optimizer
 parser: link grammar parser
 twolf: place and route simulator
 desktop floating point
 bmm: blocked matrix multiplication
 vpenta: pentadiagonal matrix inverter
 tomcatv: vectorized mesh generator
 server
 mesa: 3Dgaphics library
 mgrid: multigrid solver
 dbms: database management system
 embedded streaming
 corner: large matrix transposer
 fm: software FM radio
 beam: multichannel beamformer
 embedded bitlevel
 80211a: convolutional encoder from IEEE 802.11a standard
 8b10b: IBM 8bit/10bit block encoder
 des: ECB encoder of the Data Encryption standard
 Rodric M. Rabbah, Ian Bratt, Krste Asanovic and Anant Agarwal,
"Versatility and VersaBench: A New Metric and a Benchmark Suite for
Flexible Architectures," Technical report MITLCSTM646, Computer
Science and Artificial Intelligence Laboratory, Massachusetts Institute of
Technology, Cambridge, MA 02139, USA, June 2004.

