Skip to content

Comment on Beating the L1 cache with value speculationparent

Comments

Given the nature of branch prediction, I’d expect it would still help dramatically in the case where the list was almost entirely sequential, which seems a bit more plausible.

Agree; if a mispredict costs 15-20 cycles and a predict saves 4 cycles, does that mean we break even around 1/4-1/3 sequential?

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.