
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
M. Wolfe, C.W. Tseng, "The Power Test for Data Dependence," IEEE Transactions on Parallel and Distributed Systems, vol. 3, no. 5, pp. 591601, September, 1992.  
BibTex  x  
@article{ 10.1109/71.159042, author = {M. Wolfe and C.W. Tseng}, title = {The Power Test for Data Dependence}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {3}, number = {5}, issn = {10459219}, year = {1992}, pages = {591601}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.159042}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  The Power Test for Data Dependence IS  5 SN  10459219 SP591 EP601 EPD  591601 A1  M. Wolfe, A1  C.W. Tseng, PY  1992 KW  Index Termsvariable elimination; power test; data dependence decision algorithm; extended GCDalgorithm; FourierMotzkin method; inequalities; simultaneous loop limits; compiler;interactive program restructuring environment; parallel algorithms; parallel programming; program compilers; programming theory VL  3 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] F. Allen, M. Burke, P. Charles, R. Cytron, and J. Ferrante, "An overview of the PTRAN analysis system for multiprocessing," inSupercomputing: 1st International Conf., Lecture Notes in Computer Science, vol. 297, E. N. Houstis, T. S. Papatheodorou, and C. D. Polychronopoulos, Eds. Berlin, Germany: SpringerVerlag, 1987, pp. 194211.
[2] F. Allen, M. Burke, P. Charles, R. Cytron, and J. Ferrante, "An overview of the PTRAN analysis system for multiprocessing,"J. Parallel Distributed Comput., vol. 5, no. 5, pp. 617640, Oct. 1988.
[3] J.R. Allen and K. Kennedy, "Automatic loop interchange," inProc. SIGPLAN '84 Symp. Comp. Construct., Montreal, Canada, July 1984.
[4] R. Allen and K. Kennedy, "Automatic translation of FORTRAN to vector form,"ACM Trans. Programming Languages Syst., vol. 9, no. 4, pp. 491524, 1987.
[5] U. Banerjee, "Data dependence in ordinary programs," M.S. thesis UIUCDCSR76837, Dep. Comput. Sci., Univ. Illinois, Nov. 1976.
[6] U. Banerjee, "Speedup of ordinary programs," Ph.D dissertation, Dep. Comput. Sci. Univ. Illinois, UrbanaChampaign, Rep. No. UIUCDCSR79989, 1979.
[7] U. Banerjee,Dependence Analysis for Supercomputing, Kluwer Academic Publishers, Norwell, Mass., 1988.
[8] U. Banerjee, S.C. Chen, D. J. Kuck, and R. A. Towle, "Time and parallel processor bounds for Fortranlike loops,"IEEE Trans. Comput., vol. C28, no. 9, pp. 660670, Sept. 1979.
[9] M. Burke and R. Cytron, "Interprocedural dependence analysis and parallelization," inProc. SIGPLAN '86 Symp. Comp. Construct., Palo Alto, CA, June 1986, pp. 162175.
[10] W. L. Cohagan, "Vector optimization for the ASC," inProc. Seventh Annu. Princeton Conf. Inform. Sci. and Syst., Mar. 1973, pp. 169174.
[11] G. B. Dantzig and B. C. Eaves, "FourierMotzkin elimination and its dual,"J. Combinatorial Theory (A), vol. 14, pp. 288297, 1973.
[12] R. J. Duffin, "On Fourier's analysis of linear inequality systems," inMathematical Programming Study 1. Amsterdam, The Netherlands, NorthHolland, 1974, pp. 7195.
[13] P. Feautrier, "Parametric integer programming,"RAIRO Recherche Operationnelle, vol. 22, no. 3, pp. 243268, Sept. 1988.
[14] D. Gannon, W. Jalby, and K. Gallivan, "Strategies for cache and local memory management by global program transformation," inSupercomputing: 1st International Conf., Lecture Notes in Computer Science, vol. 297, E. N. Houstis, T. S. Papatheodorou, and C. D. Polychronopoulos, Ed. Berlin, Germany: SpringerVerlag, 1987, pp. 229254.
[15] D. Gannon, W. Jalby, and K. Gallivan, "Strategies for Cache and Local Memory Management by Global Program Transformation,"J. Parallel and Distributed Computing, Vol. 5, No. 5, Oct. 1988, pp. 587616.
[16] G. Goff, K. Kennedy, and C.W. Tseng, "Practical Dependence Testing,"Proc. ACM SIGPLAN '91 Conf. Programming Language Design and Implementation, ACM Press, New York, June 1991, pp. 1529.
[17] E. N. Houstis, T. S. Papatheodorou, and C. D. Polychronopoulos, Ed.,Supercomputing: 1st International Conf., Lecture Notes in Computer Sciencevol. 297. Berlin, Germany: SpringerVerlag, 1987.
[18] K. Kennedy, "Triangular Banerjee inequality," Tech. Rep. Supercomputer Software Newsletter #8, Dep. Comput. Sci., Rice Univ., Oct. 1986.
[19] D. Klappholz, K. Psarris, and X. Kong, "On the perfect accuracy of an approximate subscript analysis test," inProc. 1990 ACM Int. Conf. Supercomput., Amsterdam, June 1990.
[20] D. E. Knuth,The Art of Computer Programming, Vol. 2, Seminumerical Algorithms. Reading, MA: AddisonWesley, 1981.
[21] X. Kong, D. Klappholz, and K. Psarris, "The I test: A new test for subscript data dependence," inProc. 1990 Int. Conf. Parallel Processing, vol. II, D. Padua, Ed., St. Charles, IL, Aug. 1990. University Park, PA: Penn State Press, pp. 204211.
[22] R. H. Kuhn, "Optimization and interconnection complexity for: parallel processors, single stage networks, and decision trees," Ph.D. dissertation, Dep. Comput. Sci., Rep. 801009, Univ. of Illinois, UrbanaChampaign, IL, 1980.
[23] Z. Li, "Intraprocedural and interprocedural data dependence analysis for parallel computing," Ph.D. dissertation in preparation, Dep. Comput. Sci., Univ. Illinois, UrbanaChampaign, 1989.
[24] Z. Li, P.C. Yew, and C.Q. Zhu, "An efficient data dependence analysis for parallelizing compilers,"IEEE Trans. Parallel Distributed Syst., vol. 1, no. 1, pp. 2634, Jan. 1990.
[25] D. Padua, Ed.,Proc. 1990 Int. Conf. Parallel Processing, vol. II, St. Charles, IL, Aug. 1990. University Park, PA: Penn State Press.
[26] A. Schrijver,Theory of Linear and Integer Programming. New York: Wiley, 1986.
[27] R. Shostak, "Deciding linear inequalities by computing loop residues,"ACM J.vol. 28, pp. 769779, Oct. 1981.
[28] Proc. SIGPLAN '86 Symp. Compiler Construction, Palo Alto, CA, June 1986.
[29] R. Triolet, "Direct Parallelization of Call Statement,"SIGPlan Notices, July 1986, pp. 176185.
[30] D. R. Wallace, "Dependence of multidimensional array references," inProc. 1988 Int. Conf. Supercomputing, St. Malo, France, July 1988.
[31] H. P. Williams, "FourierMotzkin elimination extension to integer programming problems,"J. Combinatorial Theory (A), vol. 21, pp. 118123, 1976.
[32] H. P. Williams, "A characterisation of all feasible solutions to an integer program,"Discrete Appl. Mathemat., vol. 5, pp. 147155, 1983.
[33] M. J. Wolfe, "Optimizing supercompilers for supercomputers," Ph.D. thesis, Ctr. Supercomput. Res. and Development, Univ. Illinois, UrbanaChampaign, 1980.
[34] M. Wolfe, "Advanced loop interchanging," inProc. 1986 Int. Conf. Parallel Processing, K. Hwang, S. M. Jacobs, and E. E. Swartzlander, Eds., St. Charles, IL, Aug. 1986, pp. 536543.
[35] M. Wolfe,Optimizing Supercompilers for Supercomputers. Cambridge MA: MIT Press, 1989.
[36] M. Wolfe, "The Tiny loop restructuring research tool," inProc. 1991 Int. Conf. Parallel Processing, vol. II, St. Charles, IL, Aug. 1991. University Park: Penn State Press, pp. 4653.
[37] M. Wolfe and U. Banerjee, "Data Dependence and Its Application to Parallel Processing,"Int'l J. Parallel Programming, Vol. 16, No. 2, Apr. 1987, pp. 137178.
[38] M. Wolfe and C.W. Tseng, "The Power test for data dependence," Tech. Rep. CSE 90015, Oregon Graduate Institute, Aug. 1990.