Code generation and reorganization in the presence of pipeline constraints

  • Authors:
  • John L. Hennessy;Thomas R. Gross

  • Affiliations:
  • Stanford University;Stanford University

  • Venue:
  • POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
  • Year:
  • 1982

Quantified Score

Hi-index 0.00

Visualization

Abstract

Pipeline interlocks are used in a pipelined architecture to prevent the execution of a machine instruction before its operands are available. An alternative to this complex piece of hardware is to rearrange the instructions at compile-time to avoid pipeline interlocks. This problem, called code reorganization, is studied. The basic problem of reorganization of machine level instructions at compile-time is shown to be NP-complete. A heuristic algorithm is proposed and its properties and effectiveness are explored. The impact of code reorganization techniques on the rest of a compiler system are discussed.