Scribd
Upload
1K views

Stack Organization

This document discusses different processor organizations including register stack organization, memory stack organization, and reverse polish notation. It describes how register stack organization uses a stack pointer register and push/pop instructions to manage a stack of registers. It also describes memory stack organization which uses a portion of memory as a stack managed by a stack pointer register. Reverse polish notation is discussed as being suitable for stack manipulation during arithmetic expression evaluation.

Uploaded by

Sadaf Rasheed
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
1K views

Stack Organization

This document discusses different processor organizations including register stack organization, memory stack organization, and reverse polish notation. It describes how register stack organization uses a stack pointer register and push/pop instructions to manage a stack of registers. It also describes memory stack organization which uses a portion of memory as a stack managed by a stack pointer register. Reverse polish notation is discussed as being suitable for stack manipulation during arithmetic expression evaluation.

Uploaded by

Sadaf Rasheed
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Central Processing Unit 1 Lecture 23

Overview
Introduction

General Register Organization

Stack Organization

Instruction Formats

Addressing Modes

Data Transfer and Manipulation

Program Control and Program Interrupt

Reduced Instruction Set Computer

CSE 211, Computer Organization and Architecture Harjeet Kaur,


Central Processing Unit 2 Lecture 23

Stack Organization

Stack
Very useful feature for nested subroutines, nested
interrupt services
Also efficient for arithmetic expression evaluation
Storage which can be accessed in LIFO
Pointer: SP
Only PUSH and POP operations are applicable

Stack Organization
Register Stack Organization
Memory Stack Organization

CSE 211, Computer Organization and Architecture Harjeet Kaur,


Central Processing Unit 3 Lecture 23

Register Stack Organization

63
Flags
FULL EMPTY

Stack pointer 4
SP C 3
6 bits B 2
A 1
Push, Pop operations 0
DR
/* Initially, SP = 0, EMPTY = 1, FULL = 0 */

PUSH POP
SP SP + 1 DR M[SP]
M[SP] DR SP SP 1
If (SP = 0) then (FULL 1) If (SP = 0) then (EMPTY 1)
EMPTY 0 FULL 0

CSE 211, Computer Organization and Architecture Harjeet Kaur,


Central Processing Unit 4 Lecture 23

Memory Stack Organization


1000
Program
Memory with Program, Data, PC (instructions)
and Stack Segments
Data
AR (operands)

SP 3000
stack
3997
3998
3999
4000
4001
- A portion of memory is used as a
stack with a
processor register as a stack
pointer

- PUSH: SP SP - 1
M[SP] DR
- -Most
POP:DR M[SP]
computers do not provide hardware to check stack
SP SP + 1
overflow (full
stack) or underflow (empty stack) must be done in
CSE 211, Computer Organization and Architecture Harjeet Kaur,
Central Processing Unit 5 Lecture 23

Reverse Polish Notation


Arithmetic Expressions: A + B
A + B Infix notation
+ A B Prefix or Polish notation
A B + Postfix or reverse Polish notation
- The reverse Polish notation is very suitable for
stack manipulation
Evaluation of Arithmetic Expressions
Any arithmetic expression can be expressed in
parenthesis-free Polish notation, including reverse Polish
notation
(3 * 4) + (5 * 6) 34*56*+

6
4 5 5 30
3 3 12 12 12 12 42
3 4 * 5 6 * +

CSE 211, Computer Organization and Architecture Harjeet Kaur,


Central Processing Unit 6 Lecture 23

Processor Organization
In general, most processors are organized
in one of 3 ways

Single register (Accumulator) organization


Basic Computer is a good example
Accumulator is the only general purpose register

General register organization


Used by most modern computer processors
Any of the registers can be used as the source or
destination for computer operations

Stack organization
All operations are done using the hardware stack
For example, an OR instruction will pop the two top
elements from the stack, do a logical OR on them,
CSE 211, Computer Organization
and push andon
the result Architecture
the stack Harjeet Kaur,

You might also like