OPTIMIZING THE JAVA VIRTUAL MACHINE INSTRUCTION SET BY ...

78
presented in Chapter 4 were the branch despecializations involving a swap bytecode
(if icmplt and if icmple), and the widening despecializations for bipush, sipush,
ldc, goto and jsr.
5.1.1 Benchmarks
A total of 20 benchmarks were considered in this study. These include the 7 benchmarks
from the SPEC JVM98 suite described in Section 4.2.2. In addition, the Java
Grande Forum Benchmark Suite [3, 29, 28] (which contains 12 benchmarks) and the
SciMark 2.0 benchmark [92] were also considered. Each benchmark is briefly described
in the following paragraphs.
JGF Crypt: This benchmarks performs International Data Encryption
Algorithm (IDEA) encryption on an array of three million bytes. The
algorithm makes heavy use of bit and byte manipulation operations.
JGF Euler: A set of time-dependent Euler equations describing the flow
through an obstructed channel are solved by this benchmark. The problem
is modeled using a mesh of 64 by 256 elements. The solution is achieved
using a fourth order Runge-Kutta method with both second and fourth
order damping.
JGF FFT: This benchmark performs a one-dimensional forward transform
on 2097152 complex numbers. It makes extensive use of complex arithmetic,
non-constant memory references and trigonometric functions.
JGF HeapSort: An array of 1000000 integers is sorted using a heap sort
algorithm.
JGF LUFact: This benchmark solves 500 by 500 linear system using LU
factorization and a triangular solve. This benchmark is considered to be
memory and floating point arithmetic intensive.
JGF MolDyn: A set of 2048 particles are modeled by this benchmark. They
are interacting under a Lennard-Jones potential in a cubic spatial volume
with periodic boundary conditions.
JGF MonteCarlo: This financial simulation uses the value of underlying
assets to price products using Monte Carlo techniques. A 2000 sample
time series is generated with the same mean and fluctuation as a series of
historical data.