A benchmark suite for high performance Java

@article{Bull2000ABS,
  title={A benchmark suite for high performance Java},
  author={Jonathan Mark Bull and L. A. Smith and Martin D. Westhead and David Henty and R. A. Davey},
  journal={Concurr. Pract. Exp.},
  year={2000},
  volume={12},
  pages={375-388}
}
Increasing interest is being shown in the use of Java for large scale or Grande applications. This new use of Java places specific demands on the Java execution environments that could be tested and compared using a standard benchmark suite. We describe the design and implementation of such a suite, paying particular attention to Java-specific issues. Sample results are presented for a number of implementations of the Java Virtual Machine (JVM). Copyright © 2000 John Wiley & Sons, Ltd. 

Figures from this paper

Benchmarking Java Grande Applications

The performance of a range of Java execution environments have been tested using the Java Grande benchmark suite and the results presented.

A Parallel Java Grande Benchmark Suite

A suite of parallel benchmarks has been developed from the serial Java Grande benchmark suite, using three parallel programming models: Java native threads, MPJ (a message passing interface) and JOMP (a set of OpenMP-like directives).

A Multithreaded Java Grande Benchmark Suite

A suite of shared memory paral lel benchmarks has been developed from the serial Java Grande benchmark suite, using Java native threa ds.

Benchmarking Java against C and Fortran for scientific applications

A subset of the Java Grande benchmarks has been re‐written in C and Fortran allowing direct performance comparisons between the three languages.

JVM versus CLR: a comparative study

We present empirical evidence to demonstrate that there is little or no difference between the Java Virtual Machine and the .NET Common Language Runtime, as regards the compilation and execution of

A Novel Approach for Analysis of CLR & JVM by Performance Metrics – A Survey

The evidence to prove difference between the Java Virtual Machine (JVM) and Common Language Runtime (CLR) is shown with Execution time, Memory Management and Garbage Collection while executing the programs.

Benchmarking the CLI for high performance computing

  • W. Vogels
  • Computer Science
    IEE Proc. Softw.
  • 2003
Whether the common language infrastructure has any future in the high-performance computing community is reviewed by benchmarking three implementations of the CLI and comparing those with the results on Java virtual machines.

Evaluation and optimization of method calls in Java

A new heuristic methodology is proposed which allows us to consider whole sequences of methods for the inlining decision and not only simple couples of caller–callee methods.

EPCC-SSP 00-03 Benchmarking , Profiling and Performance Analysis of the Java Grande Benchmarking Suite

A new set of benchmarks are conducted and the relationship between benchmarks within the Java Grande Benchmarking suite is investigated, while reviewing the various profiling utilities available for Java.

How java programs interact with virtual machines at the microarchitectural level

The goal of this paper is to study this complex interaction between the Java application, its input and the virtual machine it runs on at the microarchitectural level by measuring a large number of performance characteristics using performance counters on an AMD K7 Duron microprocessor.
...

References

SHOWING 1-10 OF 19 REFERENCES

Large-scale parallel geophysical algorithms in Java: a feasibility study

It is found that for a large-scale geophysical application, Java code compiled with current just-in-time compilers runs slower than Fortran by a factor of at most 4, on both a shared-memory parallel machine (SGI Origin2000) and a distributed-memory Parallel machine (IBM SP/2).

A framework for benchmark performance analysis

A methodology is proposed for the sensible analysis of computer benchmark results, and results from a parallelised particle/mesh (PIC) code, the Genesis LPM1 benchmark are illustrated.

Markov Ciphers and Differential Cryptanalysis

It is shown that PES (8) and PES(16) are immune to differential cryptanalysis after sufficiently many rounds, and a new design principle for Markov ciphers, viz., that their transition probability matrices should not be symmetric is suggested.

Performance of various computers using standard linear equations software

This report compares the performance of different computer systems in solving dense systems of linear equations, ranging from a CRAY Y-MP to scientific workstations such as the Apollo and Sun to IBM PCs.

OCCOMM Benchmarking Guide. Version 1.2, Daresbury Laboratory Technical Report

  • OCCOMM Benchmarking Guide. Version 1.2, Daresbury Laboratory Technical Report
  • 1996

BenchBeans: A Benchmark for Java Applets

  • BenchBeans: A Benchmark for Java Applets

A Social Science Benchmark (SSB/1) Code for Serial, Vector and Parallel Supercomputers

  • Geographical and Environment Modelling,
  • 1997

A distributed raytracer for benchmarking Java RMI and Serialization

  • A distributed raytracer for benchmarking Java RMI and Serialization

Large-scale parallel geophysical algorithms in Java: a feasibility study, Concurrency: Practice and Experience

  • Large-scale parallel geophysical algorithms in Java: a feasibility study, Concurrency: Practice and Experience
  • 1998

Linpack benchmark: Java version

  • Linpack benchmark: Java version