Solving Dynamic Programming Problems on a Computational Grid
Abstract
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.Download Info
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic Info
Paper provided by National Bureau of Economic Research, Inc in its series NBER Working Papers with number 18714.Length:
Date of creation: Jan 2013
Date of revision:
Handle: RePEc:nbr:nberwo:18714
Note: TWP
Contact details of provider:
Postal: National Bureau of Economic Research, 1050 Massachusetts Avenue Cambridge, MA 02138, U.S.A.
Phone: 617-868-3900
Email:
Web page: http://www.nber.org
More information through EDIRC
Related research
Keywords:Find related papers by JEL classification:
- C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
- C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
- G11 - Financial Economics - - General Financial Markets - - - Portfolio Choice; Investment Decisions
This paper has been announced in the following NEP Reports:
- NEP-ALL-2013-01-26 (All new papers)
- NEP-CMP-2013-01-26 (Computational Economics)
- NEP-DGE-2013-01-26 (Dynamic General Equilibrium)
References
No references listed on IDEASYou can help add them by filling out this form.
Citations
Lists
This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.Statistics
Access and download statisticsCorrections
When requesting a correction, please mention this item's handle: RePEc:nbr:nberwo:18714For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ().
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.

