Time g111102 g111102 g111102 idl7 0.04 108 100 105 100^ Empty For loop, 2000000 times 0.01 100^ 102 101 112 Call empty procedure (1 param) 1000 0.01 151* 152* 146* 100^ Add 200000 integer scalars and stor 0.01 244* 243* 238* 100^ 50000 scalar loops each of 5 ops, 2 0.00 282* 100^ 100^ 328* Mult 512 by 512 byte by constant an 0.01 100^ 103 108 115* Shift 512 by 512 byte and store, 30 0.01 100 100^ 100 252* Add constant to 512x512 byte array, 0.01 100 100^ 100^ 234* Add two 512 by 512 byte arrays and 0.00 101 100^ 101 375* Mult 512 by 512 floating by constan 0.01 123* 117* 118* 100^ Shift 512 x 512 array, 60 times 0.00 100 100^ 102 475* Add two 512 by 512 floating images, 0.01 100^ 100^ 100^ 115* Generate 1000000 random numbers 0.01 180* 181* 180* 100^ Invert a 192^2 random matrix 0.00 100^ 100^ 100^ 9355* LU Decomposition of a 192^2 random 0.02 168* 174* 171* 100^ Transpose 384^2 byte, FOR loops 0.01 101 100^ 101 142* Transpose 384^2 byte, row and colum 0.04 103 103 103 100^ Transpose 384^2 byte, TRANSPOSE fun 0.02 138* 183* 143* 100^ Log of 100000 numbers, FOR loop 0.00 100 100^ 100^ 344* Log of 100000 numbers, vector ops 1 0.01 101 100^ 101 162* 131072 point forward plus inverse F 0.03 515* 514* 513* 100^ Smooth 512 by 512 byte array, 5x5 b 0.01 596* 596* 595* 100^ Smooth 512 by 512 floating array, 5 0.02 100^ 100 103 241* Write and read 512 by 512 byte arra 0.40 139* 139* 138* 100^ Total Time 0.01 104 101 100^ 137* Geometric mean ^ = fastest. * = Slower by 15% or more. Wed Nov 02 09:41:24 2011