Speculative execution
Optimization technique
In computer science and processor design, speculative execution or speculation is a design characteristic where a processor is able to perform potentially useful work by guessing what work is needed next, compute them prematurely, and immediately applying or discarding the results when the work's necessity is eventually known. Since the 21st century, speculation is commonly seen on superscalar central processors (CPUs), as an optimization technique to increase its performance.
Nº Q2164465 ★
Common · History
Speculative execution
Optimization technique
In computer science and processor design, speculative execution or speculation is a design characteristic where a processor is able to perform potentially useful work by guessing what work is needed next, compute them prematurely, and immediately applying or discarding the results when the work's necessity is eventually known. Since the 21st century, speculation is commonly seen on superscalar central processors (CPUs), as an optimization technique to increase its performance.
From Wikipedia
In computer science and processor design, speculative execution or speculation is a design characteristic where a processor is able to perform potentially useful work by guessing what work is needed next, compute them prematurely, and immediately applying or discarding the results when the work's necessity is eventually known. Since the 21st century, speculation is commonly seen on superscalar central processors (CPUs), as an optimization technique to increase its performance. It is often used in combination with branch prediction to increase the accuracy of the guessing process.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
P
Process optimization
Adjusting a process
Nº Q332172 ★
Not listed
-
Mathematical optimization
Study of mathematical algorithms for optimization problems
Nº Q141495 ★★★
Not listed
-
S
Speculative philosophy
Philosophical concept
Nº Q1759270 ★★
Not listed
-
Concurrency (computer science)
Ability of different parts or units of a program, algorithm, or problem to be executed out-of-order or in partial order, without affecting the final outcome
Nº Q1414548 ★★
Not listed
-
J
Just-in-time compilation
Dynamically compiling bytecode to machine code during runtime
Nº Q110546 ★★
Not listed
-
Recursive self-improvement
Ability of an artificial intelligence to modify itself to further improve its capability
Nº Q1768494 ★★★
Not listed