用于2D Marchenko成像的多GPU基准测试
A multi-GPU benchmark for 2D Marchenko Imaging
摘要:
马尔琴科方法允许估计格林函数与虚拟源在地下从表面上的反射响应。这是一个反问题,可以直接或通过迭代方案求解,后者在计算上更可行。在这项工作中,我们提出了一个完善的迭代Marchenko算法的基础上(的)诺依曼系列的多GPU实现。在每次迭代中执行的时间卷积和空间积分(也称为合成)在这里表示为分段点积,可以通过使用warp-shuffle指令和CUDA库在现代GPU上加速。原始CPU版本在36个CPU核心上进行基准测试,而实现版本在4个GPU上进行基准测试,三个不同的反射数据集,大小从3 GB到250 GB不等。
英文摘要:
The Marchenko method allows estimating Green's functions with a virtual source in the subsurface from a reflection response on the surface. It is an inverse problem that can be solved directly or by an iterative scheme, with the latter being more feasible computationally. In this work we present a multi-GPU implementation of a well-established iterative Marchenko algorithm based on (the) Neumann series. The time convolution and space integration performed on each iteration, also referred to as synthesis, are here represented as a segmented dot product, which can be accelerated on modern GPUs through the usage of warp-shuffle instructions and CUDA libraries. The original CPU version is benchmarked on 36 CPU cores versus the implemented version on 4 GPUs, over three different reflection data sets, with sizes ranging from 3 GB to 250 GB.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。