• DocumentCode
    1515163
  • Title

    Eliminating interlocks in deeply pipelined processors by delay enforced multistreaming

  • Author

    McCrackin, Daniel C.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., McMaster Univ., Hamilton, Ont., Canada
  • Volume
    40
  • Issue
    10
  • fYear
    1991
  • fDate
    10/1/1991 12:00:00 AM
  • Firstpage
    1125
  • Lastpage
    1132
  • Abstract
    The delay enforced multistreaming (DEMUS) processor architecture provides a simple, inexpensive ways of achieving high hardware utilization in deeply pipelined processors. Multiple streams share the pipeline in an interleaved fashion. Both the data dependency problem and the jump problem are prevented by enforcing enough interdispatch delay on each individual stream to prevent successive instructions from interfering with each other´s execution. The structure and operation of a small DEMUS processor are presented, and four stream dispatching algorithms are compared by means of a simple simulation. Of the three implementable algorithms, the modified fixed delay (DEMUS/MFD) and encoded delay with fixed minimum (DEMUS/EDF) mechanisms yield the highest performance
  • Keywords
    pipeline processing; data dependency problem; deeply pipelined processors; delay enforced multistreaming; encoded delay with fixed minimum; interdispatch delay; interleaving; interlocks; jump problem; modified fixed delay; processor architecture; stream dispatching algorithms; Clocks; Computational modeling; Computer simulation; Counting circuits; Delay; Dispatching; Hardware; Pipeline processing; Registers; Throughput;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.93745
  • Filename
    93745