Measuring the Parallelism Available for Very Long Instruction Word Architectures
- 1 November 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-33 (11) , 968-976
- https://doi.org/10.1109/tc.1984.1676371
Abstract
Long instruction word architectures, such as attached scientific processors and horizontally microcoded CPU's, are a popular means of obtaining code speedup via fine-grained parallelism. The falling cost of hardware holds out the hope of using these architectures for much more parallelism. But this hope has been diminished by experiments measuring how much parallelism is available in the code to start with. These experiments implied that even if we had infinite hardware, long instruction word architectures could not provide a speedup of more than a factor of 2 or 3 on real programs.Keywords
This publication has 12 references indexed in Scilit:
- Branch Prediction Strategies and Branch Target Buffer DesignComputer, 1984
- A VLSI RISCComputer, 1982
- High-Speed Multiprocessors and Compilation TechniquesIEEE Transactions on Computers, 1980
- Time and Parallel Processor Bounds for Fortran-Like LoopsIEEE Transactions on Computers, 1979
- The parallel execution of DO loopsCommunications of the ACM, 1974
- Measurements of parallelism in ordinary FORTRAN programsComputer, 1974
- Percolation of Code to Enhance Parallel Dispatching and ExecutionIEEE Transactions on Computers, 1972
- The Inhibition of Potential Parallelism by Conditional JumpsIEEE Transactions on Computers, 1972
- 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