User-Friendly Parallel Computations with Econometric Examples
This paper shows how a high-level matrix programming language may be used to perform Monte Carlo simulation, bootstrapping, estimation by maximum likelihood and GMM, and kernel regression in parallel on symmetric multiprocessor computers or clusters of workstations. The implementation of parallelization is done in a way such that an investigator may use the programs without any knowledge of parallel programming. A bootable CD that allows rapid creation of a cluster for parallel computing is introduced. Examples show that parallelization can lead to important reductions in computational time. Detailed discussion of how the Monte Carlo problem was parallelized is included as an example for learning to write parallel programs for Octave. Copyright Springer Science + Business Media, Inc. 2005
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.
Volume (Year): 26 (2005)
Issue (Month): 2 (October)
|Contact details of provider:|| Web page: http://www.springerlink.com/link.asp?id=100248|
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Swann, Christopher A, 2002. "Maximum Likelihood Estimation Using Parallel Computing: An Introduction to MPI," Computational Economics, Society for Computational Economics, vol. 19(2), pages 145-78, April.
- Jurgen A. Doornik & David F. Hendry & Neil Shephard, .
"Computationally-intensive Econometrics using a Distributed Matrix-programming Language,"
2001-W22, Economics Group, Nuffield College, University of Oxford.
- David Hendry & Neil Shephard & Jurgen Doornik, 2001. "Computationally-intensive Econometrics using a Distributed Matrix-programming Language," Economics Series Working Papers 2001-W22, University of Oxford, Department of Economics.
- Nagurney, Anna, 1996. "Parallel computation," Handbook of Computational Economics, in: H. M. Amman & D. A. Kendrick & J. Rust (ed.), Handbook of Computational Economics, edition 1, volume 1, chapter 7, pages 335-404 Elsevier.
- Tauchen, George E. & Gallant, A. Ronald, 1995.
"Which Moments to Match,"
95-20, Duke University, Department of Economics.
- Michael Creel, 2005. "ParallelKnoppix," Grecs Computer Code 003.05, Research Group in Computation and Simulations (GRECS).
- Racine, Jeff, 2002. "Parallel distributed kernel estimation," Computational Statistics & Data Analysis, Elsevier, vol. 40(2), pages 293-302, August.
When requesting a correction, please mention this item's handle: RePEc:kap:compec:v:26:y:2005:i:2:p:107-128. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn)or (Christopher F. Baum)
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.