The fact that stacks are bounded means you both push and you pop. Just as frequently as a function calls another one resulting in memory ops moving to lower addresses, functions also return causing memory ops to move back to higher addresses. Pushes and pops are balanced. Why do we know they are balanced? Because the stack is bounded.
So - the direction of stack growth isn’t interesting to prefetching strategy.
Comments
The fact that stacks are bounded means you both push and you pop. Just as frequently as a function calls another one resulting in memory ops moving to lower addresses, functions also return causing memory ops to move back to higher addresses. Pushes and pops are balanced. Why do we know they are balanced? Because the stack is bounded.
So - the direction of stack growth isn’t interesting to prefetching strategy.
Sure, but push/pop are not the only ways to access stack.
Moreover, I'm still wondering what you mean by this:
What is this fact? Why does HW not expect you to bump addresses downwards?