How can we minimize problems occurring because of branch., Computer Engineering

Q. How can we minimize problems occurring because of the branch instructions?

We may use various mechanisms which may minimize the effect of branch penalty.

  • To keep multiple streams in pipeline in the case of branch
  • Pre-fetching the subsequent as well as instruction to which branch is to take place
  • A loop buffer can be used to store instructions of a loop instruction
  • Predicting whether the branch will occur or not and acting accordingly
  • Delaying the pipeline fill up until branch decision is taken.
Posted Date: 7/27/2013 3:13:00 AM | Location : United States







Related Discussions:- How can we minimize problems occurring because of branch., Assignment Help, Ask Question on How can we minimize problems occurring because of branch., Get Answer, Expert's Help, How can we minimize problems occurring because of branch. Discussions

Write discussion on How can we minimize problems occurring because of branch.
Your posts are moderated
Related Questions
Name the dynamic memory allocation function? Three dynamic memory allocation functions are: a) malloc, b) calloc and c) free.

The dataset provided in this assignment contains a collection of real DNA sequences. The number of true binding sites is quite limited and that makes the problem challenging. In ma

A 2-digit BCD D/A converter is a weighted resistor type with E R = 1 Volt, with R = 1M? , R f = 10K? . Find resolution in Percent and Volts. Ans. Resolution = 1/2 2 = 0.25 vo

Q. Example of arrays pointers? General form of declaration of array in Fortran 90 is type, DIMENSION(bound) [,attr] :: name E.g. the declaration          INTEGER, D

representation of the adjacency matrix and adjacency list

Write a program that finds the minimum total number of shelv, C/C++ Programming

The features are needed to implement top down parsing are? Ans. Source string marker, Prediction making mechanism and also matching and backtracking mechanism features are need

SET 2I OF ALL INTEGERS WITH ZERO IS AN ABELIAN GROUP

De Morgan's Laws : With continuing the relationship between ^ and ? , we can also needs De Morgan's Law to rearrange sentences involving negation in conjunction with these con

State the optimal route of node Consider the node i which has path length K+1, with the directly preceding node on the path being j. The distance to node i is w(j, i) plus the