Problem occurs during pipelining , Basic Computer Science

Assignment Help:
While pipelining can cruelly cut the time taken to execute a program, there are troubles that cause it to not work as well as it possibly shall. The three stages of the instruction execution process do not essentially take an equal amount of time, with the time taken for ''execute'' being usually longer than ''fetch''. This makes it much harder to synchronize a variety of stages of the different instructions. Also, some instructions may be dependent on the results of other previous instructions. This can arise when data produced previous needs to be used, or when a conditional branch based on a previous result is used.
One of the easiest ways in which the effects of these troubles can be reduced is by breaking the instruction execution cycle into stages that are more possible to be of an equal duration.
Although, while this may resolve some of the troubles outlined above, it is not without creating further tribulations of its own. Initially, it is not always the case than an instruction will use all six of these stages. Easy load instructions, for example, will not require the use of the final ''write operand'' stage, which would perhaps upset the synchronization. There is also the matter of potential variances within the memory system, as three of the above stages (fetch instruction, fetch operands, write operand) need access to the memory. Many memory management systems would not permit three separate instructions to be accessing the memory immediately, and hence the pipelining would not be as useful as it would first seem.
On top of this, the difficulty of conditional branching and consequence dependant instructions also occurs. This means that the processor requires to be designed well so as to cope with these potential interruptions to the flow of data. As you can tell, there are many subjects which need to be taken into consideration involving to the technique of pipelining. While it is a powerful method for the purpose of increasing CPU performance, it does need careful design and consideration so as to achieve the best possible results.

Related Discussions:- Problem occurs during pipelining

Explain briefly about gnome desktop, Question 1 Brief about the shells of ...

Question 1 Brief about the shells of Linux operating system Question 2 Explain briefly about GNOME desktop Question 3 Write note on the following Encryption Sig

Subroutine and functions, Subroutine and Functions:  In a program, it ...

Subroutine and Functions:  In a program, it is often necessary to repeat a statement or group of statements at several points to accomplish a particular task. Repeating the sa

Cryptography, Question 1 Consider the one-time pad encryption scheme to en...

Question 1 Consider the one-time pad encryption scheme to encrypt a 1-bit message m, and assume m is chosen with uniform distribution from message space M={0,1}. Let E1 be the eve

What is Decode or execution cycle?, just the once the instruction has bee...

just the once the instruction has been fetched and is accumulated, the next step is to decode the instruction so as to work out what actions should be performed to execute it. This

Instructions for cycles: loop, They transfer the process flow, provisionall...

They transfer the process flow, provisionally or totally, to a destiny, replicating this action until the counter is zero. LOOP LOOPE LOOPNE LOOP INSTRUCTION reason: To produce a c

Types of software interface, different types of software interfaces which f...

different types of software interfaces which falls in different categories

Arrays, Write an application that stores at least five different department...

Write an application that stores at least five different department and supervisor names in a two-dimensional array. Allow the user to enter a department name (such as “Marketing”)

Random access memory (ram), RANDOM ACCESS MEMORY (RAM): The RAM-type me...

RANDOM ACCESS MEMORY (RAM): The RAM-type memory will allow data to be written into it, as well as read from it. With very few exceptions, RAMS lose their contents when the powe

Deadlocks, What is methods For handling Deadlocks?

What is methods For handling Deadlocks?

Scheme, There is a path between two vertices if there is a series of edges ...

There is a path between two vertices if there is a series of edges that you can use to travel between them. For example, between vertices 1 and 3 above, there is a path made up of

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