• DocumentCode
    2297068
  • Title

    Branch assertion and elimination

  • Author

    Ganjoo, Afshin

  • Author_Institution
    Center for Adv. Comput. Studies, Univ. of Southwestern Louisiana, Lafayette, LA, USA
  • fYear
    1998
  • fDate
    5-7 Oct 1998
  • Firstpage
    208
  • Lastpage
    210
  • Abstract
    Branch instructions are major obstacles in realizing full instruction level parallelism. Prediction strategies have been employed to ease the burden brought about by these instructions. Even though high prediction accuracy is being achieved, there is much room for improvement. A new approach to branch handling, called branch assertion, is described. This approach will make prediction for some branches unnecessary. A technique to eliminate conditional and unconditional branches from the pipeline, called branch elimination, is also specified. The combination accomplishes zero-cycle branching
  • Keywords
    parallel architectures; branch assertion; branch elimination; branch handling; instruction level parallelism; zero-cycle branching; Accuracy; Pipelines;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Design: VLSI in Computers and Processors, 1998. ICCD '98. Proceedings. International Conference on
  • Conference_Location
    Austin, TX
  • ISSN
    1063-6404
  • Print_ISBN
    0-8186-9099-2
  • Type

    conf

  • DOI
    10.1109/ICCD.1998.727049
  • Filename
    727049