All the Perl that's Practical to Extract and Report
use Perl Log In
smash (7262)
(email not shown publicly)
Is your program fast enough?
In the process of submitting an article to http://workshop.perl.pt/2008 about Parrot, we felt the urge to do some simple benchmarking, to have a glimpse of Parrot's current performance.
First, the facts:
1) We created a very dumb algorithm (intentionally not efficient) to calculate how may prime numbers exist between 1 and a given argument.
2) We implemented this algorithm in several well know interpreted languages, in Parrot of course, and also in C and Java to have a bottom line to draw comparisons. Basically we only used whiles and ifs and tried to make all implementations as similar as possible.
3) We run every program (unfortunately on a slow machine) several times, incrementing the argument in steps of 10000, from 10000 to 90000, and watched has they took more and more time to run.
Finally, check the results: http://nrc.homelinux.org/parrot/primes.png.
--Larry Wall in <10502@jpl-devvax.JPL.NASA.GOV>
Obligatory comment on behalf of petdance (Score:1)
Vertical scale (Score:2)
With a logarithmic scale, I'd expect the lines for the various systems to become parallel to each other — although not necessarily straight — as long as the speed ratios when comparing the platforms, remain constant.
Re: (Score:1)