Efficient Exploitation of Instruction-Level Parallelism for Superscalar Processors by the Conjugate Register File Scheme
Issue No. 03 - March (1996 vol. 45)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.485567
<p><b>Abstract</b>—This paper introduces a novel superscalar micro-architecture, called <it>IAS-S</it>, and its related software techniques. We treat two basic problems in superscalar machines. First, we seek a feasible hardware platform which allows the compiler to perform more aggressive instruction scheduling. Second, we develop a good way of communication between the instruction scheduler and register allocator to avoid inadequate register allocation resulting in poor instruction schedules. For the first part, IAS-S employs the <it>Conjugate Register File</it> (CRF) scheme to support <it>multilevel instruction</it> boosting so that a greater amount of instruction-level parallelism in a program can be identified at compile time. For the second part, the instruction scheduling in the IAS-S compiler consists of two passes, prepass and postpass, and a <it>scheduling-conflict graph</it> is built for the register allocator during the prepass scheduling. In this manner, the register allocator can take the potential benefit for later postpass instruction scheduling into account and thus prevent inadequate register allocation.</p>
Instruction-level parallelism, speculative execution, superscalar processors, multilevel boosting, shadow register file, conjugate register file, scheduling-conflict graph.
M. Chang and F. Lai, "Efficient Exploitation of Instruction-Level Parallelism for Superscalar Processors by the Conjugate Register File Scheme," in IEEE Transactions on Computers, vol. 45, no. , pp. 278-293, 1996.