Run-time disambiguation: coping with statically unpredictable dependencies
- 1 May 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 38 (5), 663-678
- https://doi.org/10.1109/12.24269
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Measuring the Parallelism Available for Very Long Instruction Word ArchitecturesIEEE Transactions on Computers, 1984
- Parallel processingPublished by Association for Computing Machinery (ACM) ,1984
- Improved Time and Parallel Processor Bounds for Fortran-Like LoopsIEEE Transactions on Computers, 1982
- Trace Scheduling: A Technique for Global Microcode CompactionIEEE Transactions on Computers, 1981
- Dependence graphs and compiler optimizationsPublished by Association for Computing Machinery (ACM) ,1981
- Compiler Analysis of the Value Ranges for VariablesIEEE Transactions on Software Engineering, 1977
- Parallel Processing of Ordinary ProgramsPublished by Elsevier ,1976
- On the Number of Operations Simultaneously Executable in Fortran-Like Programs and Their Resulting SpeedupIEEE Transactions on Computers, 1972
- Detection and Parallel Execution of Independent InstructionsIEEE Transactions on Computers, 1970
- An Efficient Algorithm for Exploiting Multiple Arithmetic UnitsIBM Journal of Research and Development, 1967