Dear all, I am writing an article for Free Software Magazine. As some of you know this is an online magazine with relatively high impact. I will be publishing some PDL benchmarks when compared with other languages. As you know benchmarks can be very tricky and some misdoing can be easily done. I am showing here the results for criticism or comments. Please send me your comments before 15 March if you think there is something severly flawed in these results. Any other comments are obviously also welcome. I am mostly interested in the comparison of IDL and PDL. I am running code to calculate the madelbrot fractal. They are fairly simple and short programs. I attach the code for your review. If there is anything you think should be modified to make the code faster in any of the languages please let me know. I also attach the matlab program since I am not sure I implemented the "clip" function in the right way. Any comments from expert matlab programmers welcome.
I have measured the times and run the codes with date;./mandel.pl;date date;idl < mandel.bat;date date;matlab -nodisplay -nojvm < mandel.m;date where mandel.bat is a batch file that compiles and runs mandel.pro I have run these benchmarks without running anything else on the computer. I have done this several times and have obtained consistent times. Is there a better way to measure the time without resorting to date? The results are the following: gcc 201 sec g77 201 sec PDL 651 sec IDL 694 sec MatLab 2738 sec Octave 2031 sec Do these times seem reasonable to you? Many thanks, Xavier
mandel.pl
Description: Perl program
mandel.pro
Description: Binary data
mandel.m
Description: Binary data
_______________________________________________ Perldl mailing list [email protected] http://mailman.jach.hawaii.edu/mailman/listinfo/perldl
