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
Explain Direct or Indirect Communication in Inter-process communication. Several types of message passing system in Direct or Indirect Communication are given below:

What are Assemblies? Assemblies are same to dll files. Both have the reusable pieces of code in the shape of classes/ functions. Dll needs to be registered but assemblies have

In the data parallel model, many of the parallel work focus on performing operations on a data set. The data set is usually organized into a common structure, such as an array or a

Q. Which way do twin twist props on a boat rotate when propelling the boat forward? Answer:- In opposite direction however they are designed to propel the boat forward eve

What is a accepting computation history?  An accepting computation history is explained as , Let M be a Turing machine and w be a input string,  for M on w is a sequence of con

What is XMS Memory system is divided into 3 main parts. TPA (transient program area), system area and XMS (extended memory system). Type of microprocessor in your computer sign

Drawbacks to resolution theorem: Thus the underlining here identifies some drawbacks to resolution theorem proving: It only works for true theorems that can be expresse

Erasable programmable read only memory (EPROM) This is a special type of PROM which can be erased by exposing it to ultraviolet (UV) light. Once it has been erased, it can be r

Probelm: (a) Show the attributes used by Regular Expression Pattern in a WSDL document. (b) Describe the three standard wire formats for transmitting Web Service requests a