[Ilugc] Compiled/Interpreted languages
- From: ganesh@xxxxxxxxxxxxx (Ganesh Swami)
- Date: Thu, 8 Jan 2004 01:02:03 -0800
"BGa" == Ganesh B <bga@xxxxxxxx> writes:
BGa> On 06-Jan-04, at 12:25 PM, Ganesh Swami wrote:
>> I came across an excellent paper a while back, but
>> unfortunately can't remember the source now. STFW-ing with
>> "bytecode faster native java" throws up a couple of hits.
BGa> Aye, there lies the rub :)
Dude, throw away those crutches and learn to use a search engine. I
recommend this website:
http://www.google.com/search?q=how%20to%20use%20a%20search%20engine
Anyways, the first couple of hits:
1. Simple and effective array prefetching in Java
Abstract:
Java is becoming a viable choice for numerical algorithms due to
the software engineering benefits of object-oriented
programming. Because these programs still use large arrays that do
not fit in the cache, they continue to suffer from poor memory
performance. To hide memory latency, we describe a new unified
[...]
software prefetching algorithms for C and Fortran use locality
analysis and sophisticated loop transformations. Because our
analysis is much simpler and quicker, it is suitable for including
in a just-in-time compiler. We further show that the additional
loop transformations and careful scheduling of prefetches used in
previous work are not always necessary for modern architectures
and Java programs.
Java Grande Conference:
Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande
---8<---
2. Improving Java performance using hardware translation
Abstract:
State of the art Java Virtual Machines with Just-In-Time (JIT)
compilers make use of advanced compiler techniques, run-time
profiling and adaptive compilation to improve
performance. However, these techniques for alleviating performance
bottlenecks are more effective in long running workloads, such as
server applications. Short running Java programs, or client
workloads, spend a large fraction of their execution time in
compilation instead of useful execution when run using JIT
compilers. In ...
June 2001
Proceedings of the 15th international conference on Supercomputing
---8<---
3. Benchmarking Java against C and Fortran for scientific applications
Abstract:
Increasing interest is being shown in the use of Java for
scientific applications. The Java Grande benchmark suite [4] was
designed with such applications primarily in mind. The perceived
lack of performance of Java still deters many potential users,
despite recent advances in just-in-time (JIT) and adaptive
compilers. There are however few benchmark results available
comparing Java to more traditional languages such as C and
Fortran. To address this issue, a subset of the Java Grande
Benchmarks have been re-written in C and Fortran allowing direct
performance comparisons between the three languages. The
performance of a range of Java execution environments, C and
Fortran compilers have been tested across a number of platforms
using the suite. These demonstrate that on some platforms (notably
Intel Pentium) the performance gap is now quite small.
Java Grande Conference:
Proceedings of the 2001 joint ACM-ISCOPE conference on Java Grande
---8<---
4. Techniques for obtaining high performance in Java programs
Abstract:
This survey describes research directions in techniques to improve
the performance of programs written in the Java programming
language. The standard technique for Java execution is
interpretation, which provides for extensive portability of
programs. A Java interpreter dynamically executes Java bytecodes,
which comprise the instruction set of the Java Virtual Machine
(JVM). Execution time performance of Java programs can be improved
through compilation, possibly at the expense of portabili ...
September 2000
ACM Computing Surveys (CSUR), Volume 32 Issue 3
---8<---
[....]
happy sear^Wreading,
Ganesh
--
Ganesh Swami
If you want to get laid, go to school;
If you want to get educated, go to the library.
-- Frank Zappa.
Other related posts:
