chapter3-m2-ziavras

Enables handling some cases when dependences are

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: he dependence is cleared Dynamic scheduling: HW rearranges instr. execution to reduce stalls while maintaining data flow & exception behavior exception behavior S. Ziavras Dynamic Scheduling Advantages 1. Enables handling some cases when dependences are unknown at compile time (e.g., because they may involve memory reference) involve a memory reference) – Compiler is simplified 2. Allows code that was compiled with one pipeline in mind to run efficiently on a different pipeline Later, we will explore hardware speculation we will explore hardware speculation – Dynamic-scheduling technique with good performance & significant cost increase in hardware complexity S. Ziavras Dynamic Scheduling: The Idea • Simple pipelining techniques use in-order instruction issue & execution – Instructions are issued in program order are issued in program order – If an instruction is stalled in the pipeline, no later instructions can proceed – Example: DIV.D F0, F2, F4 ADD.D F10, F0, F8 SUB.D F12, F8, F14 • • SUB.D cannot execute because the DIV.D to cannot execute because the DIV to ADD.D d...
View Full Document

This document was uploaded on 02/09/2014.

Ask a homework question - tutors are online