Slash Boxes
NOTE: use Perl; is on undef hiatus. You can read content, but you can't post it. More info will be forthcoming forthcomingly.

All the Perl that's Practical to Extract and Report

use Perl Log In

Log In

[ Create a new account ]

smash (7262)

  (email not shown publicly)

Journal of smash (7262)

Friday April 11, 2008
01:48 PM

Is your program fast enough?

[ #36131 ]

In the process of submitting an article to 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:

The Fine Print: The following comments are owned by whoever posted them. We are not responsible for them in any way.
More | Login | Reply
Loading... please wait.