No Images Added Yet

Improve the performance of your Java code

Not Rated Yet.
Add to Favorites
Publisher
Dynamic compilation maintains the language's semantics while static compilation often doesn't.
Product Details

Many algorithms are expressed most concisely as tail-recursive methods. Compilers can automatically transform such methods into loops and thereby improve program performance, but this transformation is not required by the Java language specification, so not all JVMs will perform it. This means that tail-recursive methods in the Java language can result in unexpectedly large memory usage. This article demonstrates that dynamic compilation maintains the language's semantics while static compilation often doesn't. Learn why this matters and get a bit of code to help you determine whether your just-in-time (JIT) compiler can transform tail recursion on code while preserving semantics.

Report this Listing
Price
Free
Licence Type
Free
Views
1,109
Submitted on
2nd June 2001
Last Updated
2nd June 2001

You May Also Like

User Reviews

Please rate the listing and tell the world know what do you think about the listing.
(0 ratings)
Not Rated Yet.
No reviews found.
Not yet reviewed by any member. You can be the first one to write a review for this listing.Click hereto submit your review.