1887
PDF

Abstract

Summary

We focus on accelerating graph processing for seismic data interpretation using GPUs, particularly through the optimization of the Breadth First Search (BFS) algorithm. Seismic interpretation tools like NextVision require processing large graphs, which is traditionally compute-intensive. Initially parallelized on multicore CPUs, the code was slow for large datasets. To improve performance, we implemented GPU acceleration using NVIDIA’s cuGraph library.

The approach involved optimizing the BFS algorithm by launching multiple concurrent searches from independent vertices, maximizing parallelism and reducing overhead. Graph data was efficiently managed using RAPIDS Memory Manager (RMM), and the cuGraph API enabled efficient graph creation and BFS execution without redundant data replication. CUDA multi-streaming was also optimized to improve GPU utilization. Additionally, THRUST API was used to handle dynamic graph updates efficiently.

Experimental results showed significant performance improvements, particularly on larger graphs. The performance platform with an A100 GPU achieved speedups of up to 4.95x for a 44GB graph. Future work will explore additional algorithms, like FastAPSP, to further enhance performance. This study demonstrates the potential of GPU acceleration to significantly speed up graph algorithms in seismic data interpretation, benefiting geophysical analysis.

Loading

Article metrics loading...

/content/papers/10.3997/2214-4609.2024636024
2024-09-16
2026-01-25
Loading full text...

Full text loading...

/deliver/fulltext/2214-4609/2024/eight-eage-high-performance-computing-workshop/24_-_Noomane_Keskes.html?itemId=/content/papers/10.3997/2214-4609.2024636024&mimeType=html&fmt=ahah

References

  1. RAPIDS Graph documentation (2024). URL: https://docs.rapids.ai/api/cugraph/stable/cuGraphcomputeconnectedcomponents
  2. Harris, M. (2020, December 8). Fast, flexible allocation for NVIDIA CUDA with RAPIDS Memory Manager. In RAPIDS AI Blog. https://rapids.ai/blog/2020/12/08/rapids-memory-manager.html
    [Google Scholar]
  3. RAPIDS AI team. (2024). Device memory resources. In RAPIDS API documentation. Retrieved from https://docs.rapids.ai/api/raft/stable/vector_search_tutorial/#advanced-features
    [Google Scholar]
  4. Yang, S., Liu, X., Wang, Y., He, X., & Tan, G. (2023). Fast All-Pairs Shortest Paths Algorithm in Large Sparse Graph. In Proceedings of the 37th International Conference on Supercomputing (pp. 505). ACM.
    [Google Scholar]
/content/papers/10.3997/2214-4609.2024636024
Loading
/content/papers/10.3997/2214-4609.2024636024
Loading

Data & Media loading...

This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error