.png){kind=icon}
返回
A parallel texture-based region-growing algorithm implemented in OpenMP
.png){kind=icon}
OA
AI
DOI：10.1038/s41598-025-89960-8.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We introduce an innovative OpenMP design and implementation of a search-growing algorithm for fine-grained lock-based parallelization, which enhances automatic volume extraction in seismic data represented by 3D voxel pictures to detect salt bodies and assess the voxel texture. The first algorithm was developed in MATLAB, subsequently translated to Fortran, and ultimately enhanced with OpenMP pragmas to facilitate the parallel version. In the parallel version, synchronization techniques are essential to enforce limits on the sequence of voxel analysis conducted by the threads. To do this, we employed OpenMP locks to ensure that only a single thread can process one voxel, hence maintaining the coherence of the data. Minimizing crucial regions in parallel programming is advisable as they might hinder scalability and performance. In this application, locks do not induce latency since not all threads attempt to access the same voxel, indicating that not all threads traverse the same critical region. Our design involves securing each voxel that may adapt to the 3D image, enhancing performance and markedly decreasing execution time. Performance trials were conducted on a dual Xeon system featuring twenty physical cores, with Hyperthreading (HT) both disabled and enabled. In this investigation, HT improved slightly the performance.
Keyword:
PCA
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
28.3W
被引数:
83.5W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容