The computers which use Stack-based CPU Organization are based on a data structure called stack. The stack is a list of data words. It uses Last In First Out (LIFO) access method which is the most popular access method in most of the CPU. A register is used to store the address of the topmost element of the stack which is known as Stack pointer (SP). In this organisation, ALU operations are performed on stack data. It means both the operands are always required on the stack. After manipulation, the result is placed in the stack.
The main two operations that are performed on the operators of the stack are Push and Pop. These two operations are performed from one end only.
- Push –
This operation results in inserting one operand at the top of the stack and it decrease the stack pointer register. The format of the PUSH instruction is:
It inserts the data word at specified address to the top of the stack. It can be implemented as:
//decrement SP by 1 SP <-- SP - 1 //store the content of specified memory address //into SP; i.e, at top of stack SP <-- (memory address)
- Pop –
This operation results in deleting one operand from the top of the stack and it increase the stack pointer register. The format of the POP instruction is:
It deletes the data word at the top of the stack to the specified address. It can be implemented as:
//transfer the content of SP (i.e, at top most data) //into specified memory location (memory address) <-- SP //increment SP by 1 SP <-- SP + 1
Operation type instruction does not need the address field in this CPU organization. This is because the operation is performed on the two operands that are on the top of the stack. For example:
This instruction contains the opcode only with no address field. It pops the two top data from the stack, subtracting the data, and pushing the result into the stack at the top.
PDP-11, Intel’s 8085 and HP 3000 are some of the examples of the stack organized computers.
The advantages of Stack based CPU organization –
- Efficient computation of complex arithmetic expressions.
- Execution of instructions is fast because operand data are stored in consecutive memory locations.
- Length of instruction is short as they do not have address field.
The disadvantages of Stack based CPU organization –
- The size of the program increases.
Note:Stack based CPU organisation uses zero address instruction.
Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.My Personal Notes arrow_drop_up
- Introduction of Single Accumulator based CPU organization
- Introduction of General Register based CPU Organization
- Difference between Memory based and Register based Addressing Modes
- Cache Organization | Set 1 (Introduction)
- Growable array based stack
- Sort the given stack elements based on their modulo with K
- Stack | Set 3 (Reverse a string using stack)
- Sort a stack using a temporary stack
- Stack Permutations (Check if an array is stack permutation of other)
- Infix to Postfix using different Precedence Values for In-Stack and Out-Stack
- Find maximum in stack in O(1) without using additional stack
- What's difference between CPU Cache and TLB?
- Difference between System Unit and CPU
- Program Execution in the CPU
- Difference between CPU and GPU
- Communication channel between CPU and IOP
- Different Classes of CPU Registers
- Stack Data Structure (Introduction and Program)
- Cache Memory in Computer Organization
- Computer Organization and Architecture | Pipelining | Set 1 (Execution, Stages and Throughput)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.