Explain optimization process of pipelining, Computer Engineering

Assignment Help:

Q. Explain Optimization process of Pipelining ?

RISC machines can use a very efficient pipeline scheme due to the regular and simple instructions. Similarly all other instruction pipelines RISC pipeline suffer from problems of branching instructions anddata dependencies. RISC optimizes this problem by employing a technique known as delayed branching. 

One of the common schemes used to avoid branch penalty is to pre-fetch branch destination also. RISC follows a branch optimization scheme known as delayed jump as displayed in the illustration given below:

1184_Explain Optimization process of Pipelining.png

(a)   The instruction "If RD< 0 Return" may cause pipeline to empty

904_Explain Optimization process of Pipelining1.png

(b) The No operation instruction causes decision of the If instruction known, thus correct instruction can be fetched.


Related Discussions:- Explain optimization process of pipelining

Design a memory buffer of limited size, Extend task 1 so that it now suppor...

Extend task 1 so that it now supports a memory buffer of limited size. Provide the same functionality as task 1 except now make the server work with a limited buffer size. Like

Illustrate about the problem statement, Illustrate about the Problem statem...

Illustrate about the Problem statement Problem statement would not be incomplete, inconsistent and ambiguous. Try to state the requirements precisely and point to point. Do no

Explain FIFO page replacement algorithm, Explain FIFO Page replacement algo...

Explain FIFO Page replacement algorithm. FIFO policy: This policy only removes pages in the order they entered in the main memory. By using this policy we simply eliminate a

Executing a parallel algorithm, Q. Executing a parallel algorithm? Mult...

Q. Executing a parallel algorithm? Multiple processors need synchronization with one another when executing a parallel algorithm. So task which is running on processor X may ha

What is assembly condition codes, Condition codes are the list of possible ...

Condition codes are the list of possible conditions that can be tested through conditional instructions. Typical conditional instructions have: conditional branches, conditional ju

Explain the operation of 8:1 multiplexer, Explain the operation of 8:1 mult...

Explain the operation of 8:1 multiplexer. Ans: In this multiplexer 8 Input and 1 Output and three select lines i.e. S 2 , S 1 , S 0 are given. Any one of the inputs will be

Flynns categorization, Normal 0 false false false EN-US...

Normal 0 false false false EN-US X-NONE X-NONE

Basic operational concepts of a computer, Basic Operational Concepts of a C...

Basic Operational Concepts of a Computer: Most of computer operations are executed in the ALU (arithmetic and logic unit) of a processor. For an example: to add 2 numb

Why dynamic RAMs require refreshing, Explain briefly, why dynamic RAMs requ...

Explain briefly, why dynamic RAMs require refreshing? Ans: Due to the charge's natural tendency to distribute itself in a lower energy-state configuration that is, the charg

How to fix an asic-based design from easiest to most extreme, How to fix an...

How to fix an ASIC-based design from easiest to most extreme? There are different ways to fix an ASIC-based design as given below: Initially, assume some reviews fundamentally.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd