Comparing software and hardware schemes for reducing the cost of branches
暂无分享,去创建一个
[1] R. M. Tomasulo,et al. An efficient algorithm for exploiting multiple arithmetic units , 1995 .
[2] David R. Ditzel,et al. Branch folding in the CRISP microprocessor: reducing branch delay to zero , 1987, ISCA '87.
[3] D. J. Lalja. Reducing the branch penalty in pipelined processors , 1988, Computer.
[4] Wen-mei W. Hwu,et al. Trace Selection For Compiling Large C Application Programs To Microcode , 1988, [1988] Proceedings of the 21st Annual Workshop on Microprogramming and Microarchitecture - MICRO '21.
[5] Wen-mei W. Hwu,et al. Trace selection for compiling large C application programs to microcode , 1988, MICRO 1988.
[6] Henry M. Levy,et al. An evaluation of branch architectures , 1987, ISCA '87.
[7] J LiljaDavid. Reducing the Branch Penalty in Pipelined Processors , 1988 .
[8] Alan Jay Smith,et al. Branch Prediction Strategies and Branch Target Buffer Design , 1995, Computer.
[9] Joseph A. Fisher,et al. Trace Scheduling: A Technique for Global Microcode Compaction , 1981, IEEE Transactions on Computers.
[10] Robert B. Murray,et al. Compiling for the CRISP Microprocessor , 1987, COMPCON.
[11] J. E. Thornton,et al. Parallel operation in the control data 6600 , 1964, AFIPS '64 (Fall, part II).