Presentation is loading. Please wait.

Presentation is loading. Please wait.

Elementary Microarchitecture Algebra

Published byPreston Boone Modified over 6 years ago

Similar presentations

Presentation on theme: "Elementary Microarchitecture Algebra"— Presentation transcript:

1 Elementary Microarchitecture Algebra
John Matthews and John Launchbury Oregon Graduate Institute

2 Hawk Goals Develop specifications that are clear and concise
Simulate the specifications, both concretely and symbolically Formally verify specifications at the source-code level

3 Algebraic Verification
Developed a domain-specific algebra for microarchitectures Proved equational laws that hold between microarchitecture components We simplify pipelines using these laws while preserving functional (cycle-accurate) behavior But clock cycle period may change!

4 Transactions Group data and control information together
Transactions - containing destinations, sources, and operations - flow through the model Decide control locally whenever possible R3 <- Add R1 R2 16 5 11

5 Example: The SuperSimple Pipeline
Reg ALU Reference machine: Each transaction is completed in one (long) clock cycle Results are written back to register file on the next clock cycle

6 Example: The SuperSimple Pipeline
Reg ALU Reference machine: R3 <- Add R1 R2 - - -

7 Example: The SuperSimple Pipeline
Reg ALU Reference machine: R3 <- Add R1 R2 R3 <- Add R1 R2 - - - - 5 11

8 Example: The SuperSimple Pipeline
Reg ALU Reference machine: R3 <- Add R1 R2 R3 <- Add R1 R2 R3 <- Add R1 R2 - - - - 5 11 16 5 11

9 Example: The SuperSimple Pipeline
Reg ALU Reference machine: R3 <- Add R1 R2 R3 <- Add R1 R2 R3 <- Add R1 R2 - - - - 5 11 16 5 11 R3 <- Add R1 R2 16 5 11

10 Example: The SuperSimple Pipeline
Reg ALU Reference machine: Reg ALU Pipelined machine:

11 Verifying SuperSimple
Pipelined machine should behave the same as reference machine, except the pipelined machine has one more cycle of latency Reg ALU Reg ALU

12 Verifying SuperSimple
We incrementally simplify the pipeline Use local algebraic laws, each proved by induction over time Reg ALU Reg ALU

13 Circuit Duplication Law
We can always duplicate a circuit without changing its functional behavior F F F

14 Retiming the Pipeline We first move delay circuits forward, using the circuit duplication law Reg ALU Reg ALU

15 Retiming the Pipeline We first move delay circuits forward, using the circuit duplication law Reg ALU Reg ALU

16 Retiming the Pipeline We first move delay circuits forward, using the circuit duplication law Reg ALU Reg ALU

17 Time-Invariance Laws Delay circuits can be moved across time-invariant circuits without changing behavior ALU ALU

18 Retiming the Pipeline Apply time-invariance laws to continue moving delay circuits Reg ALU Reg ALU

19 Retiming the Pipeline Apply time-invariance laws to continue moving delay circuits Reg ALU Reg ALU

20 Retiming the Pipeline Apply time-invariance laws to continue moving delay circuits Reg ALU Reg ALU

21 Removing Forwarding Logic
The register-bypass laws allow us to remove a bypass circuit on the output of a registerFile Reg Reg Reg Reg

22 Removing Forwarding Logic
Apply register-bypass law to remove bypass circuit Reg ALU Reg ALU

23 Removing Forwarding Logic
Apply register-bypass law to remove bypass circuit Reg ALU Reg ALU

24 Removing Forwarding Logic
Repositioning components Reg ALU Reg ALU

25 Removing Forwarding Logic
Repositioning components Reg ALU Reg ALU

26 Removing Forwarding Logic
Repositioning components Reg ALU Reg ALU

27 Removing Forwarding Logic
Repositioning components Reg ALU Reg ALU

28 Removing Forwarding Logic
Repositioning components Reg ALU Reg ALU

29 Removing Forwarding Logic
Repositioning components Reg ALU Reg ALU

30 Removing Forwarding Logic
Repositioning components Reg ALU Reg ALU

