Rethinking large-scale economic modeling for efficiency: optimizations for GPU and Xeon Phi clusters

Abstract

We propose a massively parallelized and optimized framework to solve high-dimensional dynamic stochastic economic models on modern GPU- and MIC-based clusters. First, we introduce a novel approach for adaptive sparse grid index compression alongside a surplus matrix reordering, which significantly reduces the global memory throughput of the compute kernels and maps randomly accessed data onto cache or fast shared memory. Second, we fully vectorize the compute kernels for AVX, AVX2 and AVX512 CPUs, respectively. Third, we develop a hybrid cluster oriented work-preempting scheduler based on TBB, which evenly distributes the time iteration workload onto available CPU cores and accelerators. Numerical experiments on Cray XC40 KNL “Grand Tave” and on Cray XC50 “Piz Daint” systems at the Swiss National Supercomputer Centre (CSCS) show that our framework scales nicely to at least 4,096 compute nodes, resulting in an overall speedup of more than four orders of magnitude compared to a single, optimized CPU thread. As an economic application, we compute global solutions to an annually calibrated stochastic public finance model with sixteen discrete, stochastic states with unprecedented performance. Index Terms—High-Performance Computing, Macroeconomics, Public Finance, Adaptive Sparse Grids, Heterogeneous Systems, CUDA, GPU, MIC