Accelerating earthquake simulations on general‐purpose graphics processors. (14th August 2015)

• Record Type: Journal Article
• Authors: Sengupta, Prasenjit; Nguyen, Jimmy; Kwan, Jason; Menon, Padmanabhan K.; Heien, Eric M.; Rundle, John B.
• Is Part Of: Concurrency and computation. Volume 27:Number 17(2015:Dec.)
• Page Start: 5460
• Page End: 5471
• Publication Date: 2015-08-14
• Subjects: earthquake -- parallel computing -- graphics processing units; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.3618
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: Parallelization strategies are presented for Virtual Quake, a numerical simulation code for earthquakes based on topologically realistic systems of interacting earthquake faults. One of the demands placed upon the simulation is the accurate reproduction of the observed earthquake statistics over three to four decades. This requires the use of a high‐resolution fault model in computations, which demands computational power that is well beyond the scope of off‐the‐shelf multi‐core CPU computers. However, the recent advances in general‐purpose graphic processing units have the potential to address this problem at moderate cost increments. A functional decomposition of Virtual Quake is performed, and opportunities for parallelization are discussed in this work. Computationally intensive modules are identified, and these are implemented on graphics processing units, significantly speeding up earthquake simulations. In the current best case scenario, a computer with six graphics processing units can simulate 500 years of fault activity in California at 1.5 km × 1.5 km element resolution in less than 1 hour, whereas a single CPU requires more than 2 days to perform the same simulation. Copyright © 2015 John Wiley & Sons, Ltd.