Limits on multiple instruction issue
暂无分享,去创建一个
[1] Robert M. Keller,et al. Look-Ahead Processors , 1975, CSUR.
[2] S. McFarling,et al. Reducing the cost of branches , 1986, ISCA '86.
[3] Edward M. Riseman,et al. The Inhibition of Potential Parallelism by Conditional Jumps , 1972, IEEE Transactions on Computers.
[4] Michael J. Flynn,et al. Detection and Parallel Execution of Independent Instructions , 1970, IEEE Transactions on Computers.
[5] Edward M. Riseman,et al. Percolation of Code to Enhance Parallel Dispatching and Execution , 1972, IEEE Transactions on Computers.
[6] Alan Jay Smith,et al. Branch Prediction Strategies and Branch Target Buffer Design , 1995, Computer.
[7] R. M. Tomasulo,et al. An efficient algorithm for exploiting multiple arithmetic units , 1995 .
[8] James E. Smith,et al. The ZS-1 central processor , 1987, ASPLOS 1987.
[9] Wm. A. Wulf. The WM computer architecture , 1988, CARN.
[10] Hwa C. Torng,et al. An Instruction Issuing Approach to Enhancing Performance in Multiple Functional Unit Processors , 1986, IEEE Transactions on Computers.
[11] Alfred V. Aho,et al. Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.
[12] Yoichi Muraoka,et al. On the Number of Operations Simultaneously Executable in Fortran-Like Programs and Their Resulting Speedup , 1972, IEEE Transactions on Computers.
[13] Alexandru Nicolau,et al. Measuring the Parallelism Available for Very Long Instruction Word Architectures , 1984, IEEE Transactions on Computers.
[14] James E. Smith,et al. Instruction Issue Logic in Pipelined Supercomputers , 1984, IEEE Trans. Computers.