31 Simplification Complete!
Pipeline has been reduced to reference machine, but delayed by one clock cycle Reg ALU Reg ALU

32 Simplifying Stalling Pipelines
More complex pipelines often have to stall to resolve hazards or mis-speculation A stalling pipeline won’t be cycle-accurate with respect to a reference machine We still simplify as much as possible Then use other verification techniques on simplified pipeline Simplified pipeline should be easier to verify

33 The SomewhatSimple Pipeline
Resolves mem-alu data hazards by stalling Resolves branch mispredictions by squashing misp ? hazard? ICache Reg ALU Mem Kill

34 misp ? hazard? ICache Reg ALU Mem Kill Original Pipeline

35 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

36 Various Retiming Laws misp ? hazard? ICache Reg ALU Mem Kill
Simplifying pipeline .....

37 Various Retiming Laws misp ? hazard? ICache Reg ALU Mem Kill
Simplifying pipeline .....

38 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

39 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

40 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

41 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

42 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

43 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

44 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

45 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

46 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

47 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

48 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

49 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

50 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

51 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

52 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

53 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

54 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

55 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

56 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

57 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

58 Projection Laws Projections are circuits that reset selected transaction fields to default values Used to indicate that only a portion of a transaction is needed Also used to capture constraints holding on a wire Projections can express conditional laws ICache ICache br

59 More Projection Laws br misp ? misp ? hazard? hazard? ctrl ctrl

60 Various Projection Laws
misp ? hazard? ICache Reg ALU Mem Kill Various Projection Laws Simplifying pipeline .....

61 Various Projection Laws
br misp ? hazard? br ICache Reg ALU Mem Kill Various Projection Laws Simplifying pipeline .....

62 br misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

63 br misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

64 misp ? hazard? br ICache Reg ALU Mem Kill Simplifying pipeline .....

65 Conditional Laws Many components never modify branch info
Expressed with branch projections br br br br Mem Mem

66 misp ? hazard? br ICache Reg ALU Mem Kill Simplifying pipeline .....

67 misp ? hazard? br ICache Reg ALU Mem Kill Simplifying pipeline .....

68 misp ? hazard? br ICache Reg ALU Mem Kill Simplifying pipeline .....

69 br misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

70 br misp ? hazard? br ICache Reg ALU Mem Kill Simplifying pipeline .....

71 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

72 Hazard Projection Kill logic guarantees no data hazards on output wire
H is a sequential circuit projecting out all hazards hazard? hazard? H Kill Kill

73 Hazard-Bypass Law Conditional law that allows us to remove forwarding logic between pipeline stages …But only if no hazards occur on the input Applicable to any two “execution-unit like” stages Exec1 Exec2 H Exec1 Exec2 H

74 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

75 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

76 misp ? hazard? ICache Reg ALU Mem H Kill Simplifying pipeline .....

77 misp ? hazard? ICache Reg ALU Mem H Kill Simplifying pipeline .....

78 Hazard-bypass Law misp ? hazard? ICache Reg ALU Mem H Kill
Simplifying pipeline .....

79 Hazard-bypass Law misp ? hazard? ICache Reg ALU Mem H Kill
Simplifying pipeline .....

80 misp ? hazard? ICache Reg ALU Mem H Kill Simplifying pipeline .....

81 misp ? hazard? ICache Reg ALU Mem H Kill Simplifying pipeline .....

82 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

83 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

84 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

85 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

86 misp ? hazard? ctrl ctrl ICache Reg ALU Mem Kill Simplifying pipeline .....

87 misp ? hazard? ctrl ctrl ICache Reg ALU Mem Kill Simplifying pipeline .....

88 misp ? hazard? ctrl ctrl ICache Reg ALU Mem Kill Simplifying pipeline .....

89 misp ? hazard? ctrl ctrl ICache Reg ALU Mem Kill Simplifying pipeline .....

90 misp ? hazard? ctrl ctrl ICache Reg ALU Mem Kill Simplifying pipeline .....

91 misp ? hazard? ctrl ctrl ICache Reg ALU Mem Kill Simplifying pipeline .....

