Solving Dynamic Programming Problems on a Computational Grid
NBER Working Paper No. 18714
We implement a dynamic programming algorithm on a computational grid consisting of loosely coupled processors, possibly including clusters and individual workstations. The grid changes dynamically during the computation, as processors enter and leave the pool of workstations. The algorithm is implemented using the Master-Worker library running on the HTCondor grid computing platform. We implement value function iteration for several large dynamic programming problems of two kinds: optimal growth problems and dynamic portfolio problems. We present examples that solve in hours on HTCondor but would take weeks if executed on a single workstation. The use of HTCondor can increase a researcher's computational productivity by at least two orders of magnitude.
You may purchase this paper on-line in .pdf format from SSRN.com ($5) for electronic delivery.
Document Object Identifier (DOI): 10.3386/w18714
Published: Yongyang Cai & Kenneth Judd & Greg Thain & Stephen Wright, 2015. "Solving Dynamic Programming Problems on a Computational Grid," Computational Economics, Society for Computational Economics, vol. 45(2), pages 261-284, February. citation courtesy of
Users who downloaded this paper also downloaded these: