Presentation is loading. Please wait.

Presentation is loading. Please wait.

FPU structure.

Published byΕυτροπια Δάμαλις Δυοβουνιώτης Modified over 5 years ago

Similar presentations

Presentation on theme: "FPU structure."— Presentation transcript:

1 FPU structure

2 Example Instruction sequence W: F4 <- F0 + F6 X: F2 <- F0 * F4
Assumptions (to shorten execution trace) 2 instructions dispatched in order per cycle execution begins in same cycle as dispatch result broadcast on CDB in last cycle of execution Instruction sequence W: F4 <- F0 + F6 X: F2 <- F0 * F4 Y: F4 <- F4 + F6 Z: F6 <- F4 * F2 Initial register contents FLR tag data F0 6 F2 2 F4 10 F6 8

3 Cycle 1 W: F4 <- F0 + F6 X: F2 <- F0 * F4 Y: F4 <- F4 + F6
FADD FMUL/DIV FLR tag data 1 4 6 2 5 3 10 Ex unit 8 FADD FMUL/DIV FLR tag data 1 6 8 4 2 5 3 10 Ex unit W FADD FMUL/DIV FLR tag data 1 6 8 4 2 5 3 10 Ex unit W W: F4 <- F0 + F6 X: F2 <- F0 * F4 Y: F4 <- F4 + F6 Z: F6 <- F4 * F2

4 Cycle 2 W: F4 <- F0 + F6 X: F2 <- F0 * F4 Y: F4 <- F4 + F6
FADD FMUL/DIV FLR tag data 1 6 8 4 2 5 3 10 Ex unit W FADD FMUL/DIV FLR tag data 1 6 8 4 2 5 3 10 Ex unit W FADD FMUL/DIV FLR tag data 1 6 8 4 2 5 3 10 Ex unit W W: F4 <- F0 + F6 X: F2 <- F0 * F4 Y: F4 <- F4 + F6 Z: F6 <- F4 * F2

5 Cycle 3 W: F4 <- F0 + F6 X: F2 <- F0 * F4 Y: F4 <- F4 + F6
FADD FMUL/DIV FLR tag data 1 4 6 14 2 8 5 3 10 Ex unit Y X W: F4 <- F0 + F6 X: F2 <- F0 * F4 Y: F4 <- F4 + F6 Z: F6 <- F4 * F2

6 Cycle 4 W: F4 <- F0 + F6 X: F2 <- F0 * F4 Y: F4 <- F4 + F6
FADD FMUL/DIV FLR tag data 1 4 6 14 2 8 5 3 10 Ex unit Y X W: F4 <- F0 + F6 X: F2 <- F0 * F4 Y: F4 <- F4 + F6 Z: F6 <- F4 * F2

7 Cycle 5 W: F4 <- F0 + F6 X: F2 <- F0 * F4 Y: F4 <- F4 + F6
FADD FMUL/DIV FLR tag data 1 4 6 14 2 5 22 3 Ex unit X 8 W: F4 <- F0 + F6 X: F2 <- F0 * F4 Y: F4 <- F4 + F6 Z: F6 <- F4 * F2

8 Cycle 6 W: F4 <- F0 + F6 X: F2 <- F0 * F4 Y: F4 <- F4 + F6
FADD FMUL/DIV FLR tag data 1 4 6 2 5 22 84 3 Ex unit Z 8 W: F4 <- F0 + F6 X: F2 <- F0 * F4 Y: F4 <- F4 + F6 Z: F6 <- F4 * F2

9 Cycle 7 W: F4 <- F0 + F6 X: F2 <- F0 * F4 Y: F4 <- F4 + F6
FADD FMUL/DIV FLR tag data 1 4 6 2 5 22 84 3 Ex unit Z 8 W: F4 <- F0 + F6 X: F2 <- F0 * F4 Y: F4 <- F4 + F6 Z: F6 <- F4 * F2

10 Cycle 8 W: F4 <- F0 + F6 X: F2 <- F0 * F4 Y: F4 <- F4 + F6
FADD FMUL/DIV FLR tag data 1 4 6 2 5 22 84 3 Ex unit Z 8 W: F4 <- F0 + F6 X: F2 <- F0 * F4 Y: F4 <- F4 + F6 Z: F6 <- F4 * F2

