Earticle

초록

영어

Stencils are finite-difference algorithms for solving large-scale and high-dimension partial differential equations. Due to the data dependences among the iterative statements in Stencils, traditional Stencil computations are be executed serially, rather than in parallel. It’s challenging to design an effective and scalable Stencil parallelized method. To address the issue of 3D data space computing, we present a serial execution model based on multi-layers symmetric Stencil method and time skewing techniques. Within this model, the iteration space is divided to multiple tiles based on time skewing, where the executive process is ordered by the sequence of tiles, and the nodes in each individual tile can be swept repeatedly to improve the data locality. In addition, we propose a novel 3D iterative space alternate tiling Stencil parallel method, which subdivides the iteration space along high dimension, and changes the execution sequence of tiles to reduce the data dependency and communication cost, where the partial order of tiles is still guaranteed. Experimental results demonstrate our proposed alternative tiling parallel method achieves better parallel efficiency and scalability compared with the domain-decomposition methods.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Background and Problem Statements
 4. Iterative Space Multi-layer Symmetric 3D Stencil Algorithm
  4.1. Multi-layer Symmetric Stencil Algorithm
  4.2. Polyhedral Model Description
  4.3. Execution Model of Multi-layer Symmetric 3D Stencil Algorithm
 5. Parallel Alternative Tiling Stencil Algorithm
  5.1. Execution Model of Alternative Tiling Stencil Algorithm
  5.2. Alternative Tiling Stencil Algorithm
 6. Result
  6.1. Tile Size and Shape
  6.2. Comparison
  6.3. Parallelism and Scalability
 7. Conclusion
 Acknowledgements
 References

키워드

저자

• Jing Shen [ School of Computer Science and Technology, Hangzhou Dianzi University, 310018, Hangzhou, Zhejiang, China, Key Laboratory of Complex Systems Modeling and Simulation, Ministry of Education, China, Zhejiang Provincial Engineering Center on Media Data Cloud Processing and Analysis, Hangzhou, China, School of Information Engineering, Hangzhou Dianzi University, Hangzhou, Zhejiang, China ]
• Jilin Zhang [ School of Computer Science and Technology, Hangzhou Dianzi University, 310018, Hangzhou, Zhejiang, China, Key Laboratory of Complex Systems Modeling and Simulation, Ministry of Education, China, Zhejiang Provincial Engineering Center on Media Data Cloud Processing and Analysis, Hangzhou, China ]
• Jian Wan [ School of Computer Science and Technology, Hangzhou Dianzi University, 310018, Hangzhou, Zhejiang, China, Key Laboratory of Complex Systems Modeling and Simulation, Ministry of Education, China, Zhejiang Provincial Engineering Center on Media Data Cloud Processing and Analysis, Hangzhou, China ]
• Li Zhou [ School of Computer Science and Technology, Hangzhou Dianzi University, 310018, Hangzhou, Zhejiang, China, Key Laboratory of Complex Systems Modeling and Simulation, Ministry of Education, China, Zhejiang Provincial Engineering Center on Media Data Cloud Processing and Analysis, Hangzhou, China ]
• Ming Jiang [ School of Computer Science and Technology, Hangzhou Dianzi University, 310018, Hangzhou, Zhejiang, China, Key Laboratory of Complex Systems Modeling and Simulation, Ministry of Education, China, Zhejiang Provincial Engineering Center on Media Data Cloud Processing and Analysis, Hangzhou, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Database Theory and Application

• 간기

  격월간

• pISSN

  2005-4270

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605