DocumentCode
968403
Title
Run-time disambiguation: coping with statically unpredictable dependencies
Author
Nicolau, Alexandru
Author_Institution
Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
Volume
38
Issue
5
fYear
1989
fDate
5/1/1989 12:00:00 AM
Firstpage
663
Lastpage
678
Abstract
A technique called run-time disambiguation (RTD) is presented for antialiasing of indirect memory references that cannot normally be disambiguated at compile time. The technique relies on assumptions about the run-time behavior of a program to allow static transformations of the code, in an effort to extract parallelism. The importance of the technique lies in its ability to supplement (and even partially replace) more expensive fully static dependency analysis. RTD works even in situations where the fully static approach is completely ineffective. Evidence of the importance of memory disambiguation in general, and RTD in particular, for parallelizing compilers, is presented. The implementation and effectiveness of the technique in the context of the Bulldog compiler is discussed
Keywords
program compilers; Bulldog compiler; RTD; antialiasing; code; compile time; indirect memory references; memory disambiguation; parallelism; run-time behavior; run-time disambiguation; static dependency analysis; static transformations; statically unpredictable dependencies; Computer science; Law; Legal factors; Optimizing compilers; Parallel processing; Program processors; Read-write memory; Runtime;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.24269
Filename
24269
Link To Document