Traditional branch predictors exploit correlations between pattern history and branch outcome to predict branches, but there is a stronger and more natural correlation between path history and branch outcome. I exploit this correlation with piecewise linear branch prediction, an idealized branch predictor that develops a set of linear functions, one for each program path to the branch to be pre...

Recent studies have shown significantly improved branch prediction through the use of branch classification. By separating static branches into groups, or classes, with similar dynamic behavior, predictors may be selected that are best suited for each class. Previous methods have classified branches according to taken rate (or bias). We propose a new metric for branch classification: branch tra...

this research project was carried out to evaluate the ph.d.theses in agricultural and natural resources branches in the universities of the country in the years of 2011 and 2012. totally 257 theses were evaluated. in this study, six scientific and applied indices were evaluated. one hundred points were given to each thesis; 70 points for scientific and 30 points for applied aspects of the thesi...

An important step in genetic recombination is DNA branch migration, the movement of the Holliday junction or exchange point between two homologous duplex DNAs. We have determined kinetic parameters of spontaneous branch migration as a function of temperature and ionic conditions. The branch migration substrates consist of two homologous duplex DNAs each having two single-strand tails at one end...

Accurate instruction fetch and branch prediction is increasingly important on today’s superscalar architectures. Fetch prediction is the process of determining the next instruction to request from the memory subsystem. Branch prediction is the process of predicting the likely out-come of branch instructions. A branch target buffer (BTB) is often used to provide target addresses for taken branch...

The branch predictor plays a crucial role in the achievement of effective performance in microprocessors with pipelined architectures. This paper analyzes performance of branch prediction unit for pipelined processors. A memory of 512 bytes is designed for storing instructions. A 32 byte memory is designed for branch target buffer (BTB). This memory is utilized for storing history of the branch...

Energy-efficient dynamic branch predictors are proposed for the Cell SPE, which normally depends on compiler-inserted hint instructions to predict branches. All designed schemes use a Branch Target Buffer (BTB) to store the branch target address and the prediction, which is computed using a bimodal counter. One prediction scheme predecodes instructions when they are fetched from the local store...

Data collected from four distinct canopy positions from each of 39 Abies balsamea (L.) Miller trees were used to construct models to describe the cumulative leaf area distribution within the crown and to predict the needle mass of individual branches, the average branch angle, branch diameter, branch length, and crown radius per whorl, and the average number of living branches per whorl. We tes...

Indirect branch prediction is likely to become more important in the future because indirect branches tend to be more frequent in object-oriented programs. With indirect branch prediction misprediction rates of around 25% on current processors, such branches can incur a significant fraction of branch misses even though indirect branches are less frequent than the more predictable conditional br...

The purpose of this study is to determine geochemical anomalies on lithogeochemical data from Ardestan area, Central Iran, using concentration-number (C-N) fractal modeling and staged factor analysis. Staged factor analysis is used to the recognition of genetic correlation and elimination of non-indicator elements in three steps. Factor scores of elements were calculated and geochemical data cl...