Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw

Re: Re^2: Beyond Golf - reading between the tokens

by gjb (Vicar)
on Dec 28, 2002 at 01:48 UTC ( #222669=note: print w/replies, xml ) Need Help??

in reply to Re^2: Beyond Golf - reading between the tokens
in thread Beyond Golf - reading between the tokens

The idea could be done if the code were submitted to run on a particular computer, if someone is crazy enough to risk something like that ;-)

Seriously, it could be done in the sense that everyone is able to confirm the results on his own machine with its specific setup. The format of submission would be a function that can be run using Benchmark so that the "competition" could be compared by just pasting the code and running the benchmarks.

I agree that you won't see a clear winner, but it would give those of us interested in raw performance a number of alternative implementations and hence an opportunity to learn. It's all about taking part, not about winning ;-)

Just my 2 cents, -gjb-

Update: It would be possible to get a machine/OS/etc. independent comparison by using some "gauge code", ie. a standard piece of code. The benchmark for the Perl Polo code would then be calculated proportional to the time it takes the "gauge code" to execute.

  • Comment on Re: Re^2: Beyond Golf - reading between the tokens

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://222669]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (4)
As of 2017-09-25 22:10 GMT
Find Nodes?
    Voting Booth?
    During the recent solar eclipse, I:

    Results (291 votes). Check out past polls.