Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Predication (computer architecture)
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Advantages== The main purpose of predication is to avoid jumps over very small sections of program code, increasing the effectiveness of [[pipeline (computing)|pipelined]] execution and avoiding problems with the [[CPU cache|cache]]. It also has a number of more subtle benefits: *Functions that are traditionally computed using simple arithmetic and [[bitwise operation]]s may be quicker to compute using predicated instructions. *Predicated instructions with different predicates can be mixed with each other and with unconditional code, allowing better [[instruction scheduling]] and so even better performance. *Elimination of unnecessary branch instructions can make the execution of necessary branches, such as those that make up loops, faster by lessening the load on [[branch prediction]] mechanisms. *Elimination of the cost of a branch misprediction which can be high on deeply pipelined architectures. * Instruction sets that have comprehensive [[Condition_code_register|Condition Codes]] generated by instructions may reduce code size further by directly using the Condition Registers in or as predication.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)