Computational Benchmarks
Here, I present the time-to-compute for solving the Arellano (2008) model via value function iteration on a fine grid on various processors.1 All code was written on Julia. I am not sponsored by or affiliated with any company in any way.
CPUs

GPUs

Parallelization was performed across the endowment grid and taking advantage of Julia’s column-major order.
The mesh consisted of 101 points for endowment and 951 points for debt. ↩