92 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

93 Register-bypass Law misp ? hazard? ICache Reg ALU Mem Kill
Simplifying pipeline .....

94 Register-bypass Law misp ? hazard? ICache Reg ALU Mem Kill
Simplifying pipeline .....

95 Register-bypass Law misp ? hazard? ICache Reg ALU Mem Kill
Simplifying pipeline .....

96 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

97 misp ? hazard? ICache Reg ALU Mem Kill Simplifying pipeline .....

98 misp ? hazard? ICache Reg ALU Mem Kill Final Pipeline

99 Finishing the Verification
Pipeline is as close to reference machine as possible without breaking cycle-accurate behavior Use other techniques to finish the verification Removal of forwarding and delay logic makes verification simpler

100 Related Work Recursive signal definitions (Johnson)
Transactions (Aagaard & Leeser) Retiming (Leiserson, Saxe et al) Ruby (Sheeran et al); Lustre (Halbwachs) Term-rewriting systems (Arvind et al) Much work on state-machine-based verification (Birch & Dill, McMillan, Hosabettu) Unpipelining (Levitt & Olukotun)

101 Future Work Perform complete verification algebraically
Create a “remove-NOP” component Discover appropriate simplification laws Extend verification to superscalar and out-of-order microarchitectures Add sequence numbers to transactions Create a “reorder-transactions” component

102 Conclusions Algebraic verification can be used to simplify microarchitectures prior to verification Can reason about microarchitectures at the source-code level Laws can be expressed visually Using laws doesn’t require theorem-prover expertise Proving laws does; perhaps use decision procedures Discovering laws can be challenging But laws tend to be reusable across similar pipelines

103 Further Reading Most of these laws and transformations are described in the following paper: Elementary Microarchitecture Algebra, by John Matthews and John Launchbury, in CAV ‘99. We have several other papers introducing Hawk and describing microarchitecture verification based on transactions. All of these papers can be found at:

Download ppt "Elementary Microarchitecture Algebra"

Similar presentations

ILP: IntroductionCSCE430/830 Instruction-level parallelism: Introduction CSCE430/830 Computer Architecture Lecturer: Prof. Hong Jiang Courtesy of Yifeng.

ILP: IntroductionCSCE430/830 Instruction-level parallelism: Introduction CSCE430/830 Computer Architecture Lecturer: Prof. Hong Jiang Courtesy of Yifeng.
1 ECE369 ECE369 Pipelining. 2 ECE369 addm (rs), rt # Memory[R[rs]] = R[rt] + Memory[R[rs]]; Assume that we can read and write the memory in the same cycle.

1 ECE369 ECE369 Pipelining. 2 ECE369 addm (rs), rt # Memory[R[rs]] = R[rt] + Memory[R[rs]]; Assume that we can read and write the memory in the same cycle.
Computer Structure 2014 – Out-Of-Order Execution 1 Computer Structure Out-Of-Order Execution Lihu Rappoport and Adi Yoaz.

Computer Structure 2014 – Out-Of-Order Execution 1 Computer Structure Out-Of-Order Execution Lihu Rappoport and Adi Yoaz.
Computer Architecture 2011 – Out-Of-Order Execution 1 Computer Architecture Out-Of-Order Execution Lihu Rappoport and Adi Yoaz.

