ACM Home Page
Please provide us with feedback. Feedback
A practical algorithm for exact array dependence analysis
Full text PdfPdf (4.04 MB)
Source
Communications of the ACM archive
Volume 35 ,  Issue 8  (August 1992) table of contents
Pages: 102 - 114  
Year of Publication: 1992
ISSN:0001-0782
Author
William Pugh  Univ. of Maryland, College Park
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 78,   Citation Count: 155
Additional Information:

references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/135226.135233
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
3
4
 
5
6
 
7
Dantzig, G.B. and Eaves, B,C. Fourier-Motzkin elimination and its dual. J. Combin. Theo. A, 14 (1973), 288-297.
8
 
9
Haghighat, M. and Poiychronopoutos, C. Symbolic dependence analysis for high Performance parallelizing compilers. In Proceed.. ings of the Third Workshop on Languages and Compilers for Parallel Com.. puting, Aug. 1990.
 
10
11
 
12
Klappholz, D. and Kong, X, Extending the Bane{jee-Wolfe test to handle execution conditions. Tech. Rep. 9101, Dept. of EE/CS, Stevens Institute of' Technology, 199i.
 
13
Kuck, D., Muraoka, Y. and Chen, S. On the number of operations simultaneousiy executable in Fortrandike programs and their resulting speedup. IEEE Trans. Comput., 1972.
 
14
15
16
 
17
18
 
19
20
21
 
22
Triolet, R. Interprocedural analysis for program restructuring with Parafrase. CSRD R.ep, 538, Dept. of Computer Science, University of Illinois at Urbana-Champaign, Dec. 1985.
23
 
24
Wotft:, Md. Optimizing supercompilers f'or supercomputers. PhD thesis, Dept, of Computer Science, University of Illinois at Urbanao Champaign, Oct, 1982,
 
25
WolIie, M. Optimizing Supercompiters for Supercomputers. Pitman Publishing, London, 1989.
 
26
Wolfe, M. The tiny loop restructur ing resea:rch tool. In Proceedings o{' 1991 lnternationat Conference on Para allel Processing, 1991.
 
27
Wolfe, M. and Tseng, C, The power test for data dependence. Tech. Rep CS/E 90-015, Oregon Graduate Institme, Aug. 1990.

CITED BY  155


REVIEW

"Pierre Jouvelot : Reviewer"

Parallelizing compilers use dependence analysis to detect instructions that do not conflict in memory; these instructions are amenable to parallel scheduling. Most of the interesting parallelism occurs between array-manipulating instructions  more...