Home » Coding

Fast Bytecodes for Funny Languages

8 December 2008 No Comment

In this presentation from the JVM Languages Summit 2008, Cliff Click discusses how to optimize generated bytecode for running on the JVM. Click analyzes and reports on Java, Scala, Clojure, JRuby, JPC and JavaScript/Rhino and points out several places where each of them could increase their performance such as elimination of FixNums, escape analysis and best practices for testing bytecode.

Watch this video on infoq.com

Related Posts:

Comments:

Add your comment below, or trackback from your own site. You can also subscribe to these comments via RSS.

Be nice. Keep it clean. Stay on topic. No spam.

You can use these tags:
<a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>

This is a Gravatar-enabled weblog. To get your own globally-recognized-avatar, please register at Gravatar.

*