From flop to megaflops: Java for technical computing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1656, Issue , 1999, Pages 1-17

  Moreira, J E ^a   Midkiff, S P ^a   Gupta, M ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAM COMPILERS;

BOUNDS CHECK; INTENSIVE COMPUTING; LOOP NESTS; MATRIX MULTIPLY; TECHNICAL COMPUTING; TEST CASE;

JAVA PROGRAMMING LANGUAGE;

EID: 84947938721     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48319-5_1     Document Type: Conference Paper

References (37)

1. J.M. Asuru. Optimization of array subscript range checks. ACM Letters on Pro-gramming Languages and Systems, 1(2):109-118, June 1992.
2. C. A. Atwood, R. P. Garg, and D. DeRyke. A prototype computational fluid dynamics case study in Java. Concurrency, Pract. Exp. (UK), 9(11):1311-18, November 1997. Java for Computational Science and Engineering -Simulation and Modeling II Las Vegas, NV, USA 21 June 1997.
3. U. Banerjee. Unimodular transformations of double loops. In Proc. Third Work-shop on Programming Languages and Compilers for Parallel Computing, Irvine, California, August 1990.
4. A. Bik and D. Gannon. javab manual version 1.0 BETA. In ACM 1998 Work-shop on Java for High-Performance Network Computing. ACM SIGPLAN, 1998. Available at URL http://www.cs.ucsb.edu/conferences/java98.
5. A. Bik, J. Villacis, and D. Gannon. javar: A prototype Java restructuring com-piler. Concurrency, Pract. Exp. (UK), 9(11):1181-91, November 1997. Java for Computational Science and Engineering -Simulation and Modeling II Las Vegas, NV, USA 21 June 1997.
6. R. F. Boisvert, J. J. Dongarra, R. Pozo, K. A. Remington, and G. W. Stew-art. Developing numerical libraries in Java. In ACM 1998 Workshop on Java for High-Performance Network Computing. ACM SIGPLAN, 1998. Available at http://www.cs.ucsb.edu/conferences/java98.
7. Z. Budimlic and K. Kennedy. Optimizing Java: Theory and practice. Concurrency, Pract. Exp. (UK), 9(11):445-63, November 1997. Java for Computational Science and Engineering -Simulation and Modeling II Las Vegas, NV, USA 21 June 1997.
8. D. Callahan, S. Carr, and K. Kennedy. Improving register allocation for subscripted variables. In Proc. ACM SIGPLAN '90 Conference on Programming Language Design and Implementation, White Plains, NY, June 1990.
9. H. Casanova, J. Dongarra, and D. M. Doolin. Java access to numerical libaries. Concurrency, Pract. Exp. (UK), 9(11):1279-91, November 1997. Java for Com-putational Science and Engineering -Simulation and Modeling II Las Vegas, NV, USA 21 June 1997.
10. IBM Corporation. IBM High Performance Compiler for Java, 1997. Available for download at http://www.alphaWorks.ibm.com/formula.
11. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the 4'th ACM Symposium on Principles of Programming Languages, pages 238-252, January 1977.
12. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Conference Record of the 5'th ACM Symposium on Principles of Programming Languages, pages 84-96, January 1978.
13. P. Cousot and N. Halbwachs. Automatic proofs of the absence of common run-time errors. In Conference Record of the 5'th ACM Symposium on Principles of Programming Languages, pages 105-118, January 1978.
14. J.J. Dongarra, I.S. Duff, D.C. Sorensen, and H.A. van der Vorst. Solving Linear Systems on Vector and Shared Memory Computers. Society for Industrial and Applied Mathematics, 1991.
15. J. Ferrante, V. Sarkar, and W. Thrash. On estimating and enhancing cache ef-fectiveness. In Proc. Fourth Workshop on Programming Languages and Compilers for Parallel Computing, August 1991.
16. Java Grande Forum. Issues in numerical computing with Java. Document available at URL http://math.nist.gov/javanumerics/issues.html, March 1998.
17. James Gosling. The evolution of numerical computing in Java. Document available at Web-page http://java.sun.com/people/jag/FP.html. Sun Microsystems.
18. James Gosling, Bill Joy, and Guy Steele. The Java(TM) Language Specification. Addison-Wesley, 1996.
19. R. Gupta. A fresh look at optimizing array bounds checking. In Proceedings of the ACM SIGPLAN '90 Conference on Programming Language Design and Imple-mentation, pages 272-282, June 1990.
20. R. Gupta. Optimizing array bound checks using flow analysis. ACM Letters on Programming Languages and Systems, 2(1-4):135-150, March-December 1993.
21. W.H. Harrison. Compiler analysis for the value ranges for variables. IEEE Trans-actions on Software Engineering, SE3(3):243-250, May 1977.
22. International Business Machines Corporation. IBM Engineering and Scientific Subroutine Library for AIX -Guide and Reference, December 1997.
23. P. Kolte and M. Wolfe. Elimination of redundant array subscript range checks. In Proceedings of the ACM SIGPLAN '95 Conference on Programming Language Design and Implementation, pages 270-278, Jun 1995.
24. V. Markstein, J. Cocke, and P. Markstein. Elimination of redundant array sub-script range checks. In Proceedings of the ACM SIGPLAN '82 Conference on Programming Language Design and Implementation, pages 114-119, June 1982.
25. Sun Microsystems. Sun proposes modification to Java programming languages's floating point specification. http://www.sun.com/smi/Press/sunflash/9803/sunflash.980324.17.html, 1998.
26. S. P. Midkiff, J. E. Moreira, and M. Gupta. Method for optimizing array bounds checks in programs. Patent pending, IBM Docket #YO-998-052, filed with U. S. Patent Office, April 24th, 1998.
27. S.P. Midkiff, J.E. Moreira, and M. Snir. Optimizing bounds checking in java pro-grams. IBM Systems Journal, 37(3):409-453, August 1998.
28. J. E. Moreira, S. P. Midkiff, and M. Gupta. From flop to megaflops: Java for technical computing, 1998. Submitted to ACM TOPLAS, IBM Research Report 21166.
29. D. Orchard. Better peformance with exceptions in Java. Byte, pages 53-54, March 1998. In the Core Programming feature.
30. V. Sarkar. Automatic selection of high-order transformations in the IBM XL For-tran compilers. IBM Journal of Research and Development, 41(3), May 1997.
31. M. Schwab and J. Schroeder. Algebraic java classes for numerical optimization. In ACM 1998 Workshop on Java for High-Performance Network Computing. ACM SIGPLAN, 1998. Available at http://www.cs.ucsb.edu/conferences/java98.
32. B. Schwarz, W. Kirchgassner, and R. Landwehr. An optimizer for Ada -design, experience and results. In Proceedings of the ACM SIGPLAN '88 Conference on Programming Language Design and Implementation, pages 175-185, June 1988.
33. V. Seshadri. IBM high performance compiler for Java. AIXpert Magazine, September 1997. Electronic publication available at URL http://www.developer.ibm.com/library/aixpert.
34. Proposal for extension of java floating point in jdk 1.2. http://java.sun.com/feedback/fp.html, 1998.
35. M. E. Wolf and M. S. Lam. A loop transformation theory and an algorithm to maximize parallelism. IEEE Transactions on Parallel and Distributed Systems, 2(4):452-471, October 1991.
36. M. J. Wolfe. Iteration space tiling for memory hierarchies. In Proc. 3rd SIAM Con-ference on Parallel Processing for Scientific Computing, pages 357-361, Philadel-phia, PA, 1987.
37. M. J. Wolfe. Optimizing Supercompilers for Supercomputers. The MIT Press, 1989.