3 ms·
Some optimisation can only be performed after the fact (in as much as profile of a real run against real data informs the branch prediction and choices in specu
by ggm 7y ago
Some optimisation can only be performed after the fact (in as much as profile of a real run against real data informs the branch prediction and choices in speculative execution and order)
Some execution fails: hardware has pathological instruction sequences which force sub optimal choices to be made.
Alternative algorithms cannot always be identified from an instruction sequence. What if a higher order function identifed better seeds and led to faster detection in a large field of candidate solutions?