Pipelining_Computer Organization_TU(BIM)
Download as PPSX, PDF0 likes553 views
Pipelining is a technique used in microprocessors where the execution of an instruction is broken down into stages that can be executed concurrently for different instructions. This allows a new instruction to begin executing before the previous one has finished. The document provides an example of a four-stage integer arithmetic pipeline and calculates the speedup from pipelining over a non-pipelined approach for 100 tasks. It is explained that pipelining can reduce the execution time from 8,000 ns to 2,060 ns, providing a speedup of 3.88x.
Pipelining_Computer Organization_TU(BIM)
- 1. 8/16/2013 1
- 2. A technique used in advanced microprocessors where it begins executing a second instruction before the first has been completed. Decomposing the sequential process into suboperation. 8/16/2013 2
- 3. 8/16/2013 3
- 4. The pipeline is divided into segments and each segment can execute it operation concurrently with the other segments. 8/16/2013 4
- 5. 8/16/2013 5
- 6. 8/16/2013 6
- 7. R1 Ai , R2 Bi Input Ai and Bi R3 R1 * R2, R4 Ci Multiply and input Ci R5 R3 + R4 Add Ci to product 8/16/2013 7
- 8. 8/16/2013 8
- 9. Let, 100 task to be completed, K be no. of pipeline stage =4 Tp be one clock cycle time = 20 Tn= time required by single task =Tp * K 8/16/2013 9
- 10. Case: Non-pipelined machine T=n*Tn =100*80 =8000 ns Case: Pipelined machine T=(K+n-1) * Tp =103*20 =2060 ns 8/16/2013 10
- 11. Speed Up ratio: n*Tn (K+n-1) * Tp 8000 2060 Ans: 3.88 8/16/2013 11
- 12. 1) 2) 3) 4) 5) 6) Hardware or software implementation – pipelining can be implemented in either software or hardware. Large or Small Scale – Stations in a pipeline can range from simplistic to powerful, and a pipeline can range in length from short to long. Synchronous or asynchronous flow – A synchronous pipeline operates like an assembly line: at a given time, each station is processing some amount of information. A asynchronous pipeline, allow a station to forward information at any time. Buffered or unbuffered flow – One stage of pipeline sends data directly to another one or a buffer is place between each pairs of stages. Finite Chunks or Continuous Bit Streams – The digital information that passes though a pipeline can consist of a sequence or small data items or an arbitrarily long bit stream. Automatic Data Feed Or Manual Data Feed – Some implementations of pipelines use a separate mechanism to move information, and other implementations require each stage to participate in moving information. 8/16/2013 12
- 13. Usually found in very high speed computers To implement floating-point operations, multiplications of fixed point numbers 8/16/2013 13
- 14. Steps Of Arithmetic Pipelining Compare the exponents Align the mantissa 0.08200 Choose mantissa Now y=0.08200*103 Add Mantissa= 0.9504 + 0.08200 =1.0324*103 8/16/2013 14
- 15. 8/16/2013 15
- 16. Fetch the instruction from memory. Decode the instruction. Calculate the effective address. Fetch the operands from memory. Execute the instruction. Store the result in the proper place. 8/16/2013 16
- 17. 8/16/2013 17
- 18. FI is the segment that fetches an instruction. DA is the segment that decodes the instruction and calculate the effective address. FO is the segment that fetches the operand. EX is the segment that executes the instruction. 8/16/2013 18
- 19. 8/16/2013 19
- 20. 8/16/2013 20
- 21. 8/16/2013 21
- 22. 8/16/2013 22
- 23. 8/16/2013 23