HPS, A New Microarchitecture: Rationale and Introduction Yale N. - - PowerPoint PPT Presentation

hps a new microarchitecture rationale and introduction
SMART_READER_LITE
LIVE PREVIEW

HPS, A New Microarchitecture: Rationale and Introduction Yale N. - - PowerPoint PPT Presentation

HPS, A New Microarchitecture: Rationale and Introduction Yale N. Patt, Wen-mei Hwo, and Michael Shebanow Big Picture Three levels of paralellism Big -- threads Medium -- the compiler Small -- hardware Their focus Myopic,


slide-1
SLIDE 1

HPS, A New Microarchitecture: Rationale and Introduction

Yale N. Patt, Wen-mei Hwo, and Michael Shebanow

slide-2
SLIDE 2

Big Picture

  • Three levels of paralellism
  • Big -- threads
  • Medium -- the compiler
  • Small -- hardware Their focus
slide-3
SLIDE 3

Myopic, fine-grain Dataflow

  • Restrict dataflow execution to an “active

window”

  • Feed it with a VN front end
  • No more resource explosion
  • Less parallelism
  • At the mercy of the branch predictor
  • Need a solution for memory ordering.
slide-4
SLIDE 4

Components

  • Merger -- integrate newly decoded

instructions into the dataflow graph

  • Register alias table -- map between logical

register names and result buffer entries

  • Node table -- Instruction scheduler. An

entry for each instruction with ready bits.

slide-5
SLIDE 5
slide-6
SLIDE 6
slide-7
SLIDE 7

Implementing HPS

  • Node tables and register alias table are

CAMs

  • Long wires!
  • Lots of area.
  • Not very scalable.
slide-8
SLIDE 8

Memory is hard

  • Problem: Address and/or data are not

known at merge time

  • Solution
  • Build a memory alias table.
  • Insert mappings as address/data become
  • known. Younger ops stall until then.