scholarly journals Experiences in analyzing data dependences for programs with pointers and structures

Author(s):  
W. Amme ◽  
E. Zehendner
Keyword(s):  
1992 ◽  
Vol 27 (7) ◽  
pp. 140-151 ◽  
Author(s):  
William Pugh ◽  
David Wonnacott
Keyword(s):  

1994 ◽  
Vol 04 (03) ◽  
pp. 281-299
Author(s):  
RICHARD J. ANDERSON ◽  
BARBARA B. SIMONS

We present a fast loop parallelization heuristic that assigns separate invocations of a loop to different processors. If the loop contains data dependences between iterations, later iterations can be delayed while awaiting a result computed in an earlier iteration. In this paper we study a scheduling problem, called the Delay Problem, that approximates the problem of minimizing the delay in the start time of loops with loop-carried dependences. Our major result is a fast (O(n log 2 n)) time algorithm for the case where the precedence constraints are a forest of in-trees or a forest of out-trees. Since most graphs for the Delay Problem that arise in practice are sparse and consist of such a forest with possibly a few additional edges, this is an important case. We prove that the Delay Problem becomes NP-Complete when the precedence constraints are a set of arbitrary trees. We also prove that the Delay Problem becomes NP-Complete for independent chains when it is generalized to allow either non-unit execution times or release times and deadlines.


1997 ◽  
Vol 25 (2) ◽  
pp. 181-193 ◽  
Author(s):  
Andreas Moshovos ◽  
Scott E. Breach ◽  
T. N. Vijaykumar ◽  
Gurindar S. Sohi
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document