Runtime Disambiguation: Coping with Statically Unpredictable Dependencies

IEEE Transactions on Computers

Volumn 38, Issue 5, 1989, Pages 663-678

  Nicolau, Alexandru ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

Data dependencies; memory disambiguation; optimizing compilers; parallelism; statically scheduled machines; very large instruction word machines

Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS;

ANTIALIASING; INDIRECT MEMORY REFERENCES; MEMORY DISAMBIGUATION; PARALLELIZING COMPILERS; RUN TIME DISAMBIGUATION;

COMPUTER OPERATING SYSTEMS;

EID: 0024664199     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.24269     Document Type: Article

References (19)

1. A. V. Aho, R. Sethi, and J. D. Ullman, Compilers: Principles, Techniques, and Tools. Reading, MA: Addison-Wesley, 1986.
2. R. Allen and K. Kennedy, “PFC: A program to convert Fortran to parallel form,” Tech. Rep. MASC-TR 82-6, Dep. Math. Sci., Rice Univ., Mar. 1982.
3. Arvind and V. Kathail, “A multiple processor dataflow machine that supports generalized procedures,” in Proc. 8th Annu. Symp. Corn-put. Architecture, ACM, SIGARCH, vol. 9, pp. 291-302, May 1981.
4. U. Banerjee, “Speedup of ordinary programs,” Tech. Rep. UIUCDS-R-79-989, Dep. Comput. Sci., Univ. Illinois, Oct. 1979.
5. J. B. Dennis, First Version of a dataflow Procedure Language, Lecture-Notes in Computer Science, vol. 19. New York: Springer-Verlag, 1974, pp. 362-376.
6. J. R. Ellis, “Bulldog: A compiler for VLIW architectures,” Ph.D. dissertation, Dep. Comput. Sci., Yale University.
7. J. A. Fisher, J. R. Ellis, J. C. Ruttenberg, and A. Nicolau, “Parallel processing: A smart compiler and a dumb machine,” in Proc. ACM Symp. Compiler Construction, Montreal, P.Q., Canada, June 1984.
8. J. A. Fisher, “Trace scheduling: A technique for global microcode compaction,” IEEE Trans. Comput., pp. 478-490, July 1981.
9. W. Harrison, “Compiler analysis of the value range for variables,” IEEE Trans. Software Eng., vol. 3, 1977.
10. R. W. Heuft and W. D. Little, “Improved time and parallel processor bounds for Fortran-like loops,” IEEE Trans. Comput., vol. C-31, no. 1, 1982.
11. D. J. Kuck, Y. Muraoka, and S. C. Chen, “On the number ofoperations simultaneously executable in Fortran-like programs andtheir resulting speedup,” IEEE Trans. Comput., no. 12, pp. 1293-1310 1972.
12. D. J. Kuck, “Parallel processing of ordinary programs,” AdvancesComput., vol. 15, pp. 119-179, 1976.
13. D. Kuck, R. Khun, D. Padua, B. Leasure, and M. Wolfe, “Dependence graphs and compiler optimization,” in Proc. POPL 81, ACM, pp. 207-218, 1981.
14. A. Nicolau, “Parallelism, memory antialiasing and correctness fortrace scheduling compilers,” Ph.D. dissertation, Yale Univ., June 1984.
15. A. Nicolau, “Uniform parallelism exploitation in ordinary programs,” in Proc. 1985 Int. Conf. Parallel Processing, IEEE, ACM, St.Charles, IL. Aug. 1985.
16. A. Nicolau and J. Fisher, “Measuring the parallelism available forvery long instruction word architectures,” IEEE Trans. Comput., Nov. 1984.
17. G. S. Tadjen and M. J. Flynn, “Detection and parallel execution ofindependent instructions,” IEEE Trans. Comput., vol. 19, pp. 889-899, Oct. 1970.
18. R. M. Tomasulo, “An efficient algorithm for exploiting multiplearithmetic units,” IBM J. Res. Develop., vol. 11, pp. 25-33, Jan. 1967.
19. M. Wolfe, “Optimizing supercompilers for supercomputers,” Ph.D.dissertation, Univ. of Illinois, Urbana-Champaign, Oct. 1982.