Percolation of Code to Enhance Parallel Dispatching and Execution
- 1 December 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-21 (12), 1411-1415
- https://doi.org/10.1109/t-c.1972.223515
Abstract
This note investigates the increase in parallel execution rate as a function of the size of an instruction dispatch stack with lookahead hardware. Under the constraint that instructions are not dispatched until all preceding conditional branches are resolved, stack sizes as small as 2 or 4 achieve most of the parallelism that a hypothetically infinite stack would.Keywords
This publication has 6 references indexed in Scilit:
- Program Suitability for Parallel ProcessingIEEE Transactions on Computers, 1971
- Detection and Parallel Execution of Independent InstructionsIEEE Transactions on Computers, 1970
- A survey of techniques for recognizing parallel processable streams in computer programsPublished by Association for Computing Machinery (ACM) ,1969
- The ILLIAC IV ComputerIEEE Transactions on Computers, 1968
- Very high-speed computing systemsProceedings of the IEEE, 1966
- A multiprocessor system designPublished by Association for Computing Machinery (ACM) ,1963