| 本文已被：浏览 4195次 下载 6307次 |
码上扫一扫！ |
|
|
| 一种基于共享存储的叠前深度偏移并行算法 |
|
李建江1, 舒继武1, 王有新2, 王鼎兴1, 郑纬民1
|
|
1.清华大学计算机科学与技术系,北京,100084;2.中国石油天然气集团公司石油地球物理勘探局,河北,涿州,072751
|
|
| 摘要: |
| 为了解决叠前深度偏移计算量巨大这个问题,人们投入了很大精力来开发高效的并行算法.就此,在对一些相关并行算法进行分析之后,根据三维叠前Kirchhoff深度偏移的特点,提出了一种基于共享存储的简化并行算法.其中Slave进程直接存储和读取射线旅行时,消息传递总量显著减少;同时合理地结合"任务池"技术与粗粒度级并行,前者确保动态负载平衡,后者使得Slave与Master之间的通信开销尽可能小.实际数据的测试结果表明,此并行算法高效且可扩展性较好. |
| 关键词: 三维叠前Kirchhoff深度偏移 共享存储 并行算法 消息传递 动态负载平衡 效率 可扩展性 |
| DOI： |
| 分类号: |
| 基金项目:国家自然科学基金资助项目(69933020) |
|
| A Parallel Algorithm for Prestack Depth Migration Based on Shared Memory |
|
LI Jian-jiang,SHU Ji-wu,WANG You-xin,WANG Ding-xing,ZHENG Wei-min
|
| Abstract: |
| Prestack depth migration is computationally intensive. To deal with this problem, people have made big efforts to develop high efficient parallel algorithms. In this paper, after some parallel algorithms are analyzed, according to the character of 3-D Kirchhoff depth migration, a simplified algorithm is presented based on shared memory . In the proposed algorithm, the slave processes store and read ray traveltimes directly so that the total amount of message passing will be remarkably decreased. At the same time, this algorithm has well combined both the "task pool" and the "coarse granularity" techniques together, the former ensuring the dynamic load-balance and the latter reduing the cost of communication between the slaves and the master. In the end, experimental results show that this algorithm has high efficiency and scalability. |
| Key words: 3-D prestack Kirchhoff depth migration shared memory parallel algorithm message passage dynamic load-balance efficiency scalability |
