bm_prog_fib: Programming benchmarks

In benchmarkme: Crowd Sourced System Benchmarks

Programming benchmarks

Description

A collection of matrix programming benchmark functions

• 3,500,000 Fibonacci numbers calculation (vector calc).

• Creation of a 3500x3500 Hilbert matrix (matrix calc).

• Grand common divisors of 1,000,000 pairs (recursion).

• Creation of a 1600x1600 Toeplitz matrix (loops).

• Escoufier's method on a 60x60 matrix (mixed).

These benchmarks have been developed by many authors. See http://r.research.att.com/benchmarks/R-benchmark-25.R for a complete history. The function benchmark_prog() runs the five bm functions.

Usage

bm_prog_fib(runs = 3, verbose = TRUE)

bm_prog_hilbert(runs = 3, verbose = TRUE)

bm_prog_gcd(runs = 3, verbose = TRUE)

bm_prog_toeplitz(runs = 3, verbose = TRUE)

bm_prog_escoufier(runs = 3, verbose = TRUE)

benchmark_prog(runs = 3, verbose = TRUE, cores = 0L)

Arguments

runs	Number of times to run the test. Default 3.
verbose	Default TRUE.
cores	Default 0 (serial). When cores > 0, the benchmark is run in parallel.

benchmarkme documentation built on June 12, 2022, 5:06 p.m.