17 Performance
17.1 Debugging
In R, you use multiple functions on different types of data objects. Moreover, you “typically solve complex problems by decomposing them into simple functions, not simple objects.” (H. Wickham)
Problems print to the console
Code
Nonproblems also print to the console
Tracing.
Consider this example of an error process (originally taken from https://adv-r.hadley.nz/ ).
Code
# Let i() check if its argument is numeric
i <- function(i0) {
if ( !is.numeric(i0) ) {
stop("`d` must be numeric", call.=FALSE)
}
i0 + 10
}
# Let f() call g() call h() call i()
h <- function(i0) i(i0)
g <- function(h0) h(h0)
f <- function(g0) g(g0)
# Observe Error
f("a")
## Error: `d` must be numeric
First try simple print debugging
Code
If that fails, try traceback debugging
And if that fails, try an Interactive approach
Handling.
Simplest example
Code
Another example
Code
x <- -2
tryCatch(
expr = log(x),
error = function(e) {
message('Caught an error but did not break')
print(e)
return(NA)
},
warning = function(w){
message('Caught a warning!')
print(w)
return(NA)
},
finally = {
message("Returned log(x) if successfull or NA if Error or Warning")
}
)
## <simpleWarning in log(x): NaNs produced>
## [1] NA
Safe Functions
Code
# Define
log_safe <- function(x){
lnx <- tryCatch(
expr = log(x),
error = function(e){
cat('Error Caught: \n\t')
print(e)
return(NA)
},
warning = function(w){
cat('Warning Caught: \n\t')
print(w)
return(NA)
})
return(lnx)
}
# Test
log_safe( 1)
## [1] 0
log_safe(-1)
## Warning Caught:
## <simpleWarning in log(x): NaNs produced>
## [1] NA
log_safe(' ')
## Error Caught:
## <simpleError in log(x): non-numeric argument to mathematical function>
## [1] NA
# Further Tests
s <- sapply(list("A",Inf, -Inf, NA, NaN, 0, -1, 1), log_safe)
## Error Caught:
## <simpleError in log(x): non-numeric argument to mathematical function>
## Warning Caught:
## <simpleWarning in log(x): NaNs produced>
## Warning Caught:
## <simpleWarning in log(x): NaNs produced>
s
## [1] NA Inf NA NA NaN -Inf NA 0
17.2 Optimizing
In General, clean code is faster and less error prone.
By optimizing repetitive tasks, you end up with code that
- is cleaner, faster, and more general
- can be easily parallelized
So, after identifying a bottleneck, try
- vectorize your code
- use a dedicated package
- use parallel computations
- compile your code in C++
But remember
- Don’t waste time optimizing code that is not holding you back.
- Look at what has already done.
Benchmarking.
For identifying bottlenecks, the simplest approach is to time how long a code-chunk runs
Code
You can visually identify bottlenecks in larger blocks
Code
# Generate Large Random Dataset
n <- 2e6
x <- runif(n)
y <- runif(n)
z <- runif(n)
XYZ <- cbind(x,y,z)
# Inspect 4 equivalent `row mean` calculations
profvis::profvis({
m <- rowSums(XYZ)/ncol(XYZ)
m <- rowMeans(XYZ)
m <- apply(XYZ, 1, mean)
m <- rep(NA, n); for(i in 1:n){ m[i] <- (x[i] + y[i] + z[i]) / 3 }
})
Code
For systematic speed comparisons, try a benchmarking package
Code
# 3 Equivalent calculations of the mean of a vector
mean1 <- function(x,p=1) mean(x^p)
mean2 <- function(x,p=1) sum(x^p) / length(x)
mean3 <- function(x,p=1) mean.default(x^p)
# Time them
x <- runif(1e6)
microbenchmark::microbenchmark(
mean1(x,.5),
mean2(x,.5),
mean3(x,.5),
times=20
)
## Unit: milliseconds
## expr min lq mean median uq max neval cld
## mean1(x, 0.5) 19.99996 21.08001 21.74110 22.06529 22.31428 23.07532 20 a
## mean2(x, 0.5) 19.15722 20.10658 20.91981 21.12252 21.73134 22.79755 20 a
## mean3(x, 0.5) 19.94863 20.39546 22.13567 22.02917 22.52014 32.40659 20 a
# Time them (w/ memory)
bench::mark(
mean1(x,.5),
mean2(x,.5),
mean3(x,.5),
iterations=20
)
## # A tibble: 3 × 6
## expression min median `itr/sec` mem_alloc `gc/sec`
## <bch:expr> <bch:tm> <bch:tm> <dbl> <bch:byt> <dbl>
## 1 mean1(x, 0.5) 19.9ms 22.6ms 45.9 7.63MB 0
## 2 mean2(x, 0.5) 19.1ms 21.6ms 48.3 7.63MB 2.54
## 3 mean3(x, 0.5) 19.8ms 22.6ms 45.3 7.63MB 2.39
Vectorize.
Computers are really good at math, so exploit this.
- First try vectors
- Then try
apply
functions - See https://uscbiostats.github.io/software-dev-site/handbook-slow-patterns.html
Vector operations are generally faster and easier to read than loops
Code
# Compare 2 moving averages
x <- runif(2e6)
# First Try
ma1 <- function(y){
z <- y*NA
for(i in 2:length(y)){
z[i] <- (y[i]-y[i-1])/2
}
return(z)
}
# Optimized using diff
diff( c(2,2,10,9) )
## [1] 0 8 -1
ma2 <- function(y){
z2 <- diff(y)/2
z2 <- c(NA, z2)
return(z2)
}
all.equal(ma1(x),ma2(x))
## [1] TRUE
system.time( ma1(x) )
## user system elapsed
## 0.173 0.000 0.174
system.time( ma2(x) )
## user system elapsed
## 0.031 0.006 0.037
ma3 <- compiler::cmpfun(ma2)
system.time( ma3(x) )
## user system elapsed
## 0.028 0.000 0.028
Likewise, matrix operations are often faster than vector operations.
Pre-allocate.
- Put as few things in a loop as possible. (If there is a bottleneck, try to take stuff out of a loop.)
- create objects first and then fill them. (Do not grow lists or vectors dynammically)
more complicated example
Code
recursive loop
Memory Usage.
For finding problematic blocks utils::Rprof(memory.profiling = TRUE)
logs total memory usage of R at regular time intervals. E.g.
Code
For finding problematic functions: utils::Rprofmem()
logs memory usage at each call
For finding problematic scripts, see “Advanced Optimization”. (With Rprof, you can identifying bottlenecks on a cluster without a GUI.)
Packages.
Before creating your own program, check if there is a faster or more memory efficient version. E.g., data.table or Rfast2 for basic data manipulation.
Some functions are simply wrappers for the function you want, and calling it directly can speed things up.
Code
X <- cbind(1, runif(1e6))
Y <- X %*% c(1,2) + rnorm(1e6)
DAT <- as.data.frame(cbind(Y,X))
system.time({ lm(Y~X, data=DAT) })
## user system elapsed
## 0.324 0.007 0.134
system.time({ .lm.fit(X, Y) })
## user system elapsed
## 0.093 0.000 0.026
system.time({ solve(t(X)%*%X) %*% (t(X)%*%Y) })
## user system elapsed
## 0.029 0.000 0.024
Note that such functions to have fewer checks and return less information, so you must know exactly what you are putting in and getting out.
Task Views
Task views list relevant packages. For all students and early researchers, see
For microeconometrics, see
For spatial econometrics , see
- https://cran.r-project.org/web/views/Spatial.html
- https://cran.r-project.org/web/views/SpatioTemporal.html
Multiple packages may have the same function name for different commands. In this case use the syntax package::function
to specify the package. For example
Don’t fret Sometimes there is not a specific package for your data. Odds are, you can do most of what you want with base code.
- Packages just wrap base code in convient formats
- see https://cran.r-project.org/web/views/ for topical overviews
Statisticians might have different naming conventions
- if the usual software just spits out a nice plot you might have to dig a little to know precisely what you want
- your data are fundamentally numbers, strings, etc… You only have to figure out how to read it in.
17.3 Advanced Optimizing
If you still are stuck with slow code, you can
- make your code run on parallel processors
- try Amazon Web Server for more brute-power
- rewrite bottlenecks with a working C++ compiler or Fortran compiler.
In what follows, note that there are alternative ways to run R via the command line. For example,
Also, look into https://cran.r-project.org/web/views/HighPerformanceComputing.html
Parallel.
Sometimes there will still be a problematic bottleneck.
Your next step should be parallelism:
- Write the function as a general vectorized function.
- Apply the same function to every element in a list at the same time
Code
# lapply in parallel on {m}ultiple {c}ores
x <- c(10,20,30,40,50)
f <- function(element) { element^element }
parallel::mclapply( x, mc.cores=2, FUN=f)
## [[1]]
## [1] 1e+10
##
## [[2]]
## [1] 1.048576e+26
##
## [[3]]
## [1] 2.058911e+44
##
## [[4]]
## [1] 1.208926e+64
##
## [[5]]
## [1] 8.881784e+84
More power is often not the solution
Code
# vectorize and compile
e_power_e_fun <- compiler::cmpfun( function(vector){ vector^vector} )
# base R
x <- 0:1E6
s_vc <- system.time( e_power_e_vec <- e_power_e_fun(x) )
s_vc
## user system elapsed
## 0.020 0.002 0.022
# brute power
x <- 0:1E6
s_bp <- system.time({
e_power_e_mc <- unlist( parallel::mclapply(x, mc.cores=2, FUN=e_power_e_fun))
})
s_bp
## user system elapsed
## 1.101 0.247 0.738
# Same results
all(e_power_e_vec==e_power_e_mc)
## [1] TRUE
Note that parallelism does not go well with a GUI.
Computer Clusters.
For parallel computations on a computer cluster, you will need to use both R and the linux command line.
Code
Code
You will often want to rerun entire scripts with a different parameter. To do so, you need to edit your R scripts to accept parameters from the command line
For example
Code
You can also store the output and computer resources of a script. For example, save the last script as RBLOCK.R
in the folder $HOME/R_Code
and run the following
Code
# Which Code
RDIR=$HOME/R_Code #main directory
infile=$RDIR/RBLOCK.R #specific code
outfile=$RDIR/R_Logs/RBLOCK$design_N.Rout #log R output
memfile=$RDIR/R_Logs/RBLOCK$design_N.Rtime #log computer resources
# Execute the Script and store resource useage via `time`
command time -o $memfile -v \
R CMD BATCH --no-save --quiet --no-restore "--args 1 2 3" $infile $outfile
Note that you need to have https://ftp.gnu.org/gnu/time installed
On an academic computing cluster, you may have to use a scheduler like slurm. In which case you can submit a bash script
where SlurmJob.sh
looks like
Code
#!/bin/bash
#SBATCH --ntasks=1
#SBATCH --error=$HOME/R_Code/Slurm_Logs/%x.error-%j
#SBATCH --output=$HOME/R_Code/Slurm_Logs/%x.out-%j
# Which Code
RDIR=$HOME/R_Code
infile=$RDIR/RBLOCK.R
outfile=$RDIR/R_Logs/RBLOCK$design_N.Rout
memfile=$RDIR/R_Logs/RBLOCK$design_N.Rtime
# Which Parameter
a="${SLURM_ARRAY_TASK_ID}"
# Execute the Script with a specific parameter, and store memory/time useage
command time -o $memfile -v \
R CMD BATCH --no-save --quiet --no-restore "--args $a" $infile $outfile
# Summarize memory/time useage
echo "design_N: $design_N Gridpoints"
cat $memfile | awk '/User time/ {printf "Time: %.2f Hours\n", $4/3600}'
cat $memfile | awk '/Maximum resident set size/ {printf "Memory: %.2f GB\n", $6/1048576}'
echo "Partition: $SLURM_JOB_PARTITION"
Compiled Code.
You can use C++ code within R to speed up a specific chunk.
To get C++ on your computer
- On Windows, install Rtools.
- On Mac, install Xcode from the app store.
- On Linux, sudo apt-get install r-base-dev or similar.
To call C++ from R use package Rcpp
Code
For help getting started with Rcpp, see https://cran.r-project.org/web/packages/Rcpp/vignettes/Rcpp-quickref.pdf
First try to use C++ (or Fortran) code that others have written
For a tutorial, see https://masuday.github.io/fortran_tutorial/r.html
17.4 Further Reading
Advanced Programming
- https://rmd4sci.njtierney.com/
- https://smac-group.github.io/ds/high-performance-computing.html
- https://www.stat.umn.edu/geyer/3701/notes/arithmetic.Rmd
For debugging tips
- https://cran.r-project.org/doc/manuals/R-lang.html#Debugging
- https://cran.r-project.org/doc/manuals/R-exts.html#Debugging
- https://adv-r.hadley.nz/debugging.html
- https://adv-r.hadley.nz/conditions.html
- https://dept.stat.lsa.umich.edu/~jerrick/courses/stat701/notes/debugging.html
- https://dept.stat.lsa.umich.edu/~jerrick/courses/stat701/notes/functions.html
For optimization tips
- https://cran.r-project.org/doc/manuals/R-exts.html#Tidying-and-profiling-R-code
- https://cran.r-project.org/doc/manuals/R-lang.html#Exception-handling
- https://adv-r.hadley.nz/perf-measure.html.libPaths()
- https://adv-r.hadley.nz/perf-improve.html
- https://cran.r-project.org/doc/manuals/R-exts.html#System-and-foreign-language-interfaces https://dept.stat.lsa.umich.edu/~jerrick/courses/stat701/notes/profiling.html
- https://adv-r.hadley.nz/rcpp.html
- https://bookdown.dongzhuoer.com/hadley/adv-r/
For parallel programming
- https://dept.stat.lsa.umich.edu/~jerrick/courses/stat701/notes/parallel.html
- https://bookdown.org/rdpeng/rprogdatascience/parallel-computation.html
- https://grantmcdermott.com/ds4e/parallel.html
- https://psu-psychology.github.io/r-bootcamp-2018/talks/parallel_r.html
For general tips
- https://github.com/christophergandrud/Rep-Res-Book
- Efficient R programming. C. Gillespie R. Lovelace. 2021. https://csgillespie.github.io/efficientR/
- Data Science at the Command Line, 1e. Janssens J. 2020. https://www.datascienceatthecommandline.com/1e/
- R Programming for Data Science. Peng R. 2020. https://bookdown.org/rdpeng/rprogdatascience/
- Advanced R. H. Wickham 2019. https://adv-r.hadley.nz/
- Econometrics in R. Grant Farnsworth. 2008. http://cran.r-project.org/doc/contrib/Farnsworth-EconometricsInR.pdf
- The R Inferno. https://www.burns-stat.com/documents/books/the-r-inferno/