Implementation of efficient low-storage techniques for 3-D seismic simulation using the curved grid finite-difference method

Abstract

SUMMARYHigh-resolution 3-D seismic simulation imposes severe demands for computational memory, making low-storage seismic simulation particularly important. Due to its high-efficiency and low-storage, the half-precision floating-point 16-bit format (FP16) is widely used in heterogeneous computing platforms, such as Sunway series supercomputers and graphics processing unit (GPU) computing platforms. Furthermore, the low-storage Runge–Kutta (LSRK) technique requires lower memory resources compared with the classical Runge–Kutta. Therefore, FP16 and LSRK provide the possibility for low-storage seismic simulation. However, the orders of magnitude of the physical quantities (velocity, stress and Lamé constants) in the elastic wave equations are influenced by the P-wave and S-wave velocities and the densities of the elastic media. This results in a huge order of magnitude difference between the stored velocity and stress values, which exceed the range of the stored values of FP16. In this paper, we introduce three dimensionless constants, Cv, Cs and Cp, into elastic wave equations, and new elastic wave equations are derived. The three constants, Cv, Cs and Cp, keep the orders of magnitude of the velocity and stress at a similar level in the new elastic wave equations. Thus, the stored values of these variables in new equations remain within the range of the stored values of FP16. In addition, we introduce the use of the LSRK due to its low-storage characteristic. In this paper, based on the FP16 and LSRK low-storage techniques, we develop 3 optimized multi-GPU solvers for seismic simulation using the curved grid finite-difference method (CGFDM). Moreover, we perform a series of seismic simulations to verify the accuracy, stability, and validity of the optimized solver coupled with the two techniques. The verifications indicate that through maintaining the calculation accuracy, the computational efficiency of the solver is significantly optimized, and the memory usage is remarkably reduced. In particular, under the best conditions, the memory usage can be reduced to nearly 1/3 that of the original CGFDM solver.