Re: when performance matters

On Jan 13, 10:07 am, cliffc wrote: > Some comments: > > 1- If you think that HotSpot/Java is slower than C++ by any > interesting amount, I'd love to see the test case.  Being the > architect of HotSpot "-server" I've a keen interest in where > performance isn't on par with C.   -snip- > 5- T

Re: when performance matters

On Jan 13, 4:30 am, Mark P wrote: > On Jan 13, 5:49 pm, Zak Wilson wrote: > > > You're probably thinking of > > this:http://www.flownet.com/gat/papers/lisp-java.pdf > > Thanks for the link. > > > There's also the (in)famous language benchmark > > site:http://shootout.alioth.debian.org/ > > Th

Re: when performance matters

On Jan 13, 4:41 am, "Eric Lavigne" wrote: > > > There's also the (in)famous language benchmark > > > site:http://shootout.alioth.debian.org/ > > > This is primarily what I was going on.  I realize no > > benchmarking approach is going to be perfect, but > > this attempt doesn't seem too bad.  I

Re: when performance matters

On Jan 13, 10:07 am, cliffc wrote: -snip- > 5- The debianshootoutresults generally badly mis-represent Java. > Most of them have runtimes that are too small (<10sec) to show off the > JIT, and generally don't use any of the features which commonly appear > in large Java programs (heavy use of v

Re: Clojure performance tests and clojure a little slower than Java

On Jul 27, 2:26 pm, AndyF wrote: -snip- > I thought it was interesting that even the Haskell entry to the k- > nucleotide benchmark uses a *mutable* hash table (at least, I think > they are from the discussion on the Wiki page linked below -- my > Haskell knowledge isn't extensive enough to und

Re: Pure-functional N-body benchmark implementation

On Aug 10, 3:00 pm, Andy Fingerhut wrote: > On Aug 10, 2:19 pm, Jonathan Smith wrote: > > > 1.) use something mutable > > 2.) unroll all the loops (mapping is a loop) > > 3.) try not to coerce between seq/vec/hash-map too much. > > > in real world, stuff like theshootoutis pretty useless, as g

Re: Clojure Performance For Expensive Algorithms

On Sunday, February 24, 2013 9:33:52 AM UTC-8, Marko Topolnik wrote: > > For example, Scala beats Java by a wide margin on some benchmarks. Turns > out it's because it uses JNI to solve the problem with the C bignum > library. > Turns out the benchmarks game website shows both Scala program

Re: Clojure Performance For Expensive Algorithms

On Sunday, February 24, 2013 1:45:33 PM UTC-8, Ben Mabey wrote: > > Yeah, I wish the Benchmarks allowed for idiomatic submissions and finely > tuned submissions. > So you wish the benchmarks game website would show, for example, both pi-digits programs that use BigInteger and pi-digits progra

Re: Clojure Performance For Expensive Algorithms

On Tuesday, February 26, 2013 12:50:17 PM UTC-8, Marko Topolnik wrote: > > Again, only the fastest entries are shown. > True, except for the special-case included to show that programs can be made slower (and sometimes more concise) -- the shortest C++ programs. If idiomatic Clojure was used

Re: Clojure Performance For Expensive Algorithms

On Wednesday, February 27, 2013 1:13:10 AM UTC-8, Marko Topolnik wrote: > > On Wednesday, February 27, 2013 5:19:20 AM UTC+1, Isaac Gouy wrote: > >> >> If idiomatic Clojure was used... >>> >> >> The problem, of course, is that: the code one-person con

Re: Clojure Performance For Expensive Algorithms

