Von Neumann model - Memory

Slides:



Advertisements
Similar presentations
Memory.
Advertisements

CPU Review and Programming Models CT101 – Computing Systems.
Run-time Environment for a Program different logical parts of a program during execution stack – automatically allocated variables (local variables, subdivided.
MIPS ISA-II: Procedure Calls & Program Assembly. (2) Module Outline Review ISA and understand instruction encodings Arithmetic and Logical Instructions.
CPS3340 COMPUTER ARCHITECTURE Fall Semester, /17/2013 Lecture 12: Procedures Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER SCIENCE CENTRAL.
1 Computer Architecture MIPS Simulator and Assembly language.
Intro to Computer Architecture
MEMORY MANAGEMENT By KUNAL KADAKIA RISHIT SHAH. Memory Memory is a large array of words or bytes, each with its own address. It is a repository of quickly.
7/13/20151 Topic 3: Run-Time Environment Memory Model Activation Record Call Convention Storage Allocation Runtime Stack and Heap Garbage Collection.
Operand Addressing and Instruction Representation
Tutorial 6 Memory Management
System Calls 1.
Fall 2008CS 334: Computer SecuritySlide #1 Smashing The Stack A detailed look at buffer overflows as described in Smashing the Stack for Fun and Profit.
The Instruction Set Architecture Level Dept. of Computer Science Virginia Commonwealth University.
13/02/2009CA&O Lecture 04 by Engr. Umbreen Sabir Computer Architecture & Organization Instructions: Language of Computer Engr. Umbreen Sabir Computer Engineering.
Introduction: Exploiting Linux. Basic Concepts Vulnerability A flaw in a system that allows an attacker to do something the designer did not intend,
Objective At the conclusion of this chapter you will be able to:
Processes Introduction to Operating Systems: Module 3.
Computer Science 101 Computer Systems Organization.
MAL 3 - Procedures Lecture 13. MAL procedure call The use of procedures facilitates modular programming. Four steps to transfer to and return from a procedure:
Interrupt driven I/O. MIPS RISC Exception Mechanism The processor operates in The processor operates in user mode user mode kernel mode kernel mode Access.
Operand Addressing And Instruction Representation Cs355-Chapter 6.
Chapter 10 Instruction Sets: Characteristics and Functions Felipe Navarro Luis Gomez Collin Brown.
Interrupt driven I/O Computer Organization and Assembly Language: Module 12.
Comp Sci MIPS machine 1 Ch. 3 MIPS RISC Machine.
Copyright 2006 by Timothy J. McGuire, Ph.D. 1 MIPS Programming Model CS 333 Sam Houston State University Dr. Tim McGuire.
Memory Access Instructions Load and Store Addressing Modes Memory Addressing. Base addressing mode. Load byte and store byte: lb, lbu, sb Address alignment.
Computers’ Basic Organization
Storage Classes There are three places in memory where data may be placed: In Data section declared with .data in assembly language in C - Static) On the.
CS 140 Lecture Notes: Virtual Memory
Introduction to Operating Systems
Memory Access Instructions
Microprocessor and Assembly Language
Part of the Assembler Language Programmers Toolbox
A Closer Look at Instruction Set Architectures
Process Realization In OS
Software Development with uMPS
A Closer Look at Instruction Set Architectures: Expanding Opcodes
Von Neumann model - Memory
Processor Organization and Architecture
Paging and Segmentation
CS 140 Lecture Notes: Virtual Memory
Operating System Concepts
CSCI206 - Computer Organization & Programming
The University of Adelaide, School of Computer Science
MIPS assembly.
MIPS Instructions.
Main Memory Background Swapping Contiguous Allocation Paging
CS 140 Lecture Notes: Virtual Memory
Lecture 3: Main Memory.
COMS 361 Computer Organization
Program and memory layout
Chapter 8: Memory Management strategies
What is Computer Architecture?
What is Computer Architecture?
What is Computer Architecture?
Program and memory layout
Program and memory layout
Where is all the knowledge we lost with information? T. S. Eliot
CPU Structure CPU must:
Program and memory layout
CPU Structure and Function
CS 140 Lecture Notes: Virtual Memory
MIPS assembly.
Computer Operation 6/22/2019.
CSE378 Introduction to Machine Organization
Computer Architecture and System Programming Laboratory
Topic 2b ISA Support for High-Level Languages
8/23/
Presentation transcript:

Von Neumann model - Memory Memory is an array of Cells. Memory keeps information in the cells. Each Cell has a unique address and could be selected by its Address. Information could be loaded from Memory Cell to Register or stored from Register to Memory Cell. The source of information in this case is not changed. Only the destination is overwritten.

Memory example 4 cells In this example: The memory contains 4 Cells. They are addressed by 2 bit address which is enough to select all 4 Cells. If the memory is larger, then the address bits have to be more to be able to address more Cells.

Memory example 8 cells, 8 bits Address length is 3 bits Memory Cell length is 8 bits (1 byte) We can load or store 8 bits at once.   3 address bits address 23 = 8 Memory Cells. Data and Address registers lengths do not depend each of other.

Memory example 8 cells, 16 bits Address length is 3 bits Memory Cell length is 16 bits (2 bytes) We can load or store 16 bits at once.   3 address bits address 23 = 8 Memory Cells. Data and Address registers lengths do not depend each of other.

MIPS model 232 cells, each 8 bits MIPS memory is an array of 232 bytes. Each byte has a 32-bit address. Each byte can hold an 8-bit pattern, one of the 256 possible 8-bit patterns. The addresses of MIPS main memory range from 0x00000000 to 0xFFFFFFFF. 232 bytes Memory Size Operations Load: a bit pattern starting at a designated address in memory is copied into a register inside the processor. Store: a bit pattern is copied from a processor register to memory at a designated address. Address 32 bits General Purpose Register

MIPS memory layout The lower half (most of it anyway) is for user programs. User memory is further divided (by software convention) into text, data and stack segments. Text Segment: This holds the machine language of the user program (called the text). Data Segment: This holds the data that the program operates on. Static Data Dynamic Data Stack Segment: With high level languages, local variables and parameters are pushed and popped on the stack as procedures are activated and deactivated. ROM, Device buffers, … not available for user programs Dynamic Data Dynamic Data Static Data User program machine code User programs and data are restricted to the last 231 bytes. The last half of the address space is used for specialized purposes. OS Kernel