Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/320332 
Year of Publication: 
2025
Citation: 
[Journal:] Quantitative Economics [ISSN:] 1759-7331 [Volume:] 16 [Issue:] 1 [Year:] 2025 [Pages:] 49-87
Publisher: 
The Econometric Society, New Haven, CT
Abstract: 
We show how to use field-programmable gate arrays (FPGAs) and their associated high-level synthesis (HLS) compilers to solve heterogeneous agent models with incomplete markets and aggregate uncertainty (Krusell and Smith (1998)). We document that the acceleration delivered by one single FPGA is comparable to that provided by using 69 CPU cores in a conventional cluster. The time to solve 1200 versions of the model drops from 8 hours to 7 minutes, illustrating a great potential for structural estimation. We describe how to achieve multiple acceleration opportunities-pipeline, data-level parallelism, and data precision-with minimal modification of the C/C++ code written for a traditional sequential processor, which we then deploy on FPGAs easily available at Amazon Web Services. We quantify the speedup and cost of these accelerations. Our paper is the first step toward a new field, electrical engineering economics, focused on designing computational accelerators for economics to tackle challenging quantitative models. Replication code is available on Github.
Subjects: 
FPGA acceleration
heterogeneous agents
aggregate uncertainty,electrical engineering economics
cloud computing
JEL: 
C6
C63
C88
D52
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by-nc Logo
Document Type: 
Article

Files in This Item:
File
Size
779.14 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.