1 April 2014 in Geophysics
Finite-difference methods for modeling seismic waves are known to be inaccurate when including a realistic topography, due to the large dispersion errors that appear in the modelled surface waves and the scattering introduced by the staircase approximation to the topography. As a consequence, alternatives to finite-difference methods have been proposed to circumvent these issues. We present a new numerical scheme for 3D elastic wave propagation in the presence of strong topography. This finite-difference scheme is based upon a staggered grid of the Lebedev type, or fully staggered grid (FSG). It uses a grid deformation strategy to make a regular Cartesian grid conform to a topographic surface. In addition, the scheme uses a mimetic approach to accurately solve the free-surface condition and hence allows for a less restrictive grid spacing criterion in the computations. The scheme can use high-order operators for the spatial derivatives and obtain low-dispersion results with as few as six points per minimum wavelength. A series of tests in 2D and 3D scenarios, in which our results are compared to analytical and numerical solutions obtained with other numerical approaches, validate the accuracy of our scheme. The resulting FSG mimetic scheme allows for accurate and efficient seismic wave modelling in the presence of very rough topographies with the advantage of using a structured staggered grid.
13 September 2016 in Geophysics
Adjoint methods are a key ingredient of gradient-based full-waveform inversion schemes. While being conceptually elegant, they face the challenge of massive memory requirements caused by the opposite time directions of forward and adjoint simulations and the necessity to access both wavefields simultaneously for the computation of the sensitivity kernel. To overcome this bottleneck, we have developed lossy compression techniques that significantly reduce the memory requirements with only a small computational overhead. Our approach is tailored to adjoint methods and uses the fact that the computation of a sufficiently accurate sensitivity kernel does not require the fully resolved forward wavefield. The collection of methods comprises reinterpolation with a coarse temporal grid as well as adaptively chosen polynomial degree and floating-point precision to represent spatial snapshots of the forward wavefield on hierarchical grids. Furthermore, the first arrivals of adjoint waves are used to identify “shadow zones” that do not contribute to the sensitivity kernel. Numerical experiments show the high potential of this approach achieving an effective compression factor of three orders of magnitude with only a minor reduction in the rate of convergence. Moreover, it is computationally cheap and straightforward to integrate in finite-element wave propagation codes with possible extensions to finite-difference methods.
11 November 2010 in IEEE Transactions on Parallel and Distributed Systems
Oil and gas companies trust Reverse Time Migration (RTM), the most advanced seismic imaging technique, with crucial decisions on drilling investments. The economic value of the oil reserves that require RTM to be localized is in the order of 1013 dollars. But RTM requires vast computational power, which somewhat hindered its practical success. Although, accelerator-based architectures deliver enormous computational power, little attention has been devoted to assess the RTM implementations effort. The aim of this paper is to identify the major limitations imposed by different accelerators during RTM implementations, and potential bottlenecks regarding architecture features. Moreover, we suggest a wish list, that from our experience, should be included as features in the next generation of accelerators, to cope with the requirements of applications like RTM. We present an RTM algorithm mapping to the IBM Cell/B.E., NVIDIA Tesla and an FPGA platform modeled after the Convey HC-1. All three implementations outperform a traditional processor (Intel Harpertown) in terms of performance (10x), but at the cost of huge development effort, mainly due to immature development frameworks and lack of well-suited programming models. These results show that accelerators are well positioned platforms for this kind of workload. Due to the fact that our RTM implementation is based on an explicit high order finite difference scheme, some of the conclusions of this work can be extrapolated to applications with similar numerical scheme, for instance, magneto-hydrodynamics or atmospheric flow simulations.
1 September 2015 in IEEE Micro
ACAlbert Cabellos-Aparicio
+6
Broadcast traditionally has been regarded as a prohibitive communication transaction in multiprocessor environments. Nowadays, such a constraint largely drives the design of architectures and algorithms all-pervasive in diverse computing domains, directly and indirectly leading to diminishing performance returns as the many-core era is approaching. Novel interconnect technologies could help revert this trend by offering, among others, improved broadcast support, even in large-scale chip multiprocessors. This article outlines the prospects of wireless on-chip communication technologies pointing toward low-latency (a few cycles) and energy-efficient broadcast (a few picojoules per bit). It also discusses the challenges and potential impact of adopting these technologies as key enablers of unconventional hardware architectures and algorithmic approaches, in the pathway of significantly improving the performance, energy efficiency, scalability, and programmability of many-core chips.
1 January 2009 in Scientific Programming
DSDaniele Paolo Scarpazza
Reverse-Time Migration (RTM) is a state-of-the-art technique in seismic acoustic imaging, because of the quality and integrity of the images it provides. Oil and gas companies trust RTM with crucial decisions on multi-million-dollar drilling investments. But RTM requires vastly more computational power than its predecessor techniques, and this has somewhat hindered its practical success. On the other hand, despite multi-core architectures promise to deliver unprecedented computational power, little attention has been devoted to mapping efficiently RTM to multi-cores. In this paper, we present a mapping of the RTM computational kernel to the IBM Cell/B.E. processor that reaches close-to-optimal performance. The kernel proves to be memory-bound and it achieves a 98% utilization of the peak memory bandwidth. Our Cell/B.E. implementation outperforms a traditional processor (PowerPC 970MP) in terms of performance (with an 15.0× speedup) and energy-efficiency (with a 10.0× increase in the GFlops/W delivered). Also, it is the fastest RTM implementation available to the best of our knowledge. These results increase the practical usability of RTM. Also, the RTM-Cell/B.E. combination proves to be a strong competitor in the seismic arena.
1 September 2014 in Computers & Geosciences