
	Where results make sense

Topic: Branch prediction

Related Topics

Branch predication

In the News (Wed 30 May 12)

EXECUTIVE POWER

Iran

ANALYSIS

Pakistan

Family compact

	Branch prediction in the Pentium family
		The branch instruction is predicted to jump next time if in state 2 or 3, and to not jump when in state 0 or 1.
		The second level in the branch prediction mechanism is constituted of sixteen 2-bit counters of the type in fig.
		The most important shortcoming of the two-level branch prediction is that it is not very good at predicting the branch pattern of a loop control.
	x86.ddj.com /articles/branch/branchprediction.htm (1921 words)

	Branch predictor - Wikipedia, the free encyclopedia
		Branch prediction is not the same as branch target prediction.
		Branch target prediction attempts to guess the target of the branch or unconditional jump before it is computed from parsing the instruction itself.
		Branches evaluated as not taken decrement the state towards strongly not taken, and branches evaluated as taken increment the state towards strongly taken.
	en.wikipedia.org /wiki/Branch_predictor (2205 words)

	Evaluation of branch-prediction methods on traces from commercial applications (Site not responding. Last check: 2007-10-29)
		Predicting the outcome of the next execution of a branch is done by inspecting the current value of the counter stored for that branch.
		In [5], Nair proposed a scheme in which the taken/not taken type of branch history from the previous chapter is replaced by a history representing the path leading to the branch to be predicted.
		As with adaptive prediction of branch directions, where a history pattern is used to define the entry in a pattern table which then predicts the branch outcome, Chang suggested the use of a history pattern to select the correct target address from among several target addresses stored for that branch.
	www.research.ibm.com /journal/rd/434/hilgendorf.html (7186 words)

	Branch predictor -- Facts, Info, and Encyclopedia article (Site not responding. Last check: 2007-10-29)
		Almost all (Click link for more info and facts about pipelined) pipelined processors do branch prediction of some form, because they must guess the address of the next instruction to fetch before the current instruction has been executed.
		Branch prediction is not the same as (Click link for more info and facts about branch target prediction) branch target prediction.
		branch because the branch resolution recurrence was four cycles long.
	www.absoluteastronomy.com /encyclopedia/b/br/branch_predictor.htm (1988 words)

	Encyclopedia: Branch prediction (Site not responding. Last check: 2007-10-29)
		Scott McFarling proposed combined branch prediction in his 1993 paper 2 (http://citeseer.nj.nec.com/mcfarling93combining.html).
		3 (http://citeseer.nj.nec.com/109851.html) - Multiple-Block Ahead Branch Predictors - Seznec et al - 1996 - demonstrates prediction accuracy is not impaired by indexing with previous branch address.
		5 (http://citeseer.ist.psu.edu/jimenez03reconsidering.html) - Reconsidering Complex Branch Predictors - Jimenez - 2003 - describes the EV6 and K8 branch predictors, and pipelining considerations.
	www.nationmaster.com /encyclopedia/Branch-prediction (2236 words)

	Context switching within a data processing system having a branch prediction mechanism invention
		One known mechanism for branch prediction provides a branch target buffer which is operable to store an indication indexed by the fetch address as to whether or not instructions associated with that fetch address contain a taken branch instruction and if so what is the branch target address of that taken branch instruction.
		In this way, if instructions are being fetched from that address, then a prediction can be made that a branch to the associated branch target address will occur (assuming the behaviour is the same as the last time that branch instruction was encountered) and accordingly instruction fetching can be continued from the branch target address.
		Flagging taken branch instructions, or what the branch target buffer predicts to be taken branch instructions, enables the decoders within the system to examine the instructions including the flags to check that these are consistent with proper instruction formation.
	www.freshpatents.com /Context-switching-within-a-data-processing-system-having-a-branch-prediction-mechanism-dt20061026ptan20060242391.php (1707 words)

	December 94 - Balance of Power: PowerPC Branch Prediction
		The branch is handled early, and the new instructions are fetched from the cache immediately.
		Prediction of guessed branches are based on two things: the direction of the branch and a software "hint" bit.
		If the branch wasn't taken during both of the last two executions, the 604 predicts it again won't be taken.
	developer.apple.com /dev/techsupport/develop.mactech/issue_20/20balance.html (1767 words)

	Untitled Document
		If after the branch is finished executing, it is found that we really wanted to take the branch, then the (possible) next instruction that we had been executing is thrown out by the hardware, and we being executing the correct instruction, the branch target.
		Then, when the next branch is encountered, the bit is checked, if it is on, we act as for a predict-taken strategy, if it is off, we act as for a predict-not-taken strategy.
		If the address of the branch target was known in the IF stage, then predict-taken would have caused the same total number of stalls, it just would have occured after the second BNEZ instead of the first.
	www.cs.umd.edu /class/fall2001/cmsc411/projects/branches/prediction.html (970 words)

	branch prediction Computer Encyclopedia Enterprise Resource Directory Complete Guide to Internet (Site not responding. Last check: 2007-10-29)
		When a branch instruction is executed, its address and that of the next instruction executed (the chosen destination of the branch) are stored in the {Branch Target Buffer}.
		This information is used to predict which way the instruction will branch the next time it is executed so that instruction prefetch can continue.
		When the prediction is correct (and it is over 90% of the time), executing a branch does not cause a {pipeline break}.
	jaysir.com /computer-encyclopedia/b/branch-prediction-computer-terms.htm (151 words)

	Analysis of Branch Prediction Strategies and Branch Target Buffer Design (Site not responding. Last check: 2007-10-29)
		Branches which change the expected order of instruction execution require that the pipeline be reloaded, resulting in several lost machine cycles per such branch.
		By examining the type of branch and the past execution behavior of that branch (taken/not taken) it is possible to predict with high accuracy whether the branch will be taken or not taken, and by remembering the previous branch target (destination), to predict the current branch target.
		Our results show the effectiveness of various prediction strategies, the number of past branches that should be remembered, the amount of state required for each and the effect of workload and branch type.
	sunsite.berkeley.edu /TechRepPages/CSD-83-121 (354 words)

	Dynamic Branch Prediction
		The latency of resolving a branch does not decrease, so the CPI is more significantly affected than it is for a single-issue machine.
		Note that since the branch prediction buffer is NOT a cache, there's no guarantee that the predictions correspond to the "correct" branch instruction.
		Then, by definition, the branch is predicted taken (since it has an entry in the BTB) even if the predictor indicates that it should NOT be taken.
	www.cs.umbc.edu /~plusquel/611/slides/chap4_5.html (960 words)

	Branch Prediction Schemes
		An alternative scheme is to predict the branch as taken.
		In the code sequences for (b) and (c), the use of R1 in the branch condition prevents the ADD instruction (whose destination is R1) from being moved after the branch.
		In a cancelling branch the instruction includes the direction that the branch was predicted.
	www.cs.iastate.edu /~prabhu/Tutorial/PIPELINE/branchPred.html (665 words)

	Branch prediction (EP0381444B1)
		A branch prediction is made by searching a cache memory (79) for branch history information associated with a branch instruction.
		If associated information is not found in the cache, then the branch is predicted based on a predetermined branch bias for the branch instruction's opcode; otherwise, the branch is predicted based upon the associated information from the cache.
		If the cache includes associated information predicting that the branch will be taken, the target address from cache is used so long as the associated length and displacement match the length and displacement for the branch instruction; otherwise, the target address must be computed.
	www.delphion.com /details?pn=EP00381444B1 (380 words)

	[No title] (Site not responding. Last check: 2007-10-29)
		Branch history, whose length is usually fixed in most branch prediction schemes, is employed by branch predictors to represent the interdependence between branch instructions which are executed consecutively.
		Their idea is to allow each branch instruction to have its own path length, which is computed either statically by compilers or dynamically by hardware through profiling.
		Although it is not easy to dynamically profile individual branch instructions, it is shown that variable length path predictors far outperforms other common branch predictors as long as the path length is chosen correctly.
	www.cs.cmu.edu /~gla/740/proposal.html (1015 words)

	NOAA/GSD/FAB -- Forecast Applications Branch
		The Forecast Application Branch performs high resolution analyses and forecasts of the weather using both locally and centrally available meteorological observations.
		The FAB Branch is a component of NOAA's Global System's Division.
		The prediction component is being configured using the RAMS, MM5, WRF, and ETA models.
	laps.noaa.gov (359 words)

	Branch Prediction (Site not responding. Last check: 2007-10-29)
		Try to guess ahead of time which way a branch instruction will go.
		If the guess is incorrect, then some squashing will take place and the pipeline will be less efficient.
		It is possible to get 90% of the guesses correct using branch prediction.
	www.cs.fiu.edu /~downeyt/cop3402/prediction.html (346 words)

	Programmable branch prediction system and method for inserting prediction operation which is independent of execution ...
		means for predicting the behavior of the branch instruction based on the prediction data in the prediction memory.
		Branch prediction mechanism in which a branch history table is updated using an operand sensitive branch table
		Branch target buffer for dynamically predicting branch instruction outcomes using a predicted branch history
	www.delphion.com /details?&pn=US05949995__ (688 words)

	The PC Guide Discussion Forums - Pentium Branch Prediction
		To increase performance CPUs have branch prediction that enables them to "guess" what the result of a conditional branch statement will be and fetch the data or run the code that's after the branch before the branch returns a result.
		These branches that are programs which are code will be executed in the next phase; immediately after compilation to machine language, if I am wrong in saying this please correctandgt;andgt;andgt; I try to do as much research as I possibly can before I request a reply.
		The branch prediction guesses what the next "phase" will be and excutes that code.
	www.pcguide.com /vb/printthread.php?t=6504 (284 words)

	Senior Thesis: Juang, "Classification-based Hybrid Branch Prediction" (Site not responding. Last check: 2007-10-29)
		Conditional branches disrupt the normal control flow of a program by introducing irregularities; instead of a natural, steady progression, conditional branches order the processor to "jump" to different places in the instruction stream.
		First, the branch predictor attempts to forecast where the target of the branch is; it then immediately begins processing the instruction stream at that target.
		Current branch predictors invest quite a bit of logic in sophisticated, general purpose constructs designed to handle all branches in the instruction stream.
	www.cs.virginia.edu /~skadron/Papers/juang_thesis.abstract.html (383 words)

	Branch Prediction Encyclopedia Article, Definition, History, Biography (Site not responding. Last check: 2007-10-29)
		Looking For branch prediction - Find branch prediction and more at Lycos Search.
		Find branch prediction - Your relevant result is a click away!
		Look for branch prediction - Find branch prediction at one of the best sites the Internet has to offer!
	encyclopedia.localcolorart.com /encyclopedia/Branch_prediction (2373 words)

	Static Methods in Hybrid Branch Prediction (Site not responding. Last check: 2007-10-29)
		Hybrid branch predictors combine the predictions of multiple single-level or two-level branch predictors.
		Although the meta-predictor is static, the actual predictions remain dynamic, so there is little risk of worst-case performance.
		All the results we present are based on a cross-validation methodology, in which the profile data used for static selection are based on training inputs that are entirely different from the inputs used to evaluate the performance of the technique.
	systems.cs.colorado.edu /Papers/Architecture/PACT98-StaticHybrid (219 words)

	Branch Prediction For Free - Ball, Larus (ResearchIndex)
		Abstract: Many compilers rely on branch prediction to improve program performance by identifying frequently executed regions and by aiding in scheduling instructions.
		We present a program-based branch predictor that performs well for a large and diverse set of programs written in C and Fortran.
		In addition to using natural loop analysis to predict branches that control the...
	citeseer.ist.psu.edu /ball93branch.html (517 words)

	Branch Prediction Research in the LAVA Lab (including hybrid predictors, speculative update, return address stack, and ...
		Improving branch prediction, although already a well-studied subject, remains critical because delivering very high branch-prediction rates is crucial to further performance gains in high-performance computing.
		branch predictor structure—a pseudo-hybrid branch predictor that we call an alloyed predictor.
		Not only do some branches in a program benefit from global history while others benefit from local history—a well known fact that suggests use of a hybrid predictor—but in fact individual branches vary between benefiting from global history and benefiting from local history.
	lava.cs.virginia.edu /bpred.html (819 words)

	Pattern History Table based Branch Prediction Techniques (Site not responding. Last check: 2007-10-29)
		In this technique, the prediction information are kept on the pattern history table which is consist of 2-bit saturated up-down counters.
		When a conditional branch is being predicted, the content of the counter which is indexed by branch address is used for prediction.
		In PHT based dynamic branch prediction, the real question is about which technique that we can use to increase the prediction accuracy.
	www.umiacs.umd.edu /~hismail/818K/node2.html (263 words)

	Branch Predictor Prediction: A Power-Aware Branch Predictor for High-Performance Processors
		We introduce Branch Predictor Prediction (BPP) as a power-aware branch prediction technique for high performance processors.
		Our predictor reduces branch prediction power dissipation by selectively turning on and off two of the three tables used in the combined branch predictor.
		We show that on the average and for an 8-way processor, BPP can reduce branch prediction power dissipation by 28% and 14% compared to non-banked and banked 32k predictors respectively.
	csdl2.computer.org /persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/&toc=comp/proceedings/iccd/2002/1700/00/1700toc.xml&DOI=10.1109/ICCD.2002.1106813 (263 words)

	Dynamic Branch Prediction with Perceptrons - Jimenez, Lin (ResearchIndex)
		The key idea is to use one of the simplest possible neural networks, the perceptron, as an alternative to the commonly used two-bit counters.
		Our predictor achieves increased accuracy by making use of long branch histories, which are possible because the hardware resources for our method scale linearly with the history length.
		55 Using hybrid branch predictors to improve branch prediction..
	citeseer.ist.psu.edu /379813.html (653 words)

	NRLMRY - Atmospheric Dynamics & Prediction Branch (Code 7530)
		The Atmospheric Dynamics and prediction Branch focuses on science and technology related to the analysis and prediction of atmospheric processes that impact fleet operations.
		Numerical prediction systems are developed to analyze and assimilate observations, and extrapolate in space and time.
		Theoretical and numerical models are used to support basic research of atmospheric structure and processes, to examine theories about atmospheric behavior, and as prototypes for operational prediction systems used at both central and remote sites, either ashore or afloat.
	www.nrlmry.navy.mil /br7530.htm (117 words)

	Branch Prediction (Site not responding. Last check: 2007-10-29)
		At the Instruction Fetch pipeline stage, the address of any conditional branch instruction is submitted to the BTB for lookup.
		Dynamic Branch Prediction uses Yeh’s Prediction Algorithm, which recognize behavior patterns such as taken and not taken.
		BTB has 4-bits to maintain history on the branch's behavior the last four times that it was executed.
	carbon.cudenver.edu /~jcha/5593pres/tsld018.htm (108 words)

	Static Methods in Branch Prediction (Site not responding. Last check: 2007-10-29)
		Recent microprocessors devote tens of thousands of transistors to the important problem of performing a branch prediction in a single pipeline stage.
		Hybrid branch predictors combine the predictions of multiple ``component'' predictors.
		The prediction combining hardware --- the selection mechanism --- has costs that I eliminate by controlling selection from software, in what I call a static hybrid predictor.
	systems.cs.colorado.edu /Papers/Thesis/Thesis-lindsay (326 words)

Try your search on: Qwika (all wikis)