4 ms·
Out-of-order execution isn't only about instruction order, and static scheduling can't give you everything. One execution of a given chunk of code might have so
by JoshTriplett 9y ago
Out-of-order execution isn't only about instruction order, and static scheduling can't give you everything. One execution of a given chunk of code might have something in cache, another execution of that same code might not. One execution might consistently take one branch, another might consistently take another, because it varies based on workload.
Out-of-order execution helps with things like "I don't have the memory fetch done yet, but let's make a reasonable assumption and then speculatively do lots more that doesn't depend on that fetch".
- dnautics 9y agothanks! Cache miss latency! I forgot about that.
- ant6n 9y agoIt means load [rp1] -> r1 inc r1 load [rp2] -> r2 inc r2 may execute in a different order for every execution.
- deepnotderp 9y agoWhile true in principle, in practice the majority (~88%) of the gains of OoO come not from reactions to dynamic events (e.g. caches misses) but rather from schedules. This is relatively recent research, and definitely against the common grain. See Daniel McFarlin's work at CMU (https://dl.acm.org/citation.cfm?id=2499368.2451143 https://dl.acm.org/citation.cfm?id=2499368.2451143)