Beating the L1 cache with value speculation
How realistic is it to have a linked list in contiguous memory that stays nicely ordered?   In my experience, lists are normally cobbled together with nodes that are allocated widely separated in time and hence I have no knowledge that I can use to predict the address of the next pointer.If you're in a scenario where this optimization works, it seems like it would be better to just use an array.