FM  B2|*+  ,% )  +,7C 2 ,7        #    !       +#####9:$$((>D1      , 2(0**57J:%: ,*  #   2&.   4      'W10';I 0% -I*  5 4 529 D( !  5  *5 +69    $     '   0     (                            ?3                        =    5             &                                    0        1   O 97C8     *   +  *** Hello MUL mul DIV div sqr lsh MUL mul sqr lsh AMD Athlon 64 X2 3800+, 2048 MB memory Relative to PrimeSchoenhage Factorial Algorithms (C) Peter Luschny, 2008 B E N C H M A R K - T I M I N G S (sec.) P E R F O R M A N C E - P R O F I L E OPERATION COUNT [ n = 100000 ] P E R F O R M A N C E - P R O F I L E version 1.4.2 by Mikko Tommila Note: the smaller the value the better. Values p <= 1 indicate excellent performance. 2 indicate good performance. n * 1000, n = B E N C H M A R K - T I M I N G S n * 1000, n = 64 128 256 512 1024 2048 -------------------------------------------------------Arithmetic Library: Apfloat 1.4.2 by Mikko Tommila RANKING [n=This software uses the Apfloat Library java 1.6 -server -Xms1536m -Xmx1536m, in memory computation ---------------------------------------------------- Arithmetic Library: java.math.BigInteger + Karatsuba Hyper 1,5 1,5 1,5 1,5 1,5 1,5 PrimeBorwein 2,2 2,3 2,3 2,3 2,4 2,4 Leenstra 1,0 1,0 1,0 1,0 1,1 1,1 Schoenhage 1,0 1,0 1,0 1,0 1,0 1,0 wingList 1,0 1,0 1,0 1,0 1,0 1,0 uschny 1,0 1,0 1,0 1,0 1,0 1,0 Vardi 1,1 1,1 1,1 1,1 1,1 1,1 oductRecursive 1,6 1,6 1,7 1,7 1,7 1,4 SplitRecursive 1,3 1,3 1,3 1,3 1,3 1,2 n * 1000000, n = 1 2 4 8 16 32 64 "http://www.w3.org/TR/xhtml11/DTD/xhtml11.dtd" >: <= = > ADD, DIV, E+MUL = BigInt*BigInt; mul = BigInt*SmallInt , SUB, ec ;SVZ[DFIJL;C)CL;VI)ID)DL;VZD)DII)DJ)L;VI)L;VF)VF)FJ)L;VI)VI)CIJL;VZ[II)CIL;V[II)VI)L;J)VZL;[I[I)VJ)II)L;J)L;J)L;L;I)VL;)V[L;)VJ)IJL;VI)IJL;VI)JJ)JL;VI)L;VL;)CIJL;VZ[IL;C)VDJ[I)VI)L;VI)L;VI)VII)VL;J)IJ)VJ)VL;)L;L;)L;L;II)VII)VZ[I[I)VZL;[I[I)VJ)JL;V[L;I)IL;VZ)L;VJ)L;VL;)L;J)L;L;)VZ)L;L;)IL;V[JL;I)VIIII)VL;J)IJJ)VL;J)IZ)L;J)JL;I)L;L;)L;VJ)L;L;)L;[JZZ)VZ)L;VZZZZC)V[I)V[I)VL;)L;S)JZ)L;VL;L;L;JII)V[CI)VI)VI)IL;VI)VI)L;VI)IVI)V[IIII)V[I)V[I)IVJ)L;II)L;L;)L;VI)VI)L;VL;)VZ)V) > toIndex(failed!*, available=columns=endPosition=length=n2=rows=------------------------------------------- -------------------------------------------->>.> aphtmltxt0.1, 2, 4, 8, 16, 32 and 64 million. This might takee26214432655368192::::::::::::::::::::::::::::::::::::::::; radix must be between -)