Parallel Algorithm Based on the Travel Time Computing of Pre-stack Time Migration Using GPU
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    The computation of traveling time of Pre-Stack Time Migration (PSTM) is the most time-consuming part of whole procedure. In this paper, we present a novel parallel algorithm to low the time of traveling-time computation. By using static interpolation with step of 8 points instead of dynamic step length, the new designed algorithm performs more accuracy and performance. Experimental results show that the speed-up number reaches 22.76 times. The statistical relative error demonstrates the better accuracy comparing with the commercial codebases.

    Reference
    Related
    Cited by
Get Citation

张清,迟旭光,谢海波,赵开勇,吴庆,陈维,王狮虎,褚晓文.基于GPU实现叠前时间偏移走时计算的并行算法.计算机系统应用,2011,20(8):42-46

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:November 11,2010
  • Revised:December 16,2010
  • Adopted:
  • Online:
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063