Comparing software and hardware schemes for reducing the cost of branches

  • Authors:
  • W. W. Hwu;T. M. Conte;P. P. Chang

  • Affiliations:
  • Coordinated Science Laboratory, 1101 W. Sprintfield Ave., University of Illinois, Urbana, IL;Coordinated Science Laboratory, 1101 W. Sprintfield Ave., University of Illinois, Urbana, IL;Coordinated Science Laboratory, 1101 W. Sprintfield Ave., University of Illinois, Urbana, IL

  • Venue:
  • ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
  • Year:
  • 1989

Quantified Score

Hi-index 0.03

Visualization

Abstract

Pipelining has become a common technique to increase throughput of the instruction fetch, instruction decode, and instruction execution portions of modern computers. Branch instructions disrupt the flow of instructions through the pipeline, increasing the overall execution cost of branch instructions. Three schemes to reduce the cost of branches are presented in the context of a general pipeline model. Ten realistic Unix domain programs are used to directly compare the cost and performance of the three schemes and the results are in favor of the software-based scheme. For example, the software-based scheme has a cost of 1.65 cycles/branch vs. a cost of 1.68 cycles/branch of the best hardware scheme for a highly pipelined processor (11-stage pipeline). The results are 1.19 (software scheme) vs. 1.23 cycles/branch (best hardware scheme) for a moderately pipelined processor (5-stage pipeline).