Name
Abstract | ||
|---|---|---|
Exact direction and distance vectors are essential for detecting hierarchical parallelism and examining legality of loop transformation for a multiple level loop nest. Much of this work has been done to address the problems of finding precise dependences between scalar references, except to use extended SSA form with factored use-def links. In this paper, we present a technique for calculating precise direction and distance vectors for scalar references within nested loops without using any forms of SSA. To do this, we use conventional use-def links in combination with joint dominator and joint postdominator relationships, which are extended from dominator and postdominator respectively in standard data flow analysis. The precision of dependence information gathered by our algorithm can not be achieved by traditional analysis of dominator or reaching definitions. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1109/APDC.1997.574055 | APDC |
Keywords | Field | DocType |
concurrent computing,algorithm design and analysis,data flow analysis,intelligent systems,law,nested loops,testing,parallel processing,compilers | Algorithm design,Scalar (mathematics),Computer science,Scalar (physics),Parallel computing,Algorithm,Data-flow analysis,Concurrent computing,Dominator,Static single assignment form,Nested loop join | Conference |
Volume | Issue | ISBN |
null | null | 0-8186-7876-3 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gao Nianshu | 1 | 1 | 0.75 |
| Zhao-Qing Zhang | 2 | 61 | 7.44 |
| Qiao Ruliang | 3 | 8 | 2.28 |