This preview shows pages 1–8. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Create a Formal Problem from a Realworld Problem Investigate Complexity of Defined Problem Redefine the Problem NPCompleteness for Revised Problem References COT 6410: Pipeline Scheduling Michael Gabilondo Michael Gabilondo COT 6410: Pipeline Scheduling Create a Formal Problem from a Realworld Problem Investigate Complexity of Defined Problem Redefine the Problem NPCompleteness for Revised Problem References Overview 1 Create a Formal Problem from a Realworld Problem 2 Investigate Complexity of Defined Problem 3 Redefine the Problem 4 NPCompleteness for Revised Problem 5 References Michael Gabilondo COT 6410: Pipeline Scheduling Create a Formal Problem from a Realworld Problem Investigate Complexity of Defined Problem Redefine the Problem NPCompleteness for Revised Problem References RealWorld Problem I chose a realworld problem: Instruction Scheduling on a Pipeline with precedence constraints between pipeline stages of jobs . or, P ipelineS cheduling for short. Michael Gabilondo COT 6410: Pipeline Scheduling Create a Formal Problem from a Realworld Problem Investigate Complexity of Defined Problem Redefine the Problem NPCompleteness for Revised Problem References RealWorld Problem I chose a realworld problem: Instruction Scheduling on a Pipeline with precedence constraints between pipeline stages of jobs . or, P ipelineS cheduling for short. Its this problem, from your Computer Architecture course: Michael Gabilondo COT 6410: Pipeline Scheduling Create a Formal Problem from a Realworld Problem Investigate Complexity of Defined Problem Redefine the Problem NPCompleteness for Revised Problem References RealWorld Problem A dynamicscheduling pipelined processor with m stages tries to execute every instruction in a program without issuing a noop instruction due to data dependencies between two instructions. Michael Gabilondo COT 6410: Pipeline Scheduling Create a Formal Problem from a Realworld Problem Investigate Complexity of Defined Problem Redefine the Problem NPCompleteness for Revised Problem References RealWorld Problem A dynamicscheduling pipelined processor with m stages tries to execute every instruction in a program without issuing a noop instruction due to data dependencies between two instructions. The IBM System / 360, which implemented Tomasulos algorithm, is a notable example of a dynamic scheduling processor [Hennessy, Computer Architecture]. Michael Gabilondo COT 6410: Pipeline Scheduling Create a Formal Problem from a Realworld Problem Investigate Complexity of Defined Problem Redefine the Problem NPCompleteness for Revised Problem References A di ff erent view of the pipeline chart Here, the P1 P2 P3 P4 P5 are pipeline stages: IF ID EX MEM WB....
View
Full
Document
 Fall '10
 Dutton

Click to edit the document details