arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.11734physics.comp-ph
收藏

超快三维多孔介质生成:一种基于GPU的列表索引显式时间步进QSGS算法

Ultra-Fast 3D Porous Media Generation: a GPU- Accelerated List-Indexed Explicit Time-Stepping QSGS Algorithm

Khalifa University(哈利法大学)

Ruofan Wang, Mohammed Al-Kobaisi

AI总结:

本文提出了一种基于GPU的LIETS算法,显著提升了三维多孔介质生成效率,实现了在消费级GPU上2.7x10^7节点/秒的峰值吞吐量,并验证了其在砂岩基准测试中的有效性。

摘要:

高效生成高分辨率合成微结构对于数字岩石物理至关重要,然而传统的四元结构生成集(QSGS)算法在大规模三维网格上变得成本过高。我们开发了一种列表索引显式时间步进(LIETS)的QSGS方法,该方法将随机生长操作限制在显式活跃前沿而非整个体素网格。该方法使用NumPy在CPU上和CuPy在GPU上实现,并通过菱形扩张控制种子间距,同时结合体积分数依赖的定向生长概率。对于400^3域,LIETS将生成时间从串行CPU实现的数十分钟和向量化的CPU和GPU QSGS的几分钟减少到约24秒,在消费级RTX 4060上实现峰值吞吐量高达2.7x10^7节点/秒。在500^3分辨率的Fontainebleau砂岩基准测试中,LIETS重现了孔隙和颗粒尺寸分布对种子间距(最佳s=30体素)的依赖,并产生了在实验范围内与之前发表的Fast-QSGS结果一致的渗透率-孔隙率趋势。

英文摘要:

Efficient generation of high-resolution synthetic microstructures is essential in digital rock physics, yet classical Quartet Structure Generation Set (QSGS) algorithms become prohibitively expensive on large three-dimensional grids. We develop a list-indexed explicit time-stepping (LIETS) formulation of QSGS that restricts stochastic growth operations to an explicit active front instead of the entire voxel grid. The method is implemented in Python using NumPy on CPUs and CuPy on GPUs, and incorporates seed-spacing control via diamond dilation together with a volume-fraction-dependent directional growth probability. For a 400^3 domain, LIETS reduces generation time from tens of minutes for a serial CPU implementation and several minutes for vectorized CPU and GPU QSGS to about 24 s on a consumer-grade RTX 4060, achieving peak throughputs up to 2.7x10^7 nodes/s. A Fontainebleau sandstone benchmark at 500^3 resolution shows that LIETS reproduces the dependence of pore and grain size distributions on seed spacing (optimal s=30 voxels) and yields permeability-porosity trends within the experimental envelope and consistent with previously published Fast-QSGS results.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