(Hint: Generate a single matrix for the attractor values, and use
calc_attractor! on views of columns for calculating the output, or inline the
calc_attractor! computation directly onto the matrix, or even give
calc_attractor! an input for what column to modify.)
Multithread your bifurcation graph generator by performing different steady state calculations on different threads. Does your timing improve? Why? Be careful and check to make sure you have more than 1 thread!
Multiprocess your bifurcation graph generator first by using
pmap, and then by using
@distributed. Does your timing improve? Why? Be careful to add processes before doing the distributed call.
(Note: You may need to change your implementation around to be allocating differently in order for it to be compatible with multiprocessing!)
Which method is the fastest? Why?