Name
Abstract | ||
|---|---|---|
For irregular applications on distributed-memory systems, computation partition is an important issue on parallel compiling techniques of parallelizing compilers. In this paper, we propose a local optimal solution, called heuristic computes rule (HCR), which could be used for irregular loop partitioning. This rule considers both the iteration being partitioned and the iterations partitioned, which ensures that iterations are assigned so as to produce less communication costs. And HCR rule proposes that irregular loop partitioning should trade off the maximum message degrees of processors, the number of messages, the message sizes, and workload balance. In our experiments, we compare HCR with almost owner computes rule and least communication computes rule. The results show that the executing of irregular loop partitioned by HCR rule has much less communication cost and achieve better performance. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-11842-5_23 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Keywords | Field | DocType |
communication cost,maximum message degree,heuristic computes rule,hcr rule,parallelizing compiler,heuristic rule,irregular application,owner computes rule,irregular loop partitioning,irregular loop,communication computes rule,message size,distributed memory | Heuristic,Workload,Computer science,Parallel computing,Theoretical computer science,Compiler,Partition (number theory),Distributed computing,Computation | Conference |
Volume | Issue | ISSN |
5938 LNCS | null | 16113349 |
ISBN | Citations | PageRank |
3-642-11841-0 | 0 | 0.34 |
References | Authors | |
4 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Changjun Hu | 1 | 130 | 27.56 |
| Yali Liu | 2 | 5 | 1.25 |
| Jue Wang | 3 | 2 | 1.72 |
| Jianjiang Li | 4 | 44 | 9.59 |