Optimization on instruction reorganization

  • Authors:
  • Feipei Lai;Hung-Chang Lee;Chun-Luh Lee

  • Affiliations:
  • Dept. of Electrical Engineering, & Dept. of Computer Science, National Taiwan University, Taipei, Taiwan, ROC;Dept. of Electrical Engineering, & Dept. of Computer Science, National Taiwan University, Taipei, Taiwan, ROC;-

  • Venue:
  • MICRO 23 Proceedings of the 23rd annual workshop and symposium on Microprogramming and microarchitecture
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

A pipelined processor increases its performance by partitioning an instruction into several separate operation steps. Several instructions can be executed in the pipeline in different pipe stages at the same time. Since the overlapped execution of instructions, the result of an instruction may be attempted to be used before it is available.One way to solve this problem is to schedule instructions at compiler time, thus the codes generated will be free from interlocks. The scheduling algorithm presented by [Hen 83, Gro 83] had significantly reduced the pipeline interlocks. With some modifications to distinguish the conflict condition, the algorithm will do better works at the same cost.