I recently did a benchmark (admittedly in hindsight not a particularly good one) that involved comparison of an implementation of the same small program in Java<https://github.com/logicchains/ArrayAccessBench/blob/master/Java3.java>and in Clojure<https://github.com/logicchains/ArrayAccessBench/blob/master/cjmt/src/cjmt/core.clj>, in which most of the time is spent in bignum operations. The results are at this link<http://togototo.wordpress.com/2014/02/22/memory-access-microbenchmark-clojure-f-go-julia-lua-racket-ruby-self/>(the tables at the top; ignore the rest). The Clojure implementation appears to consistently perform better than the Java implementation (at least on this setup, x86-64 Linux with OpenJDK 1.7.0_25). I'd be interested to learn what Clojure does to make it perform faster than Java in this case, so I thought here might be a good place to ask.
-- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en --- You received this message because you are subscribed to the Google Groups "Clojure" group. To unsubscribe from this group and stop receiving emails from it, send an email to clojure+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
