Out-of-Core Computations of High-Resolution Level Sets by Means of Code Transformation

被引:0
作者
Christensen, Brian B. [1 ,2 ]
Nielsen, Michael B. [1 ,3 ]
Museth, Ken [1 ,4 ]
机构
[1] Aarhus Univ, Aarhus, Denmark
[2] Alexandra Inst, Aarhus, Denmark
[3] Weta Digital, Wellington, New Zealand
[4] DreamWorks Animat, Glendale, CA USA
关键词
Level set methods; Out-of-core; Streaming; Code transformation; Loop skewing; Loop tiling; Parallelism; EFFICIENT IMPLEMENTATION; DATA LOCALITY; ALGORITHMS; OPTIMIZATION;
D O I
10.1007/s10915-011-9488-0
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We propose a storage efficient, fast and parallelizable out-of-core framework for streaming computations of high resolution level sets. The fundamental techniques are skewing and tiling transformations of streamed level set computations which allow for the combination of interface propagation, re-normalization and narrow-band rebuild into a single pass over the data stored on disk. When combined with a new data layout on disk, this improves the overall performance when compared to previous streaming level set frameworks that require multiple passes over the data for each time-step. As a result, streaming level set computations are now CPU bound and consequently the overall performance is unaffected by disk latency and bandwidth limitations. We demonstrate this with several benchmark tests that show sustained out-of-core throughputs close to that of in-core level set simulations.
引用
收藏
页码:368 / 404
页数:37
相关论文
共 61 条
[1]   A FAST LEVEL SET METHOD FOR PROPAGATING INTERFACES [J].
ADALSTEINSSON, D ;
SETHIAN, JA .
JOURNAL OF COMPUTATIONAL PHYSICS, 1995, 118 (02) :269-277
[2]   THE INPUT OUTPUT COMPLEXITY OF SORTING AND RELATED PROBLEMS [J].
AGGARWAL, A ;
VITTER, JS .
COMMUNICATIONS OF THE ACM, 1988, 31 (09) :1116-1127
[3]  
[Anonymous], 1987, ACM siggraph computer graphics, DOI [10.1145/37401.37422, DOI 10.1145/37401.37422]
[4]  
[Anonymous], STANFORD SCANNING RE
[5]  
[Anonymous], THESIS STANFORD U
[6]  
[Anonymous], LECT NOTES PHYS
[7]   Variational problems and partial differential equations on implicit surfaces [J].
Bertalmío, M ;
Cheng, LT ;
Osher, S ;
Sapiro, G .
JOURNAL OF COMPUTATIONAL PHYSICS, 2001, 174 (02) :759-780
[8]   Memory-constrained data locality optimization for tensor contractions [J].
Bibireata, A ;
Krishnan, S ;
Baumgartner, G ;
Cociorva, D ;
Lam, CC ;
Sadayappan, P ;
Ramanujam, J ;
Bernholdt, DE ;
Choppella, V .
LANGUAGES AND COMPILERS FOR PARALLEL COMPUTING, 2004, 2958 :93-108
[9]   COMPUTING MINIMAL-SURFACES VIA LEVEL SET CURVATURE FLOW [J].
CHOPP, DL .
JOURNAL OF COMPUTATIONAL PHYSICS, 1993, 106 (01) :77-91
[10]  
DERVIEUX A, 1979, SPRINGER LECT NOTES, V771, P145