Computer Architecture 2011 – Out-Of-Order Execution 1 Computer Architecture Out-Of-Order Execution Lihu Rappoport and Adi Yoaz.
A Proof of Correctness of a Processor Implementing Tomasulo’s Algorithm without a Reorder Buffer Ravi Hosabettu (Univ. of Utah) Ganesh Gopalakrishnan (Univ.

A Proof of Correctness of a Processor Implementing Tomasulo’s Algorithm without a Reorder Buffer Ravi Hosabettu (Univ. of Utah) Ganesh Gopalakrishnan (Univ.
ENEE350 Ankur Srivastava University of Maryland, College Park Based on Slides from Mary Jane Irwin ( www.cse.psu.edu/~mji )www.cse.psu.edu/~mji www.cse.psu.edu/~cg431.

ENEE350 Ankur Srivastava University of Maryland, College Park Based on Slides from Mary Jane Irwin ( )
1  2004 Morgan Kaufmann Publishers Chapter Six. 2  2004 Morgan Kaufmann Publishers Pipelining The laundry analogy.

1  2004 Morgan Kaufmann Publishers Chapter Six. 2  2004 Morgan Kaufmann Publishers Pipelining The laundry analogy.
Computer Architecture 2010 – Out-Of-Order Execution 1 Computer Architecture Out-Of-Order Execution Lihu Rappoport and Adi Yoaz.

Computer Architecture 2010 – Out-Of-Order Execution 1 Computer Architecture Out-Of-Order Execution Lihu Rappoport and Adi Yoaz.
1  1998 Morgan Kaufmann Publishers Chapter Six Enhancing Performance with Pipelining.

1  1998 Morgan Kaufmann Publishers Chapter Six Enhancing Performance with Pipelining.
CSE378 Pipelining1 Pipelining Basic concept of assembly line –Split a job A into n sequential subjobs (A 1,A 2,…,A n ) with each A i taking approximately.

CSE378 Pipelining1 Pipelining Basic concept of assembly line –Split a job A into n sequential subjobs (A 1,A 2,…,A n ) with each A i taking approximately.
1 Pipelining Reconsider the data path we just did Each instruction takes from 3 to 5 clock cycles However, there are parts of hardware that are idle many.

1 Pipelining Reconsider the data path we just did Each instruction takes from 3 to 5 clock cycles However, there are parts of hardware that are idle many.
Modern VLSI Design 4e: Chapter 8 Copyright  2008 Wayne Wolf Topics Basics of register-transfer design: –data paths and controllers; –ASM charts. Pipelining.

Modern VLSI Design 4e: Chapter 8 Copyright  2008 Wayne Wolf Topics Basics of register-transfer design: –data paths and controllers; –ASM charts. Pipelining.
CSE 340 Computer Architecture Summer 2014 Basic MIPS Pipelining Review.

CSE 340 Computer Architecture Summer 2014 Basic MIPS Pipelining Review.
CS.305 Computer Architecture Enhancing Performance with Pipelining Adapted from Computer Organization and Design, Patterson & Hennessy, © 2005, and from.

CS.305 Computer Architecture Enhancing Performance with Pipelining Adapted from Computer Organization and Design, Patterson & Hennessy, © 2005, and from.
1 COMP541 Pipelined MIPS Montek Singh Mar 30, 2010.

1 COMP541 Pipelined MIPS Montek Singh Mar 30, 2010.
Chap 6.1 Computer Architecture Chapter 6 Enhancing Performance with Pipelining.

Chap 6.1 Computer Architecture Chapter 6 Enhancing Performance with Pipelining.
CSIE30300 Computer Architecture Unit 04: Basic MIPS Pipelining Hsin-Chou Chi [Adapted from material by and

CSIE30300 Computer Architecture Unit 04: Basic MIPS Pipelining Hsin-Chou Chi [Adapted from material by and
1  1998 Morgan Kaufmann Publishers Chapter Six. 2  1998 Morgan Kaufmann Publishers Pipelining Improve perfomance by increasing instruction throughput.

1  1998 Morgan Kaufmann Publishers Chapter Six. 2  1998 Morgan Kaufmann Publishers Pipelining Improve perfomance by increasing instruction throughput.
FPGA-Based System Design: Chapter 6 Copyright  2004 Prentice Hall PTR Topics n Low power design. n Pipelining.

FPGA-Based System Design: Chapter 6 Copyright  2004 Prentice Hall PTR Topics n Low power design. n Pipelining.
Simple ALU How to perform this C language integer operation in the computer C=A+B; ? The arithmetic/logic unit (ALU) of a processor performs integer arithmetic.

Simple ALU How to perform this C language integer operation in the computer C=A+B; ? The arithmetic/logic unit (ALU) of a processor performs integer arithmetic.

Similar presentations

Ads by Google