On Wednesday, February 27, 2013 9:48:15 AM UTC-8, Marko Topolnik wrote: > However, if someone comes along with *(let [m (HashMap.)] (loop > []...(recur (.put m ...)))* claiming that is in fact idomatic, he's just > being unreasonable---by everyone's agreement. > You don't think there are fas

Re: Clojure Performance For Expensive Algorithms

On Wednesday, February 27, 2013 2:46:25 PM UTC-8, Ben Mabey wrote: > > On 2/27/13 9:59 AM, Isaac Gouy wrote: > > (defn blank? [s] (every? #(Character/isWhitespace %) s)) >> >> Have you ever wondered about its performance? >> > > No. Why would I wonder

AOT compilation newbie mistakes

$ /usr/local/src/jdk1.6.0_18/bin/java -cp .:clojure.jar clojure.main Clojure 1.2.0 user=> (compile 'clojure.examples.hello) java.io.IOException: No such file or directory (hello.clj:1) $ ls clojure/examples hello.clj $ cat clojure/examples/hello.clj (ns clojure.examples.hello (:gen-class))

Re: AOT compilation newbie mistakes

On Aug 22, 3:06 pm, Robert McIntyre wrote: > I feel like a lot of people have trouble with this (I certainly do!) > so I made this tutorial with working examples to follow. > this is by default the $PROJECT-DIR/classes folder Is there a way to set that default to something else? Maybe using

Re: AOT compilation newbie mistakes

On Aug 22, 3:06 pm, Robert McIntyre wrote: > I feel like a lot of people have trouble with this (I certainly do!) > so I made this tutorial with working examples to follow. Thanks $ /usr/local/src/jdk1.6.0_18/bin/java -cp .:clojure.jar - Dclojure.compile.path=. clojure.main Clojure 1.2.0 user

Re: AOT compilation newbie mistakes

On Aug 22, 4:28 pm, Robert McIntyre wrote: > oh yes -- please don't do it manually for anything "production" > > But, it's good to know what's actually going on behind the scenes, > especially when things stop working :) For my simple needs - java -cp .:clojure.jar -Dclojure.compile.path=

Clojure 1.2 and the Computer Language Benchmarks Game

Now Clojure 1.2 has been released, Clojure programs will be included in the Computer Language Benchmarks Game. If you'd like to contribute Clojure programs, please follow the step- by-step http://shootout.alioth.debian.org/help.php#contribute -- You received this message because you are subscri

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Aug 23, 7:07 pm, ataggart wrote: > It's never been clear to me exactly what the code is supposed to be > do. For example, the "spec" for the binary-tree test is so wholly > lacking in any details that I'm left to infer that one is supposed to > copy an implementation used previously, though w

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Aug 23, 7:35 pm, Robert McIntyre wrote: > I hear you --- I got excited about this too, and implemented the fannuchredux > algorithm, only to be thwarted by an undocumented "checksum" each > program is also > supposed to calculate.  This checksum depends heavily on the exact > order in which >

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Aug 24, 6:44 am, Stuart Halloway wrote: > Clojure 1.3's performance improvements will significantly impact perf on some > of the benchmarks. If you are trying these out, please try them on both 1.2 > and 1.3. Has Clojure 1.3 been released? > Also: the benchmarks are totally a numbers ga

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Aug 24, 8:48 am, Stuart Halloway wrote: > > On Aug 24, 6:44 am, Stuart Halloway wrote: > >> Clojure 1.3's performance improvements will significantly impact perf on > >> some of the benchmarks. If you are trying these out, please try them on > >> both 1.2 and 1.3. > > > Has Clojure 1.3 bee

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Aug 24, 9:58 am, Nicolas Oury wrote: > On Tue, Aug 24, 2010 at 5:33 PM, Isaac Gouy wrote: > > > Well when Clojure 1.3 is released... > > > The phrase "idiomatic code" often seems to be used to mean - code > > written in a natural way for that langu

Re: Clojure 1.2 and the Computer Language Benchmarks Game

r addition and one integer subtraction per node take a significant amount of time? > > On Aug 24, 5:55 am, Isaac Gouy wrote: > > > On Aug 23, 7:07 pm, ataggart wrote: > > > > It's never been clear to me exactly what the code is supposed to be > > > do.

Re: Clojure 1.2 and the Computer Language Benchmarks Game

g a particular design goal. After so many people have contributed programs for binary-trees in so many languages, I had been assuming it was kind-of easy. > Time to move on to something productive. > > On Aug 24, 11:17 am, Isaac Gouy wrote:> On Aug 24, > 9:50 am, ataggart wrote

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Aug 25, 6:17 am, John Fingerhut wrote: > I will try submitting one or a few of my benchmark programs created 1 year > ago. > > For anyone that wants to look at some timing results and/or my source code > used to achieve them before then, they are available on github here: > > http://github.co

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Aug 25, 10:31 pm, Meikel Brandmeyer wrote: > Hi, > > On 26 Aug., 05:37, Isaac Gouy wrote: > > > 1) The command line requested for these first programs doesn't AOT > > compile so the measured time includes compiling the program. > > Which makes the comparis

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Aug 26, 12:26 am, Meikel Brandmeyer wrote: > Hi, > > On 26 Aug., 07:58, Isaac Gouy wrote: > > > Have you actually measured the time difference? If you have measured the time difference with/without AOT compilation then apparently you don't wish to share thos

Re: Clojure 1.2 and the Computer Language Benchmarks Game

exdna&lang=clojure&id=2 http://shootout.alioth.debian.org/u32q/program.php?test=knucleotide&lang=clojure&id=1 > > Andy > > On Thu, Aug 26, 2010 at 12:26 AM, Meikel Brandmeyer wrote: > > Hi, > > > On 26 Aug., 07:58, Isaac Gouy wrote: > > > >

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Sep 1, 9:46 pm, John Fingerhut wrote: > Thanks to many people on this list in Aug 2009 who helped improve my code, > to Johannes Friestad for writing a nice fast Clojure program using deftype > for the n-body problem, to Isaac Gouy for setting up the shootout web site > to ac

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Sep 2, 5:28 pm, Sean Corfield wrote: > On Wed, Sep 1, 2010 at 9:46 PM, John Fingerhut > wrote: > > You can see a brief summary of results comparing > > run time, memory, and code size against "Java 6 -server" here: > >http://shootout.alioth.debian.org/u32/benchmark.php?test=all〈=clo... > >

Re: Shootout "fannkuch"

On Sep 2, 11:45 pm, John Fingerhut wrote: > Most likely.  That one I found somewhat annoying in that the checksum > computation does depend upon the permutations being generated in a > particular order. Fannkuch has required the permutations to be generated in a particular order for years becau

Re: Shootout "fannkuch"

On Sep 2, 11:01 pm, Miki wrote: > Hello, > > I've tried writing a a solution to shootout "fannkuch" (http:// > shootout.alioth.debian.org/u32/performance.php?test=fannkuchredux), > however I seem to have a bug in the checksum. Is it just the order of > permutations or am I missing something? I

Re: Shootout "fannkuch"

On Sep 3, 4:24 pm, Miki wrote: > > Fannkuch has required the permutations to be generated in a particular > > order for years because too many programmers contributed programs that > > did not generate some of the permutations or used faster algorithms to > > generate the permutations. > > I've

Re: Shootout "fannkuch"

On Sep 3, 4:24 pm, Miki wrote: > > Fannkuch has required the permutations to be generated in a particular > > order for years because too many programmers contributed programs that > > did not generate some of the permutations or used faster algorithms to > > generate the permutations. > > I've

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Sep 2, 4:51 pm, Isaac Gouy wrote: > On Sep 1, 9:46 pm, John Fingerhut wrote: > > > Thanks to many people on this list in Aug 2009 who helped improve my code, > > to Johannes Friestad for writing a nice fast Clojure program using deftype > > for the n-body problem, t

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Sep 9, 6:06 pm, gary ng wrote: > On Thu, Sep 2, 2010 at 6:07 PM, John Fingerhut > wrote: > > Some of the Haskell submissions are quite long for what they do.  The > > k-nucleotide one, for example, implements a mutable hash table using > > features in Haskell that I had never seen before lo

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Sep 9, 7:19 pm, gary ng wrote: > On Thu, Sep 9, 2010 at 7:02 PM, Isaac Gouy wrote: > > iirc the Haskell programs, and the Clean programs, and the Pascal > > programs, and ... use translations of the simple hash table used by > > the C programs. > > > If I eve

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Sep 9, 10:15 pm, gary ng wrote: > On Thu, Sep 9, 2010 at 10:04 PM, Isaac Gouy wrote: > > Is there any point speculating about this as outsiders? > > > It was available - Data.HashTable seems to be copyright 2003. > > >http://ogi.altocumulus.org/~hallgren/Prog

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Sep 10, 10:35 am, gary ng wrote: > On Fri, Sep 10, 2010 at 8:49 AM, Isaac Gouy wrote: > >> Huh ? point ? it was just a casual comment, no point was intended. And > >> I have read some comments by Don that what is in the shoutout is way > >> faster than Data.Has

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Sep 10, 11:54 am, gary ng wrote: > On Fri, Sep 10, 2010 at 11:13 AM, Isaac Gouy wrote: > > Clearly, they did choose "to write all that code" "in order to get a > > much faster program" - I can't tell you if Andy had noticed the > > benchmar

Re: Clojure 1.2 and the Computer Language Benchmarks Game

On Sep 10, 2:22 pm, gary ng wrote: -snip- > My initial comment was all about 'it seems that Haskell submission is > not the typical elegant form' and to me because of the specific you > want to measure, there is no acceptable elegant Haskell form. So what are we to do when there's a problem tha

Clojure Dev: How you can help! (Hint: Alioth Benchmarks)

1) When I saw this posting on Clojure Dev a month ago http://groups.google.com/group/clojure-dev/browse_thread/thread/2abe6d79087af4fc/9030a0b0c15f26a2?hl=en&ie=UTF-8&q=alioth+shootout+clojure&pli=1 I recognised the desire to have some quick and dirty performance regression testing, the Scala dev

Re: A Performance Comparison of SBCL & Clojure

On Friday, September 7, 2012 1:12:44 AM UTC-7, Andy Fingerhut wrote: > > Since my last message, I personally have only submitted a new faster > Clojure program for the knucleotide problem on the Benchmarks Game site. I > haven't checked whether other Clojure programs have been submitted in tha

Re: Clojure Speed performance test

On Aug 18, 6:50 am, David Nolen wrote: > The Clojure code posted there is pretty awful and shows a gross, gross > misunderstanding of Clojure data types. I submitted one improved version > already, but didn't spend the time to make it really, really fast. > > For this particular kind of pointles

Re: Clojure Speed performance test

On Aug 18, 7:34 am, Michael Jaaka wrote: > For list reduction it is said to remove every third solder but just > with 1 step they remove 1 soldier. There is something wrong Scully. The author knows, and says that "variant" seemed more interesting. (It should be easy enough to factor out the d

Re: Clojure 1.3 Beta 2

Not surprisingly, some of the benchmarks game programs written for Clojure 1.2 have problems with 1.3 Beta 2. My guess is that small changes to the programs will be required to catch up with the new version, but occasionally program failures have indicated a bug in new versions of other languages.

Re: Clojure 1.3 Beta 2

On Aug 31, 10:07 pm, Andy Fingerhut wrote: > Isaac, all of the programs that fail with Clojure 1.3 now can be made to > compile and run on both 1.2 and 1.3 by changing a relatively small part of > the programs. > > I have them on my computer (and probably checked into the github repo > clojure-b

Re: Language shoutout clojure code does not have types

On Sep 19, 5:56 am, Ken Wesson wrote: > On Sun, Sep 18, 2011 at 11:20 AM, Andy Fingerhut > > wrote: > > One more detail. The Scala program, and I think all of the fastest programs > > for that problem, use the GNU GMP library for big integer arithmetic. > > If that's true, then it indicates that

Re: Clojure 1.3 Released

On Sep 23, 2:44 pm, Christopher Redinger wrote: > We are pleased to announce today the release of Clojure 1.3: The chameneos-redux program that now timeout after 30 minutes, previously completely after 100 seconds with Clojure 1.2 The thread-ring programs that now timeout after 30 minutes, pre

Re: Reactions to google dart?

On Oct 11, 7:43 am, Timothy Washington wrote: > I believe this is google's official blog to discuss > and track issues around Dart ... H - "Dart Inside The Unofficial Google Dart Blog" "Dart Inside is an online service from Trifork A/S,

What changed 1.2/1.3 to cause this program slowdown?

thread-ring Clojure 1.2 N=50 1.8 secs N=500 7.1 secs N=5000 58.3 secs thread-ring Clojure 1.3 N=50 2.8 secs N=500 25.3 secs N=5000 >1800 secs http://shootout.alioth.debian.org/u64q/program.php?test=threadring&lang=clojure&id=1 chameneos-redux Clojure 1.2 N=50 2.7 sec

Re: Clojure vs F# performance

On Nov 22, 10:18 am, Mark Engelberg wrote: > I doubt that F# Mono benchmarks are representative of F#'s performance on > Windows. Perhaps they are representative of F#'s performance on Mono on Windows :-) But I wouldn't take a bet on that - performance measurements can be very brittle. -- Y

Re: Clojure vs F# performance

On Nov 22, 12:54 pm, Ralph wrote: > That is almost certainly true, since the Microsoft have probably done > extensive optimization on the CLR. > > On Nov 22, 1:18 pm, Mark Engelberg wrote: > > > I doubt that F# Mono benchmarks are representative of F#'s performance on > > Windows. If Microsof

Re: benchmarking tipps and tricks

On Nov 21, 3:15 pm, nickik wrote: -snip- > - What are the best tools to benchmark on the jvm (and optimize your > tests) JavaStats http://shootout.alioth.debian.org/help.php#languagex -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to thi

only 3 benchmarks game tasks still have no Clojure programs

Only 3 tasks on the computer language benchmarks game still have no Clojure programs - 1) meteor-contest http://shootout.alioth.debian.org/u32q/benchmark.php?test=meteor 2) chameneos-redux http://shootout.alioth.debian.org/u32q/benchmark.php?test=chameneosredux 3) pidigits http://shootout.

Re: only 3 benchmarks game tasks still have no Clojure programs

On Jan 10, 6:27 am, Stuart Halloway wrote: > I notice that the fastest Java version of pidigits uses a native library > named "jpargmp". Is there documentation somewhere that spells out how and > when you are allowed to use native libraries and still claim to be written in > language X? If

Re: only 3 benchmarks game tasks still have no Clojure programs

On Jan 10, 6:27 am, Stuart Halloway wrote: > I notice that the fastest Java version of pidigits uses a native library > named "jpargmp". Is there documentation somewhere that spells out how and > when you are allowed to use native libraries and still claim to be written in > language X? As

Re: only 3 benchmarks game tasks still have no Clojure programs

On Jan 10, 6:27 am, Stuart Halloway wrote: > I notice that the fastest Java version of pidigits uses a native library > named "jpargmp". Is there documentation somewhere that spells out how and > when you are allowed to use native libraries and still claim to be written in > language X? As

Re: Anyone want to take a crack at making the fasta shootout program faster?

On Feb 10, 1:17 am, Bill James wrote: > http://shootout.alioth.debian.org/u32/benchmark.php?test=fasta〈=all > > The fastest program shown here is in Java and runs in 1.72 seconds. > However, at the bottom of the page (under "interesting alternative" > programs) there is a C++ program that runs in

Re: Anyone want to take a crack at making the fasta shootout program faster?

for their alternative status would be   > enlightening. > > Thanks, > Andy > > On Feb 10, 2011, at 12:47 PM, Isaac Gouy wrote: > > > On Feb 10, 1:17 am, Bill James wrote: > >>http://shootout.alioth.debian.org/u32/benchmark.php?test=fasta〈=all > > >> The

Re: Anyone want to take a crack at making the fasta shootout program faster?

Yeah but it's not too hard to see why the Lisp programmer Juho Snellman opined on HN "the [sic program] implementations seem to have totally dived off the deep end of complexity". On Feb 11, 2:28 pm, Andy Fingerhut wrote: > fasta.java-3.java calls the method next(), implementing the linear   > co

Re: Anyone want to take a crack at making the fasta shootout program faster?

On Feb 10, 1:41 pm, Bill James wrote: -snip- > The C++ program was evidently deprecated because it did not go through > the process of generating a random character for each character that > it output. The author realized that the pseudo-random-number-generator > had a cycle-length less than 200

Re: Anyone want to take a crack at making the fasta shootout program faster?

On Feb 12, 1:28 pm, Michael Gardner wrote: > On Feb 12, 2011, at 3:12 PM, Isaac Gouy wrote: > > > Yeah but it's not too hard to see why the Lisp programmer Juho > > Snellman opined on HN "the [sic program] implementations seem to have > > totally di

Re: Anyone want to take a crack at making the fasta shootout program faster?

On Feb 12, 9:51 pm, Michael Gardner wrote: -snip- > Those are all good, but ... Before I pointed out that code size was already shown, you thought just including such a measure would possibly "do the trick" but now that seems not to be good enough for you. > how many people actually look at an