Stack Computers: An Introduction
Computer1977Vol. 10(5), pp. 18–28
Citations Over TimeTop 10% of 1977 papers
Abstract
Basic idea. The stack, or last-in first-out store, has become more familiar recently because many microprocessors have incorporated a stack in some form. In some microprocessors, the stack can only contain return addresses for subroutines; in others there are provisions for holding temporary data in the stack. The stack derives its name from the idea that items are placed on the "top," thus "pushing down" those items already on the stack. Items are removed from the top, "popping up" those items remaining on the stack.
Related Papers
- → Stack Computers: An Introduction(1977)15 cited
- → Maximum Stack Memory Monitoring Method Assisted by Static Analysis of the Stack Usage Profile(2017)1 cited
- Exploring of Speculative Thread-level Parallelism from Subroutine(2009)
- LSTACK: Stata module to stack variables with labelled _stack(1998)
- → Two stack dynamic memory allocation(2002)