Talk:Predication (computer architecture)
![]() | Computer science Start‑class Low‑importance | ||||||||||||||||
|
The binary GCD algorithm in ARM assembly is probably appropriate on this page (but not on the page it references). I'm not sure how I copy the code from the latest page that had the code: http://en.wikipedia.org/w/index.php?title=Binary_GCD_algorithm&oldid=468833079 — Preceding unsigned comment added by 130.208.138.229 (talk) 20:33, 27 March 2013 (UTC)
There is a problem with the first sentence,
"Because computer programs respond to a user, there is no way around the fact that portions of a program need to be executed conditionally."
A program which computes a formula from user input may not need to branch, and conversely a program with complex logic which receives no direct inputs from a user (paging in the OS) may need to branch.
It is unclear exactly how to introduce this topic. Mjr1007 (talk) 17:24, 29 July 2008 (UTC)
Correct Term?
I would like to ask whether this article should not be called "branch prediction". - this term seems to be used more frequently - the reverse term "misprediction" seems to be uncontested - semantically, "branch predication" seems to be something
related to a predicate rather than to prediction. — Preceding unsigned comment added by 141.3.24.54 (talk) 07:30, 22 April 2014 (UTC)
Additional advantage
According to the Intel® Itanium® Architecture Software Developer’s Manual Volume 1: Application Architecture
http://download.intel.com/design/Itanium/manuals/24531705.pdf
In section 4.2.4.1
This code takes 18 cycles to complete if p2 is true and five cycles if p2 is false. When analyzing such cases, consider execution weights, branch misprediction probabilities, and prediction costs along each path.
The execution times decreases if the predicate is false.