Jacob M, Philippsen M, Karrenbach M (1998)
Publication Language: English
Publication Type: Journal article, Original article
Publication year: 1998
Publisher: Wiley-Blackwell
Book Volume: 10
Pages Range: 1143-1154
Journal Issue: 11-13
URI: http://www2.informatik.uni-erlangen.de/publication/download/veltran.pdf
DOI: 10.1002/(SICI)1096-9128(199809/11)10:11/13<1143::AID-CPE394>3.0.CO;2-W
Java is often accused of being too slow for serious programming, especially for scientific problem solving. However, we 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). The moderate slow-down is easily offset by the following advantages: (a) object-oriented Java code is easier to maintain and reuse than Fortran code; (b) Java code is fully portable, even among parallel computers with different memory models. Furthermore, better compiler technology is on the horizon, which will narrow the performance gap even more.
APA:
Jacob, M., Philippsen, M., & Karrenbach, M. (1998). Large-scale parallel geophysical algorithms in Java: A feasibility study. Concurrency and Computation-Practice & Experience, 10(11-13), 1143-1154. https://dx.doi.org/10.1002/(SICI)1096-9128(199809/11)10:11/13<1143::AID-CPE394>3.0.CO;2-W
MLA:
Jacob, Matthias, Michael Philippsen, and Martin Karrenbach. "Large-scale parallel geophysical algorithms in Java: A feasibility study." Concurrency and Computation-Practice & Experience 10.11-13 (1998): 1143-1154.
BibTeX: Download