English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/1773
Share/Impact:
Statistics
logo share SHARE   Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

DC FieldValueLanguage
dc.contributor.authorCreel, Michael-
dc.date.accessioned2007-10-31T14:38:40Z-
dc.date.available2007-10-31T14:38:40Z-
dc.date.issued2005-06-15-
dc.identifier.urihttp://hdl.handle.net/10261/1773-
dc.description.abstractThe parameterized expectations algorithm (PEA) involves a long simulation and a nonlinear least squares (NLS) fit, both embedded in a loop. Both steps are natural candidates for parallelization. This note shows that parallelization can lead to important speedups for the PEA. I provide example code for a simple model that can serve as a template for parallelization of more interesting models, as well as a download link for an image of a bootable CD that allows creation of a cluster and execution of the example code in minutes, with no need to install any software.en_US
dc.description.sponsorshipThis research was supported by grants SGR2001-0164 and SEC2003-05112.en_US
dc.language.isoengen_US
dc.relation.ispartofseriesUFAE and IAE Working Papersen_US
dc.relation.ispartofseries651.05en_US
dc.rightsopenAccessen_US
dc.subjectParameterized expectationsen_US
dc.subjectParallel computingen_US
dc.titleA Note on Parallelizing the Parameterized Expectations Algorithmen_US
dc.typedocumento de trabajoen_US
Appears in Collections:(IAE) Informes y documentos de trabajo
Files in This Item:
File Description SizeFormat 
65105.pdf102,25 kBAdobe PDFThumbnail
View/Open
Show simple item record
 


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.