11 Cycle 9 W: F4 <- F0 + F6 X: F2 <- F0 * F4 Y: F4 <- F4 + F6
FADD FMUL/DIV FLR tag data 1 4 6 2 5 84 3 22 Ex unit 1848 W: F4 <- F0 + F6 X: F2 <- F0 * F4 Y: F4 <- F4 + F6 Z: F6 <- F4 * F2

Download ppt "FPU structure."

Similar presentations

Fetch-Execute cycle. Memory Read operation Read from memory.

Fetch-Execute cycle. Memory Read operation Read from memory.
The Fetch – Execute Cycle

The Fetch – Execute Cycle
Machine cycle.

Machine cycle.
The Build-up of the Red Sequence at z

The Build-up of the Red Sequence at z
Assumptions One instruction can be fetched at each cycle. Latency is 2 cycles for ALU, and 3 for multiplier Instructions begin execution once fetched In.

Assumptions One instruction can be fetched at each cycle. Latency is 2 cycles for ALU, and 3 for multiplier Instructions begin execution once fetched In.
UQ: Explain in brief integer instruction pipeline stages of Pentium

UQ: Explain in brief integer instruction pipeline stages of Pentium
Central Processing Unit

Central Processing Unit
CS364 CH16 Control Unit Operation

CS364 CH16 Control Unit Operation
240-334 by Wannarat 240-334 Computer System Design Lecture 2 Instruction Set Architecture.

by Wannarat Computer System Design Lecture 2 Instruction Set Architecture.
RISC and Pipelining Prof. Sin-Min Lee Department of Computer Science.

RISC and Pipelining Prof. Sin-Min Lee Department of Computer Science.
Dyn. Sched. CSE 471 Autumn 0219 Tomasulo’s algorithm “Weaknesses” in scoreboard: –Centralized control –No forwarding (more RAW than needed) Tomasulo’s.

Dyn. Sched. CSE 471 Autumn 0219 Tomasulo’s algorithm “Weaknesses” in scoreboard: –Centralized control –No forwarding (more RAW than needed) Tomasulo’s.
FPU structure. Assumptions (to shorten execution trace) – 2 instructions dispatched in order per cycle – execution begins in same cycle as dispatch –

FPU structure. Assumptions (to shorten execution trace) – 2 instructions dispatched in order per cycle – execution begins in same cycle as dispatch –
2.3) Example of program execution 1. instruction  B25 8 Op-code B means to change the value of the program counter if the contents of the indicated register.

2.3) Example of program execution 1. instruction  B25 8 Op-code B means to change the value of the program counter if the contents of the indicated register.
6/9/2015TUC-N dr. Emil CEBUC Math Coprocessor Also called Floating Point Unit FPU.

6/9/2015TUC-N dr. Emil CEBUC Math Coprocessor Also called Floating Point Unit FPU.
7/14/2000 Page 1 Design of the IRAM FPU Ioannis Mavroidis IRAM retreat July 12-14, 2000.

7/14/2000 Page 1 Design of the IRAM FPU Ioannis Mavroidis IRAM retreat July 12-14, 2000.
1 Zvika Guz Slides modified from Prof. Dave Patterson, Prof. John Kubiatowicz, and Prof. Nancy Warter-Perez Out Of Order Execution.

1 Zvika Guz Slides modified from Prof. Dave Patterson, Prof. John Kubiatowicz, and Prof. Nancy Warter-Perez Out Of Order Execution.
1 Module 12 Computation and Configurations –Formal Definition –Important Terms –Examples.

1 Module 12 Computation and Configurations –Formal Definition –Important Terms –Examples.
CS 7960-4 Lecture 24 Exceeding the Dataflow Limit via Value Prediction M.H. Lipasti, J.P. Shen Proceedings of MICRO-29 December 1996.

CS Lecture 24 Exceeding the Dataflow Limit via Value Prediction M.H. Lipasti, J.P. Shen Proceedings of MICRO-29 December 1996.
CSCE 212 Quiz 9 – 3/30/11 1.What is the clock cycle time based on for single-cycle and for pipelining? 2.What two actions can be done to resolve data hazards?

CSCE 212 Quiz 9 – 3/30/11 1.What is the clock cycle time based on for single-cycle and for pipelining? 2.What two actions can be done to resolve data hazards?
CSCE 212 Quiz 9a – 4/1/11 For the following questions, assume the clock cycle times given above and the following set of instructions: lw $5, -16($5) sw.

CSCE 212 Quiz 9a – 4/1/11 For the following questions, assume the clock cycle times given above and the following set of instructions: lw $5, -16($5) sw.

Similar presentations

Ads by Google