mpir/bench at 88c8b3e0f3a30ca94f60399fabaf86a1b01d230f - mpir

cheng/mpir

History

wbhart d252f5b22e Fixed the test code for mpz_likely_prime_p.		2009-12-07 01:06:47 +00:00
..
build.vc9		2009-05-20 22:25:09 +00:00
divide.c	put back bench into trunk	2009-04-12 16:50:39 +00:00
fermat_prime_p.c	expose mulmod_2exp+-1 to the User , no docs, adjust fermat,mersenne to compile without gmp-impl,longlong	2009-09-09 03:41:37 +00:00
gexpr.c	put back bench into trunk	2009-04-12 16:50:39 +00:00
Makefile.am	Attempt to fix missing build.vc9 directory for make dist.	2009-05-31 20:37:46 +00:00
Makefile.in	Fixed the test code for mpz_likely_prime_p.	2009-12-07 01:06:47 +00:00
mersenne_prime_p.c	expose mulmod_2exp+-1 to the User , no docs, adjust fermat,mersenne to compile without gmp-impl,longlong	2009-09-09 03:41:37 +00:00
mpirver.c	put back bench into trunk	2009-04-12 16:50:39 +00:00
multiply.c	put back bench into trunk	2009-04-12 16:50:39 +00:00
README	put back bench into trunk	2009-04-12 16:50:39 +00:00
rsa.c	put back bench into trunk	2009-04-12 16:50:39 +00:00
runbench	tweek macros	2009-08-23 17:32:26 +00:00
runbench.py	put back bench into trunk	2009-04-12 16:50:39 +00:00
timing.h	put back bench into trunk	2009-04-12 16:50:39 +00:00
version	put back bench into trunk	2009-04-12 16:50:39 +00:00

README

MPIRbench 0.1

Copyright 2003 Free Software Foundation, Inc.

This file is part of the MPIRbench.

This program is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free Software
Foundation; either version 2 of the License, or (at your option) any later
version.

This program is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
PARTICULAR PURPOSE.  See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with
this program; if not, write to the Free Software Foundation, Inc., 59 Temple
Place - Suite 330, Boston, MA 02111-1307, USA.  */

The idea is to have a hierarchy of benchmarks, with benchmark results
computed for the entire "MPIRbench", and for "MPIRbench.app.mersenne",
"MPIRbench.app.RSA", "MPIRbench.app.RSA.encrypt", etc, separately.

For MPIRbench 0.1, there are just three parts:

    [Multiply large numbers]
    base.multiply   128
                    512
                    8192
                    131072
                    2097152

    [Divide numbers of different sizes by small primes]
    base.divide     8192/32         preinv
                    8192/64         preinv
                    8192/128
                    8192/4096
                    8192/8064       clever
                    131072/8192     barrett repeat
                    131072/65536
                    8388608/4194304 newton+barrett

    [Run the RSA encryption algorithm]
    app.RSA     encrypt/verify  512
                    1024
                    2048
                decrypt/sign    512
                    1024
                    2048

Result scores are computed as a geometric mean.  Please use the included
script runbench for running the benchmarks and computing benchmark scores.

When reporting results please include:

     A. Machine type and model
     B. CPU type and clock frequency
     C. MPIR version used
     D. Modifications as permitted above
     E. Compiler and compiler version used
     F. Compiler options used

Please also report any changes you have made to MPIR or the benchmark code
provided here.