do you know enough about low-level computer architecture to speculate if mild-to-moderate changes would be warranted in things like, e.g., cache sizes on CPUs? Branch prediction was implemented on generalizations drawn in research papers analyzing procedural codes. I&#x27;m wondering if the concurrency abstraction will add a significant working-set to the runtime that adversely impacts existing prediction algorithms. For example, predicting in a for loop is one thing, but when the target of the branch is always some new portion of memory (graphic, text, etc), it&#x27;ll always be a cache miss, and there&#x27;ll never be branch history for it-- because neither have touched it yet.<p>this is probably a silly question because the content, though it might always be in RAM, will be branched to an order-of-magnitude less than it&#x27;ll be used (once it&#x27;s been loaded to cache)...but still, there should be an observable temporal-boundary to the context stored in cache and branch predictor in a procedural language, that would be manifest as an abstraction-boundary in a more parallelized environment