Portuguese Perl Workshop 2010 Last Call[->] on 2010.05.24 10:36 smash
Link To Original Source
Parrot 0.6.3 is available via CPAN (soon), or follow the download instructions. For those who would like to develop on Parrot, or help develop Parrot itself, we recommend using Subversion on our source code repository to get the latest and best Parrot code.
Parrot 0.6.3 News:
Thanks to all our contributors for making this possible, and our sponsors for supporting this project. Our next release is 15 July 2008.
Enjoy!
On behalf of the Parrot team, I'm proud to announce Parrot 0.6.3 "Beautiful Parrot." Parrot is a virtual machine aimed at running all dynamic languages.
Parrot 0.6.3 is available via CPAN (soon), or follow the download instructions. For those who would like to develop on Parrot, or help develop Parrot itself, we recommend using Subversion on our source code repository to get the latest and best Parrot code.
Parrot 0.6.3 News:
Thanks to all our contributors for making this possible, and our sponsors for supporting this project. Our next release is 15 July 2008.
Enjoy!
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.
"
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.