Bubbling the pipeline - computer architecture, Computer Engineering

Bubbling the Pipeline:

Bubbling the pipeline (also known as a pipeline break or pipeline stall) is a technique for preventing, structural, data and branch hazards from taking place. As instructions are fetched, control logic determines whether a hazard could/will take place. If they can, then the control logic inserts NOPs instruction into the pipeline. Therefore, before the next instruction (which is reason of the hazard) is executed, the previous 1 will have had adequate time to complete and prevent the hazard. If the number of NOPs is equivalent to the number of stages in the pipeline, the processor has been cleared of all of the instructions and can proceed free from hazards. It is called flushing the pipeline. All forms of stalling introduce a delay before the processor may resume execution.

 

 

Posted Date: 10/13/2012 4:26:49 AM | Location : United States







Related Discussions:- Bubbling the pipeline - computer architecture, Assignment Help, Ask Question on Bubbling the pipeline - computer architecture, Get Answer, Expert's Help, Bubbling the pipeline - computer architecture Discussions

Write discussion on Bubbling the pipeline - computer architecture
Your posts are moderated
Related Questions
Differentiate between http and ftp. HTTP and FTP were developed to make Internet transmission better. FTP is utilized to exchange files among computer accounts, to transfer

Digital Signatures. A digital signature is an electronic rather than a written signature that can be used by someone to validate the uniqueness of the sender of a message or of

Zero address instruction format is used for  (A) RISC architecture.      (B) CISC architecture.  (C) Von-Neuman architecture.   (D) Stack-organized architecture.

What are the two ways in which the system using cache can proceed for a write operation? Write by protocol technique Write-back or Copy-back protocol method

Q. How many instructions in a Computer? A computer can have a vast number of instructions and addressing modes. Older computers with the growth of Integrated circuit technolog

The ?rst task in the project is to develop a sane system to store change logs and versions of ?les. The simplest approach is to create a "dot" directory in the location of the ?le

Minimize the logic function F(A, B, C, D) = ∑ m(1,3,5,8,9,11,15) + d(2,13) using K-maps Ans. The logic function minimization of F(A, B, C, D) = ∑ m(1,3,5,8,9,11.15) + d(2,13) by


'On many systems, you can describe a function matherr which will be known as when there are certain floating-point errors, like errors in the math routines in .

Your shell must accept the exit command. This command will be in the form: e x i t When you encounter this command, your shell should terminate. Please note that when you