PipelineSch_-Gabliondo - Create a Formal Problem from a...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

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

Unformatted text preview: Create a Formal Problem from a Real-world Problem Investigate Complexity of Defined Problem Redefine the Problem NP-Completeness for Revised Problem References COT 6410: Pipeline Scheduling Michael Gabilondo Michael Gabilondo COT 6410: Pipeline Scheduling Create a Formal Problem from a Real-world Problem Investigate Complexity of Defined Problem Redefine the Problem NP-Completeness for Revised Problem References Overview 1 Create a Formal Problem from a Real-world Problem 2 Investigate Complexity of Defined Problem 3 Redefine the Problem 4 NP-Completeness for Revised Problem 5 References Michael Gabilondo COT 6410: Pipeline Scheduling Create a Formal Problem from a Real-world Problem Investigate Complexity of Defined Problem Redefine the Problem NP-Completeness for Revised Problem References Real-World Problem I chose a real-world problem: Instruction Scheduling on a Pipeline with precedence constraints between pipeline stages of jobs . or, P ipeline-S cheduling for short. Michael Gabilondo COT 6410: Pipeline Scheduling Create a Formal Problem from a Real-world Problem Investigate Complexity of Defined Problem Redefine the Problem NP-Completeness for Revised Problem References Real-World Problem I chose a real-world problem: Instruction Scheduling on a Pipeline with precedence constraints between pipeline stages of jobs . or, P ipeline-S cheduling for short. Its this problem, from your Computer Architecture course: Michael Gabilondo COT 6410: Pipeline Scheduling Create a Formal Problem from a Real-world Problem Investigate Complexity of Defined Problem Redefine the Problem NP-Completeness for Revised Problem References Real-World Problem A dynamic-scheduling pipelined processor with m stages tries to execute every instruction in a program without issuing a no-op instruction due to data dependencies between two instructions. Michael Gabilondo COT 6410: Pipeline Scheduling Create a Formal Problem from a Real-world Problem Investigate Complexity of Defined Problem Redefine the Problem NP-Completeness for Revised Problem References Real-World Problem A dynamic-scheduling pipelined processor with m stages tries to execute every instruction in a program without issuing a no-op 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 Real-world Problem Investigate Complexity of Defined Problem Redefine the Problem NP-Completeness 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

Page1 / 70

PipelineSch_-Gabliondo - Create a Formal Problem from a...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online