Abstract
Dijkstra’s single-source shortest path algorithm has been applied in seismic tomography to determine paths of minimum travel time from all locations in a 3D earth model to sensors used in seismic experiments. An iterative data parallel algorithm is formulated for seismic tomography based on the Bellman-Ford-Moore (BFM) algorithm. Performance is demonstrated for OpenMP on multicore processors and OpenCL on GPUs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
A forward star around point p of radius r will include all grid points within a distance of \(\delta ~*~r\) from p, where \(\delta \) is the grid point unit spacing. Some of those points will be redundant (e.g., colinear points) and can be removed from consideraton.
References
Bellman, R.: On a routing problem. Q. Appl. Math. 16, 87–90 (1958)
Bezada, M., Humphreys, E., Toomey, D., Harnafi, M., Davila, J., Gallart, J.: Evidence for slab rollback in westernmost mediterranean from improved upper mantle imaging. Earth Planet. Sci. Lett. 368, 51–60 (2013)
Davidson, A., Baxter, S., Garland, M., Owens, J.: Work-efficient parallel GPU methods for single-source shortest paths. In: International Parallel and Distributed Processing Symposium, pp. 349–359. IEEE, May 2014
Dijkstra, E.: A note on two problems in connection with graphs. Numer. Math. 1, 269–271 (1959)
Douglas, J.: Alternating direction methods for three space variables. Numerische Mathematik 4(1), 41–63 (1962)
Ford, L.: Network Flow Theory. RAND Corporation (1956)
Klimes, L., Kvasnicka, M.: 3-D network ray tracing. Geophys. J. Int. 116(3), 726–738 (1994)
Moore, E.: The shortest path through a maze. In: International Symposium Switching Theory, pp. 285–292. Harvard University Press (1957)
Moser, T.: Shortest path calculation of seismic rays. Geophysics 56(1), 59–67 (1991)
Nolet, G.: A Breviary of Seismic Tomography: Imaging the Interior of the Earth and Sun. Cambridge University Press, New York (2008)
Rasmussen, C., Sottile, M., Rasmussen, S., Nagle, D., Dumars, W.: Cafe: coarray fortran extensions for heterogeneous computing. In: 21st International Workshop High-Level Parallel Programming Models and Supportive Environments, HIPS 2016 Chicago, IL, USA, 23 May 23, 2016, Proceedings (2016)
Reid, J.: The new features of fortran 2008. SIGPLAN Fortran Forum 27(2), 8–21 (2008)
Sottile, M., Rasmussen, C., Weseloh, W., Robey, R., Quinlan, D., Overbey, J.: ForOpenCL: transformations exploiting array syntax in fortran for accelerator programming. Int. J. Comput. Sci. Eng. 8(1), 47–57 (2013)
The Fortran Committee. TS 18508 Additional parallel features in Fortran. ISO/IEC JTC1/SC22/WG5 N2007, March 2014
Toomey, D., Solomon, S., Purdy, G.: Tomographic imaging of the shallow crustal structure of the East Pacific Rise at \(9^{\circ }30^{\prime }\). J. Geophys. Res. 99, 24–24 (1994)
Trunfio, G., Sirakoulis, G.: Computing multiple accumulated cost surfaces with graphics processing units. In: International Conference on Parallel, Distributed, and Network-based Processing (PDP). Euromicro (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Malony, A.D. et al. (2017). A Data Parallel Algorithm for Seismic Raytracing. In: Dutra, I., Camacho, R., Barbosa, J., Marques, O. (eds) High Performance Computing for Computational Science – VECPAR 2016. VECPAR 2016. Lecture Notes in Computer Science(), vol 10150. Springer, Cham. https://doi.org/10.1007/978-3-319-61982-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-61982-8_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-61981-1
Online ISBN: 978-3-319-61982-8
eBook Packages: Computer ScienceComputer Science (R0)