Jean-François Collard
ABSTRACT
Exact array dataflow analysis can be achieved in the general case if the only control structures are do-loops and structural ifs, and if loop counter bounds and array subscripts are affine expressions of englobing loop counters and possibly some integer constants. In this paper, we begin the study of dataflow analysis of dynamic control programs, where arbitrary ifs and whiles are allowed. In the general case, this dataflow analysis can only be fuzzy.
- 1.A. V Aho, R. Set, hi, and J. D. Ulhnan. Compzlers: Prtncq#le.s'. Technzq'uc,s and Tools. Addison-Wesley, Reading, Mass, 1986. Google Scholar
Digital Library
- 2.{'. Banoi'jee. Dependence ,4nalys#s for Supercompui'#g. Kluwer Academic Publishers, 1988. Google ScholarDigital Library
- 3.,1.-t7 ('ollard Space-time t, rausforl#la#ion of whilelool)s usiug speculative execut, ion. In Proc. of ih# 1,094 q#al~tbl( Htgh P#,@,'r#a'l#,ct CoJnpul#,ng Coal, page,, 429-436, Knoxville, #fenn., May 1994. IEEEGoogle Scholar
- 4.E. Duest, erwald, R. Gupt, a, and M.-L. Sofia A practical da#a flow framework for array reference a,nalysis a.nd it, s use in optimization. In ACM SIG- PLAN'93 Conf. on Prog. Lang. Deszgn and hnple- 7#enlal'#o#. pages 68-77, June 1993. Google ScholarDigital Library
- 5.P Feautrler Paramet, ric int, eger programming. RAIRO R#chcrch# Opgrai'tonnelh 22"243-268. Sept, ember 1 ,q#b.Google Scholar
- 6.P. Feaut, rler. Dataflow analysis of scalar and a rra? referenceb. Ini. Journal of Parallel Programm#n9, 20( 1 )'23--53. February 1991.Google Scholar
- 7.P. Feautrier. Seine efficient solutions to the affine scheduling problem, part I, one dimensional time, Ini. J. of Parallel Programming, 21(5)'313-348, Oct, ober 1992. Google ScholarDigital Library
- 8.(-'. Heckler and L Thiele. (#,omputing linear data depe#tdencies in nest, ed loop progralns. Parallel Pr'oc'#.s.s#ncl L(ii#',#. I994. #I'o appear.Google Scholar
- 9.\ Ma,slov. Lazy array dat, a-flow dependence analysis. In P7 of. 2 l,st .4 n.nual A CM b'IGPLAN-filGA CT ,5'y#l#p. POPL, pages 311---325, January 1994. Google ScholarDigital Library
- 10.D. E. Maydan, S. P. Amarasinghe, and M. S. Lain. Array da.t, aflow ana.lysls and its use in array privatization. In Prec. of A CM Conf. on Prznciples of Proqramm'tng Languages, pages 2-15, January 1993 Google ScholarDigital Library
- 11.W. Pugh and D. Wonnacott. An exa,ct method for a,na.lysls of value-ba.sed da.t,a dependences. #echmcal Report (',S-TR-3196, I'. of Maryland, December 1993.Google Scholar
Index Terms
- Fuzzy array dataflow analysis
Recommendations
Fuzzy array dataflow analysis
Exact array dataflow analysis can be achieved in the general case if the only control structures are do-loops and structural ifs, and if loop counter bounds and array subscripts are affine expressions of englobing loop counters and possibly some integer ...
Symbolic array dataflow analysis for array privatization and program parallelization
Supercomputing '95: Proceedings of the 1995 ACM/IEEE conference on SupercomputingArray dataflow information plays an important role for successful automatic parallelization of Fortran programs. This paper proposes a powerful symbolic array dataflow analysis to support array privatization and loop parallelization for programs with ...
Array-data flow analysis and its use in array privatization
POPL '93: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languagesData-flow analysis of scalar variables and data dependence analysis on array elements are two important program analyses used in optimizing and parallelizing compilers. Traditional data-flow analysis models accesses of array elements simply as accesses ...
Comments