
- 1 C. M. Chen et. al., "Branch Merging for Effective Exploitation of Instruction-Level Parallelism," Technical Report, National Tsing Hua University, Taiwan, 1992.Google Scholar
- 2 K. Ebccioglu and T. Nakatani, "A New Compilation Technique for Parallelizing Loops with Unpredictable Branches 'on a VLIW Architecture," Languages and Compilers }or Parallel Computing, D. Gelernter et. al. Eds., 1990, pp. 213-229. Google Scholar
Digital Library
- 3 J. A. Fisher, "2N-way Jump Microinstruction Hardware and an Effective Instruction Binding Method," Proc. i3th microprogramming workshop, 1980, pp. 64-75. Google Scholar
Digital Library
- 4 J. A. Fisher, "Trace Scheduling: A Technique for Global Microcode Compaction," IEEE Trans. on Comput., vol. C-30, July 1981, pp. 478-490.Google Scholar
- 5 W. M. W. Hwu, T. M. Conte and P. P. Chang, "Comparing Software and Hardware Schemes For Reducing the Cost of Branches," Proc. 16th Syrup. on Comput. Arch., 1989, pp. 224-231. Google Scholar
Digital Library
- 6 S. McFarling and J. L. Hennessy, "Reducing the Cost of Branches", Proc. 13th Symp. on Comput. Arch., 1986, pp. 396-403. Google Scholar
Digital Library
Index Terms
Branch merging for effective exploitation of instruction-level parallelism
Recommendations
Converting thread-level parallelism to instruction-level parallelism via simultaneous multithreading
To achieve high performance, contemporary computer systems rely on two forms of parallelism: instruction-level parallelism (ILP) and thread-level parallelism (TLP). Wide-issue super-scalar processors exploit ILP by executing multiple instructions from a ...






Comments