NINJA: Java for high performance numerical computing

When Java was first introduced, there was a perception that its many benefits came at a significant performance cost. In the particularly performance-sensitive field of numerical computing, initial measurements indicated a hundred-fold performance disadvantage between Java and more established languages such as Fortran and C. Although much progress has been made, and Java now can be competitive with C/C++ in many important situations, significant performance challenges remain. Existing Java virtual machines are not yet capable of performing the advanced loop transformations and automatic parallelization that are now common in state-of-the-art Fortran compilers. Java also has difficulties in implementing complex arithmetic efficiently. These performance deficiencies can be attacked with a combination of class libraries ({\it packages}, in Java) that implement truly multidimensional arrays and complex numbers, and new compiler techniques that exploit the properties of these class libraries to enable other, more conventional, optimizations. Two compiler techniques, {\it versioning} and {\it semantic expansion}, can be leveraged to allow fully automatic optimization and parallelization of Java code. Our measurements with the NINJA prototype Java environment show that Java can be competitive in performance with highly optimized and tuned Fortran code.

[1]  Guy L. Steele,et al.  The Java Language Specification , 1996 .

[2]  Samuel P. Midkiff,et al.  Quicksilver: a quasi-static compiler for Java , 2000, OOPSLA '00.

[3]  Wolfgang Niem,et al.  A Virtual Studio for Live Broadcasting: The Mona Lisa Project , 1996, IEEE Multim..

[4]  Samuel P. Midkiff,et al.  Java programming for high-performance numerical computing , 2000, IBM Syst. J..

[5]  José E. Moreira,et al.  Design and evaluation of a linear algebra package for Java , 2000, JAVA '00.

[6]  Jack Dongarra,et al.  Java Access to Numerical Libraries , 1997 .

[7]  Samuel P. Midkiff,et al.  Efficient support for complex numbers in Java , 1999, JAVA '99.

[8]  Ronald F. Boisvert,et al.  Developing numerical libraries in Java , 1998, Concurr. Pract. Exp..

[9]  Jack J. Dongarra,et al.  Solving linear systems on vector and shared memory computers , 1990 .

[10]  Fred G. Gustavson,et al.  Recursion leads to automatic variable blocking for dense linear-algebra algorithms , 1997, IBM J. Res. Dev..

[11]  Michael Wolfe,et al.  High performance compilers for parallel computing , 1995 .

[12]  Samuel P. Midkiff,et al.  High Performance Numerical Computing in Java: Language and Compiler Issues , 1999, LCPC.

[13]  Vivek Sarkar,et al.  Automatic selection of high-order transformations in the IBM XL FORTRAN compilers , 1997, IBM J. Res. Dev..

[14]  Michael Philippsen,et al.  Java and numerical computing , 2001, Comput. Sci. Eng..

[15]  Mithuna Thottethodi,et al.  Nonlinear array layouts for hierarchical memory systems , 1999, ICS '99.

[16]  Steven S. Muchnick,et al.  Advanced Compiler Design and Implementation , 1997 .