Abstract
The processing of seismic data, for the imaging of the earth's subsurface, is pushing current computational possibilities to the limit. In this paper results are presented obtained by optimisation and parallelisation of two innovative seismic algorithms with the use of PVM and FORGE. It shows that where the algorithm is CPU bound, a very significant speedup can be acquired, whereas IO-bound algorithms cannot take advantage of the parallel implementation. This leads to two distinct approaches for optimisation.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Berkhout, A.J., and C.P.A. Wapenaar, 1990, DELPHI: Delft philosophy on acoustic and elastic inversion: The Leading Edge, Vol. 9, No. 2, 30–34.
Quality Assured and Parallelizable Fortran 90 from Fortran 77, ESSI project 10292, Research funded by The Commission of the European Communities, DG III.
Verschuur, D.J., A.J. Berkhout, and C.P.A. Wapenaar, 1992, Surface-related multiple elimination: Geophysics, 57, No. 8, 1166–1177.
Rietveld, W.E.A., and A.J. Berkhout, 1994, Prestack depth migration by means of controlled illumination: Geophysics, 59, 801–809.
Beguelin, A., J.J. Dongarra, G.A. Geist, R. Manchek, and V.S. Sunderam, 1991, A User's Guide to PVM Parallel Virtual Machine, Technical Report ORNL/TM-11826, Oak Ridge National Laboratory.
FORGE Version 2.0, Release Notes, Feb. 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wedemeijer, H., Cox, H.L.H., Verschuur, D.J., Ritsema, I.L. (1996). Parallelisation of seismic algorithms using PVM and FORGE. In: Liddell, H., Colbrook, A., Hertzberger, B., Sloot, P. (eds) High-Performance Computing and Networking. HPCN-Europe 1996. Lecture Notes in Computer Science, vol 1067. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61142-8_569
Download citation
DOI: https://doi.org/10.1007/3-540-61142-8_569
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61142-4
Online ISBN: 978-3-540-49955-8
eBook Packages: Springer Book Archive