Java for large-scale scientific computations?

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

Volumn 2179, Issue , 2001, Pages 228-235

  Krall, Andreas ^a   Tomsich, Philipp ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b HEWLETT PACKARD ENTERPRISE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; C (PROGRAMMING LANGUAGE); DIGITAL ARITHMETIC; OBJECT ORIENTED PROGRAMMING; PROGRAM COMPILERS;

CURRENT GENERATION; GARBAGE COLLECTION; LANGUAGE FEATURES; PORTABLE INTERNET; SCIENTIFIC APPLICATIONS; SCIENTIFIC COMPUTATION; SOFTWARE PROJECT; STATE OF THE ART;

JAVA PROGRAMMING LANGUAGE;

EID: 84944889679     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45346-6_23     Document Type: Conference Paper

References (18)

1. R. Bodik, R. Gupta, and V. Sarkar. ABCD: Eliminating array bound checks on demand, in Conference on Programming Language Design and Implementation, SIGPLAN, Vancouver, ACM, 35(5), 321–333, 2000.
2. D. F. Bacon, R. Konuru, C. Mruthy, and M. Serrano. Thin locks: Featherweight synchronization for Java, in Conference on Programming Language Design and Implementation, SIGPLAN, Montreal, ACM, 33(5), 258–268, 1998.
3. D. Detlefs and O. Agesen. The case for multiple compilers, in Proc. OOPSLA 1999 VM Workshop on Simplicity, Performance and Portability in Virtual Machine Design, 1997.
4. R. Fitzgerald, T. B. Knoblock, E. Ruf, B. Steensgaard, and D. Tarditi. Marmot: an optimizing compiler for Java, Software – Practice and Experience, 30(3), 199–232, 2000.
5. S. Gehmawat, K. H. Randall, and D.J. Scales. Field analysis: Getting useful and low-cost interprocedural information, in Conference on Programming Language Design and Implementation, SIGPLAN, Vancouver, ACM, 35(5), 334–344, 2000.
6. A. Krall and R. Grafl. CACAO – a 64 bit JavaVM just-in-time compiler, Concurrency: Practice and Experience, 9(11), 1017–1030, 1997.
7. A. Krall and M. Probst. Monitors and exceptions: How to implement Java efficiently, Concurrency: Practice and Experience, 10(11–13), 837–850, 1998.
8. A. Krall. Efficient JavaVM just-in-time compilation, in Jean-Luc Gaudiot, (ed.), International Conference on Parallel Architectures and Compilation Techniques, Paris, IFIP,ACM,IEEE, North-Holland, 205–212, 1998.
9. A. Krall and P. Tomsich. Garbage collection for large memory Java applications, in Proc. of the 7th European Conference on High-Performance Computing and Networking (HPCN Europe’99), Lecture Notes in Computer Science,1593, Springer Verlag, 895–907, 1999.
10. J. E. Moreira, S. P. Midkoff, M. Gupta, P. V. Artigas, M. Snir, and R. D. Lawrence. Java programming for high-performance numericalcomputing, IBM Systems Journal, 39(1), 21–56, 2000.
11. NaturalBridge. BulletTrainTM optimizing compiler and runtime for JVM bytecode, http://www.naturalbridge.com.
12. P. Pominville, F. Quian, R. Vallee-Rai, L. Hendren, and C. Verbrugge. A framework for optimizing Java using attrributes, in CASCON, Mississauga, IBM, 2000.
13. E. Ruf. Effective synchronization removalfor Java, in Conference on Programming Language Design and Implementation, SIGPLAN, Vancouver, ACM, 35(5) 208– 218, 2000.
14. T. Suganuma, T. Ogasawara, M TaT Yasuekeuchi, M Kawahito, K Ishizaki and H. Komatsuatani. Overview of the IBM Java just-in-time compiler, IBM Systems Journal, 39(1), 175–193, 2000.
15. D. J. Scales, K. H. Randall, S. Ghemawat, and J. Dean. The Swift compiler: Design and implementation, Technical Report 2000/2, Compaq Western Research Laboratory, April 2000.
16. T. Smith, S. Srinivas, P. Tomsich, and J. Park. Practicalexp eriences with Java compilation, in Proceedings of the Intl. Conf. on High-Performance Computing, Lecture Notes in Computer Science, Springer, 1970, 2000.
17. Tower Technologies. TowerJ 3.0: A new generation native Java compiler and runtime environment, http://www.towerj.com.
18. J. Vitek, N. Horspool, and A. Krall. Efficient type inclusion tests, in T. Bloom, (ed.), Conference on Object Oriented Programming Systems, Languages & Applications (OOPSLA’97), Atlanta, ACM, 142–157, 1997.