loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
1997 Advances in Parallel and Distributed Computing Conference (APDC '97)
Precise Dependence Test for Scalar within Nested Loops
Shanghai, CHINA
March 19-March 21
ISBN: 0-8186-7876-3
Gao Nianshu, National Research Center for Intelligent Computing
Zhang Zhaoqing, National Research Center for Intelligent Computing
Qiao Ruliang, National Research Center for Intelligent Computing
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.
Citation:
Gao Nianshu, Zhang Zhaoqing, Qiao Ruliang, "Precise Dependence Test for Scalar within Nested Loops," apdc, pp.356, 1997 Advances in Parallel and Distributed Computing Conference (APDC '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.