Efficient Loop Partitioning for Parallel Codes of Irregular Scientific Computations(Software Systems)
スポンサーリンク
概要
- 論文の詳細を見る
In most cases of distributed memory computations, node programs are executed on processors according to the owner computes rule. However, owner computes rule is not best suited for irregular application codes. In irregular application codes, use of indirection in accessing left hand side array makes it difficult to partition the loop iterations, and because of use of indirection in accessing right hand side elements, we may reduce total communication by using heuristics other than owner computes rule. In this paper, we propose a communication cost reduction computes rule for irregular loop partitioning, called least communication computes rule. We partition a loop iteration to a processor on which the minimal communication cost is ensured when executing that iteration. Then, after all iterations are partitioned into various processors, we give global vs. local data transformation rule, indirection arrays remapping and communication optimization methods. The experimental results show that, in most cases, our approaches achieved better performance than other loop partitioning rules.
- 社団法人電子情報通信学会の論文
- 2003-09-01
著者
-
Guo M
The School Of Computer Science And Engineering University Of Aizu
-
Guo Minyi
Doctoral Program In Engineering University Of Tsukuba
-
Guo Minyi
Department Of Computer Science And Engineering Shanghai Jiao Tong University
関連論文
- Trusted Routing Based on Dynamic Trust Mechanism in Mobile Ad-Hoc Networks
- Message Scheduling for Irregular Data Redistribution in Parallelizing Compilers(Parallel/Distributed Programming Models, Paradigms and Tools, Paradigms and Tools, Parallel/Distributed Computing and Networking)
- A Parallel Implementation of Multi-Domain High-Order Navier-Stokes Equations Using MPI(Scientific and Engineering Computing with Applications)(Hardware/Software Support for High Performance Scientific and Engineering Computing)
- Efficient Implementation of Multi-Dimensional Array Redistribution
- An Efficient Data Distribution Technique for Distributed Memory Parallel Computers (特集:並列処理)
- An Efficient Data Distribution Technique for Distributed Memory Parallel Computers
- A Secure and Scalable Rekeying Mechanism for Hierarchical Wireless Sensor Networks
- Efficient Communication Optimization for Irregular Array References (ハイパフォーマンスコンピューティング研究報告 2001年並列/分散/協調処理に関する『沖縄』サマー・ワークショップ(SWoPP「沖縄」2001)--研究会・連続同時開催)
- Programming Support for MPMD Parallel Computing in ClusterGOP(Software Support and Optimization Techniques)(Hardware/Software Support for High Performance Scientific and Engineering Computing)
- Multipath Routing with Reliable Nodes in Large-Scale Mobile Ad-Hoc Networks
- Fast Parallel Solution for Set-Packing and Clique Problems by DNA-Based Computing(Scientific and Engineering Computing with Applications)(Hardware/Software Support for High Performance Scientific and Engineering Computing)
- Efficient Loop Partitioning for Parallel Codes of Irregular Scientific Computations(Software Systems)
- Optimization Techniques for Parallel Codes of Irregular Scientific Computations(Code Generation and Optimization)
- Tier-Based Scalable and Secure Routing for Wireless Sensor Networks with Mobile Sinks