BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CSL-TR-81-224
       ENTRY:: December 01, 1994
ORGANIZATION:: Stanford University, Computer Systems Laboratory
       TITLE:: CODE GENERATION AND REORGANIZATION IN THE PRESENCE OF
               PIPELINE CONSTRAINTS
        TYPE:: Technical Report
      AUTHOR:: Hennessy, John L.
      AUTHOR:: Gross, Thomas
        DATE:: November 1981
       PAGES:: 17
    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.
       NOTES:: [Adminitrivia V1/Prg/19941201]
         END:: STAN//CSL-TR-81-224