[*] up next print clean
Next: INTRODUCTION Up: Table of Contents

A parallel implementation of Kirchhoff DMO

Patrick Blondel

Author has no known email address

ABSTRACT

In this paper I compare two parallel algorithms for three-dimensional (3-D) Kirchhoff dip moveout (DMO) in a constant velocity medium. In the case of 3-D land data, the highly irregular offset geometry pleads for an algorithm where data are processed in time slices. This mapping of the data into processor memory minimizes the cost of communication, which is reduced to nearest neighbor communication of time slices, and achieves load balance, keeping eighty percent of the processors busy throughout the process. The time aliasing of the operator is solved by a spatial convolution with dip-dependent triangles in a two-dimensional parallel implementation.



 
[*] up next print clean
Next: INTRODUCTION Up: Table of Contents
Stanford Exploration Project
11/16/1997