title: Understanding the speedup equation with Pipelining
body: <p>I'm having a lot of trouble understanding calculating the speedup of Pipelining. This is the slide that was provided for this in my Computer Organization class.</p>
  
  <p><a href="https://i.stack.imgur.com/MZ0xb.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/MZ0xb.png" alt="Slide with information"></a></p>
  
  <p>I don't really understand the formula.</p>
  
  <p>Why is it 2n?
  Why is it 0.5n + 1.5?</p>
  
  <p>My professor started to explain the 1.5 comes from 1.5 hours between when A starts and B starts...and thats easy to see with a picture like that but a problem like...</p>
  
  <blockquote>
    <p>Suppose you have a pipelined machine with a 10 stage pipeline and a
    program with 1000 instructions whose dependencies are such that the
    pipeline does not stall. If each stage of the pipe takes 1 cycle, what
    is the speedup gained by pipelining compared to execution of the
    program on the same machine without exploiting the pipeline?</p>
  </blockquote>
  
  <p>I don't think I could just draw a picture...plus I know there has to be some better way than drawing a picture. </p>
  
  <p>Can anyone explain speedup with pipeling and/or provide some good material online to understand this?</p>