mpir/bench
2009-04-01 12:12:56 +00:00
..
divide.c new directory and target make bench 2009-03-20 16:16:35 +00:00
gexpr.c new directory and target make bench 2009-03-20 16:16:35 +00:00
Makefile.am new directory and target make bench 2009-03-20 16:16:35 +00:00
Makefile.in autoreconf 2009-04-01 12:12:56 +00:00
mpirbench.sln new directory and target make bench 2009-03-20 16:16:35 +00:00
mpirver.c new directory and target make bench 2009-03-20 16:16:35 +00:00
multiply.c new directory and target make bench 2009-03-20 16:16:35 +00:00
README new directory and target make bench 2009-03-20 16:16:35 +00:00
rsa.c new directory and target make bench 2009-03-20 16:16:35 +00:00
runbench new directory and target make bench 2009-03-20 16:16:35 +00:00
runbench.py new directory and target make bench 2009-03-20 16:16:35 +00:00
timing.h new directory and target make bench 2009-03-20 16:16:35 +00:00
version new directory and target make bench 2009-03-20 16:16:35 +00:00

MPIRbench 0.1

Copyright 2003 Free Software Foundation, Inc.

This file is part of MPIRbench.

MPIRbench 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.1 of the License, or (at your option) any later
version.

The MPIRbench 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
the MPIRbench; see the file COPYING.  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.