I was studying computer architectures and got to the Call Stack

Yeah, but the point of scratching that out was because I phrased the sentence poorly.

This probably stems from different processor manufacturers calling them different things.
A queue is not how a program typically works. Using a queue would be more applicable if we only ever entered a new function at the end of the last one. Even then the queue would only have a size of 1. Since 99% of the time function calls are in the middle of a function we need to use a stack. It should be pretty simple to visualize entering and exiting functions to be like a stack. Think of calling a funcion as pushing it onto a theoretical stack and return instruction as popping off the top of our theoretical stack. With this mental model you should notice how function calls, even recursive one closely align with the idea of FIFO. A function that has returned must also have been the last function that was called.

You don't want fifo when the first ones are your kernel.