A Computation Partition Based on Uniform Partitioning Schemes for Parallel Loops
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    Computation partition is one of the most important problems in parallel compilation and optimization. For dealing with parallel loops with determinated data distribution, a computation partition algorithm based on the subset of uniform schemes is proposed. The method of getting the subset of uniform schemes is given, as well as the algorithm of selecting the most optimized scheme under the consideration of communication and load balance. The experimental results prove that this algorithm is simpler and more effective than several previous algorithms in dealing with parallel loops, and the p_HPF compiler adopted by this algorithm can obtain good speedups and efficiencies. The compiler has been applied in the field of petroleum.

    Reference
    Related
    Cited by
Get Citation

黄其军,杨建武,余华山,许卓群.基于规范划分集的并行循环计算划分.软件学报,2003,14(3):362-368

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:November 19,2001
  • Revised:May 13,2002
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063