Q2 Sample - Trent University Computer Science 230H Fall...

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

View Full Document Right Arrow Icon
Trent University Computer Science 230H Fall 2007 Quiz #2 Sample Questions Topic: Pipelining 1) Consider a 5-stage pipeline with the following stages: FI (fetch instruction), DI (decode instruction), FO (fetch operand), EX (execute), WO (write operand). Assume we have a 12 instruction program and the 11th instruction is a conditional branch to the 3nd instruction. Assume each stage can be completed in one time cycle and that all instructions use all five stages. a) Draw the timing diagram if the branch is not taken and we assume that the stages can be done in parallel. What is the speedup over a system that does not employ pipelining? b) What is the speedup over a system that does not employ pipelining if we assume that the stages can be done in parallel our program has 50 instructions? 100 instructions? 1000 instructions? (Don’t try to draw the timing diagram for these!) c) Draw the timing diagram if the branch is not taken, we assume that the stages cannot be done in parallel if there is contention for memory (two or more stages
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/14/2010 for the course COMPUTER S COIS-3030 taught by Professor Hircock during the Spring '10 term at Trent University.

Ask a homework question - tutors are online