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

Explain about fundamental nature of a computer, Q. Explain about fundamenta...

Q. Explain about fundamental nature of a Computer? The fundamental nature of a Computer is as an information transformer. So a computer should be able to take input and process

What is non-volatile bios, Nonvolatile BIOS memory refers to a small memory...

Nonvolatile BIOS memory refers to a small memory on PC motherboards that is used to kept BIOS settings. It was traditionally known as CMOS RAM because it used a volatile, low-power

Write an interrupt routine to handle division by zero, Q. Write an interrup...

Q. Write an interrupt routine to handle 'division by zero'? This file can be loaded just like a COM file though makes itself permanently resident until the system is running.

Fingerprint- biometric computer security systems, Fingerprint- Biometric co...

Fingerprint- Biometric computer security systems First of all, fingerprint is the most commonly used biometric technology, because every person has unique fingerprints and the

Define optimistic synchronization, Q. Define Optimistic Synchronization? ...

Q. Define Optimistic Synchronization? Optimistic Synchronization: This method too updates atom by requester process however sole access is granted after atomic operation by abo

What do you mean by perfect shuffle permutation, Q. What do you mean by Per...

Q. What do you mean by Perfect Shuffle Permutation? Perfect Shuffle Permutation: It was proposed by Harold Stone (1971). Consider N objects each is represented by n bit number

What is multiplicity, What is multiplicity? Multiplicity is applied to ...

What is multiplicity? Multiplicity is applied to attributes for data base application. Multiplicity for an attribute specifies the number of possible value for every instantiat

Constraint satisfaction problems, Constraint Satisfaction Problems: Fu...

Constraint Satisfaction Problems: Furthermore I was perhaps most proud of AI on a Sunday. However this particular Sunday, a friend of mine found an article in the Observer reg

How a pointer variable declared in c, How a pointer variable declared in C ...

How a pointer variable declared in C ? Why is it sometimes desirable to pass a pointer to a function as an argument? A pointer is a variable which contains the address in memor

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