SlideShare una empresa de Scribd logo
1 de 46
MEMORY ORGANIZATION
25.Sandesh Jonchhe
26.Sanjay Bhandari
27.Shiva Ghimire
28.Sudesh Parajuli
29.Sumanti Rajbanshi
1
MEMORY UNIT
2
Sandesh
an essential component in any general purpose computer since it
is needed to store programs and data.
memory unit that communicates directly with the CPU = main
memory
devices that provide backup storage = auxiliary memory.
Auxiliary memory devices are used to store system programs,
large data files and other backup information. Only programs
and data currently needed by the processor reside in main
memory. All other information is stored in main memory and
transferred to main memory when needed.
Memory Unit3
Cache Memory
• Memory that lies in between main memory
and CPU
Holds those parts of the program and data
that are most heavily used
• increases the overall processing speed of the
computer by providing frequently required
data to the CPU at a faster speed.
4
Main Memory
• Memory unit that communicates directly with CPU
• Programs and data currently needed by the
processor reside here
• Also known as primary memory
• RAM and ROM
5
Auxiliary Memory
• Made of devices that provide backup storage
• Magnetic tapes, Magnetic disks
• At the bottom of the hierarchy are the relatively
slow magnetic tapes used to store removable files
whereas at the top level, magnetic disks used as
backup storage
6
• A class of data storage device that read their data in sequence
• Are usually a form of magnetic memory
• Typically used for secondary storage in general-purpose computers due to their higher density,
resistance to wear and non-volatility
• Eg: hard disk, CD-ROMs, magnetic tapes etc
Sequential Access Memory
• Is a form of computer data storage
• Allows stored data to be accessed in any order
• Associated with volatile types of memory
• Type: SRAM and DRAM
Random Access Memory
Memory Types7
• To obtain the highest possible access speed while minimizing the
total cost of the memory system
• Consists of all storage device in a computer system (auxiliary, cache,
main , high speed registers and processing logic)
Memory Hierarchy8
9
Magnetic
tapes
Magnetic disk
I/O Processor
Main
Memory
CPU
Cache
Memory
Fig: Memory Hierarchy in a Computer System
10
MAIN MEMORY
11
Sumanti
• Basic memory of the computer
• Temprorary memory except rom
• Faster for read write operation
• Expensive internal memory so not portable.
RAM
• Volatile memory.
• Stores information required during processing
Two types of random Static Ram(SRAM) and Dynamic
Ram(DRAM)
Main memory
12
• Does not lose its content until
computer is turned off
• Information is stored in form of
voltage
• faster
• Loses its content after few
seconds
• Information is stored in the
form of charge
• slower
 SRAM  DRAM
TYPES OF RAM13
• Permanent memory
• Stores information required for computer operations
• Types of rom(PROM,EPROM,EEPROM)
ROM
14
Boot Strap loader
 Initial program whose function is to start the computer operating
system after the power is turned on. and it is stored in the rom
portion of the main memory .
 Computer start up :starting the execution of initial program after
computer is turned on
 Boot strap loader loads the portion of disk to main memory and
control is then transferred to os.
15
• The most common auxilliary device used in the computer system is
magnetic disk and magnetic tape.
• Store large amount of data permanantly.
• Portable
 Types of auxilliary memory
 Magnetic disk
 Magnetic tape
Auxiliary memory(SECONDARY
MEMORY)
16
• circular plate ,made of metal or plastic coated with magnetize material.High
speed of rotation
• Bits are store in a concentric circle called tracks.
• Division of tracks are called sectors.
Magnetic disk17
Magnetic disk18
 Sequential access memory used for storing,backup,audio,video data etc .
 Highly reliable memory.
 Slower for read write operation.
Magnetic tape19
Magnetic tape20
RAM AND ROM CHIP
21
Shiva
RAM AND ROM CHIPS
RAM chip:
Used for communication with the CPU if one or
more control inputs.
requires 7-bit address and an 8-bit bidirectional
data bus.
 chip select (CS) are for enabling the chip.
22
Fig. RAM chip
23
 when CS1=1 and (CS2)’=0, the unit in operation.
 High impedance state indicates open circuit.
 When CS1=1 and (CS2)’=0, the memory is places in a R/W mode.
 When the RD input is enabled, the content of the selected byte is placed into the
data bus.
24
ROM chip25
A ROM chip is unidirectional.
9 address lines to address 512 bytes.
 chip select CS1=1 and (CS2)’=0 for the unit to
operate.
Otherwise, the data bus in a high-impedance
state.
26
VIRTUAL MEMORY
27
Sanjay
Attempts to optimize the use of the main memory(the high
speed portion) with the hard disk (the lower speed portion).
Technique for using the secondary storage to extend the
apparent limited size of the physical memory beyond its
physical size .
 Implemented since the available physical memory will not be
enough to host all the program.
28
Address space and Memory space
 An address used by the programmer is virtual memory , the set
of such address is called address space.
 An address in main memory is location ,the set of such location
is called memory space.
 Example: consider main memory :32k words(k=1024)=2^15 and
auxiliary memory 1024k words=2^20(to address 15 bits of
physical memory and 20 bits of virtual memory is required)
29
.
30
.
 In our example we have 20-bit address of an instruction (to refer
20-bit virtual address) but physical memory addresses are specified
with 15-bits. So a table is needed
to map a virtual address of 20-bits to a physical address of 15-bits.
 Mapping is a dynamic operation, which means that every address is
translated immediately as a word is referenced by CPU.
31
32
.Address Mapping using Pages
Blocks (or page frame): Blocks are the groups of
equal size which are broken down from physical
memory and ranges from 64 to 4096words each.
Pages: refers to a portion of subdivided virtual
memory having same size as blocks i.e. groups
of address space.
33
.
Example: consider computer with address space = 8K and memory space = 4K.
If we spit both spaces into
groups of 1k words we get
8 pages and 4 blocks.
blocks.
34
.
Page Replacement
A virtual memory system is a combination of hardware and
software techniques. A memory management software system
handles:
Which page in main memory should be removed to make
room for a new page?
 When a new page is to be transferred from auxiliary memory
to main memory?
35
.
 Where the page is to be placed in main memory?
There are numerous page replacement algorithms, two of which
are:
1. First-in First-out (FIFO): replaces a page that has been in
memory longest time.
2. Least Recently Used (LRU): assumes that least recently used
page is the better candidate for
removal than the least recently loaded page.
36
.
When a page fault occurs in a virtual memory system, it
signifies that the page referenced by the program is not in
main memory. A new page is then transferred from auxiliary
memory to main memory. If main memory is full, it would be
necessary to remove a page from a memory block to make a
room for a new page. The policy for choosing pages to
remove is determined from the replacement algorithm that is
used.
GOAL: try to remove the page least likely to be referenced by
in the immediate future.
37
Memory Management Hardware
38
Sudesh
Introduction
Collection of hardware and software procedures for managing
various program.
39
Basic component of MMU
 Sharing common program by multiple user
 Protection of information unauthorized
40
Segmented Page Mapping
 Length of each segment allowed to grow and contract according need of
program execution.
 Way of specifying the length of a segment by associating with it a no. of
equal sized page
 Consider diagram below
41
42
In above fig:
Consider
Logical Address=Segment+page+word
segment specifies segment no.
Page field specifies page within the
segment
Word field specifies specific word
within the page
43
44
45
THANK YOU!
46

Más contenido relacionado

La actualidad más candente

Input output organization
Input output organizationInput output organization
Input output organization
abdulugc
 
Cache memory
Cache memoryCache memory
Cache memory
Anuj Modi
 
Virtual memory
Virtual memoryVirtual memory
Virtual memory
Anuj Modi
 

La actualidad más candente (20)

General register organization (computer organization)
General register organization  (computer organization)General register organization  (computer organization)
General register organization (computer organization)
 
Computer architecture instruction formats
Computer architecture instruction formatsComputer architecture instruction formats
Computer architecture instruction formats
 
Input Output Organization
Input Output OrganizationInput Output Organization
Input Output Organization
 
Stack organization
Stack organizationStack organization
Stack organization
 
CISC & RISC Architecture
CISC & RISC Architecture CISC & RISC Architecture
CISC & RISC Architecture
 
Memory organization in computer architecture
Memory organization in computer architectureMemory organization in computer architecture
Memory organization in computer architecture
 
Modes Of Transfer in Input/Output Organization
Modes Of Transfer in Input/Output OrganizationModes Of Transfer in Input/Output Organization
Modes Of Transfer in Input/Output Organization
 
Computer registers
Computer registersComputer registers
Computer registers
 
Pipelining and vector processing
Pipelining and vector processingPipelining and vector processing
Pipelining and vector processing
 
Input output organization
Input output organizationInput output organization
Input output organization
 
Computer Organisation & Architecture (chapter 1)
Computer Organisation & Architecture (chapter 1) Computer Organisation & Architecture (chapter 1)
Computer Organisation & Architecture (chapter 1)
 
Unit 6 interprocessor arbitration
Unit 6 interprocessor arbitrationUnit 6 interprocessor arbitration
Unit 6 interprocessor arbitration
 
Cache memory
Cache memoryCache memory
Cache memory
 
Computer organization
Computer organizationComputer organization
Computer organization
 
Instruction cycle
Instruction cycleInstruction cycle
Instruction cycle
 
Register transfer language
Register transfer languageRegister transfer language
Register transfer language
 
8086 memory segmentation
8086 memory segmentation8086 memory segmentation
8086 memory segmentation
 
Lecture 3 instruction set
Lecture 3  instruction setLecture 3  instruction set
Lecture 3 instruction set
 
Virtual memory
Virtual memoryVirtual memory
Virtual memory
 
Array Processor
Array ProcessorArray Processor
Array Processor
 

Similar a Memory organization (Computer architecture)

Basicarchitecturememory
BasicarchitecturememoryBasicarchitecturememory
Basicarchitecturememory
Aditya Narang
 

Similar a Memory organization (Computer architecture) (20)

Memory Presentation
Memory PresentationMemory Presentation
Memory Presentation
 
Basicarchitecturememory
BasicarchitecturememoryBasicarchitecturememory
Basicarchitecturememory
 
BBA CHAPTER COMPUTER HARDWARE 5 .pptx
BBA CHAPTER COMPUTER HARDWARE    5 .pptxBBA CHAPTER COMPUTER HARDWARE    5 .pptx
BBA CHAPTER COMPUTER HARDWARE 5 .pptx
 
Basic+machine+organization
Basic+machine+organizationBasic+machine+organization
Basic+machine+organization
 
Computer Fundamentals -to upload.pptx
Computer Fundamentals -to upload.pptxComputer Fundamentals -to upload.pptx
Computer Fundamentals -to upload.pptx
 
Computer Hardware
Computer HardwareComputer Hardware
Computer Hardware
 
Presentation on memory
Presentation on memoryPresentation on memory
Presentation on memory
 
Topic 1 - Overview of IT.pdf
Topic 1 - Overview of IT.pdfTopic 1 - Overview of IT.pdf
Topic 1 - Overview of IT.pdf
 
Components of the System Unit.pdf
Components of the System Unit.pdfComponents of the System Unit.pdf
Components of the System Unit.pdf
 
Computer memory and types of memory.pptx
Computer memory and types of memory.pptxComputer memory and types of memory.pptx
Computer memory and types of memory.pptx
 
CIS99_Ch_01 (1).pptx
CIS99_Ch_01 (1).pptxCIS99_Ch_01 (1).pptx
CIS99_Ch_01 (1).pptx
 
3945319.ppt
3945319.ppt3945319.ppt
3945319.ppt
 
3945319.ppt
3945319.ppt3945319.ppt
3945319.ppt
 
Uc13.chapter.02
Uc13.chapter.02Uc13.chapter.02
Uc13.chapter.02
 
Lecture 02 hardware
Lecture 02 hardwareLecture 02 hardware
Lecture 02 hardware
 
Computer Organization
Computer OrganizationComputer Organization
Computer Organization
 
Computer hardware
Computer hardwareComputer hardware
Computer hardware
 
5_6097975312522412493.pptx
5_6097975312522412493.pptx5_6097975312522412493.pptx
5_6097975312522412493.pptx
 
Information processing cycle
Information processing cycleInformation processing cycle
Information processing cycle
 
Computer organisation ppt
Computer organisation pptComputer organisation ppt
Computer organisation ppt
 

Último

Activity 01 - Artificial Culture (1).pdf
Activity 01 - Artificial Culture (1).pdfActivity 01 - Artificial Culture (1).pdf
Activity 01 - Artificial Culture (1).pdf
ciinovamais
 
Vishram Singh - Textbook of Anatomy Upper Limb and Thorax.. Volume 1 (1).pdf
Vishram Singh - Textbook of Anatomy  Upper Limb and Thorax.. Volume 1 (1).pdfVishram Singh - Textbook of Anatomy  Upper Limb and Thorax.. Volume 1 (1).pdf
Vishram Singh - Textbook of Anatomy Upper Limb and Thorax.. Volume 1 (1).pdf
ssuserdda66b
 

Último (20)

Towards a code of practice for AI in AT.pptx
Towards a code of practice for AI in AT.pptxTowards a code of practice for AI in AT.pptx
Towards a code of practice for AI in AT.pptx
 
Basic Civil Engineering first year Notes- Chapter 4 Building.pptx
Basic Civil Engineering first year Notes- Chapter 4 Building.pptxBasic Civil Engineering first year Notes- Chapter 4 Building.pptx
Basic Civil Engineering first year Notes- Chapter 4 Building.pptx
 
Understanding Accommodations and Modifications
Understanding  Accommodations and ModificationsUnderstanding  Accommodations and Modifications
Understanding Accommodations and Modifications
 
How to Manage Global Discount in Odoo 17 POS
How to Manage Global Discount in Odoo 17 POSHow to Manage Global Discount in Odoo 17 POS
How to Manage Global Discount in Odoo 17 POS
 
How to Give a Domain for a Field in Odoo 17
How to Give a Domain for a Field in Odoo 17How to Give a Domain for a Field in Odoo 17
How to Give a Domain for a Field in Odoo 17
 
Explore beautiful and ugly buildings. Mathematics helps us create beautiful d...
Explore beautiful and ugly buildings. Mathematics helps us create beautiful d...Explore beautiful and ugly buildings. Mathematics helps us create beautiful d...
Explore beautiful and ugly buildings. Mathematics helps us create beautiful d...
 
FSB Advising Checklist - Orientation 2024
FSB Advising Checklist - Orientation 2024FSB Advising Checklist - Orientation 2024
FSB Advising Checklist - Orientation 2024
 
Food safety_Challenges food safety laboratories_.pdf
Food safety_Challenges food safety laboratories_.pdfFood safety_Challenges food safety laboratories_.pdf
Food safety_Challenges food safety laboratories_.pdf
 
Python Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docxPython Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docx
 
How to Create and Manage Wizard in Odoo 17
How to Create and Manage Wizard in Odoo 17How to Create and Manage Wizard in Odoo 17
How to Create and Manage Wizard in Odoo 17
 
SOC 101 Demonstration of Learning Presentation
SOC 101 Demonstration of Learning PresentationSOC 101 Demonstration of Learning Presentation
SOC 101 Demonstration of Learning Presentation
 
Mehran University Newsletter Vol-X, Issue-I, 2024
Mehran University Newsletter Vol-X, Issue-I, 2024Mehran University Newsletter Vol-X, Issue-I, 2024
Mehran University Newsletter Vol-X, Issue-I, 2024
 
Dyslexia AI Workshop for Slideshare.pptx
Dyslexia AI Workshop for Slideshare.pptxDyslexia AI Workshop for Slideshare.pptx
Dyslexia AI Workshop for Slideshare.pptx
 
This PowerPoint helps students to consider the concept of infinity.
This PowerPoint helps students to consider the concept of infinity.This PowerPoint helps students to consider the concept of infinity.
This PowerPoint helps students to consider the concept of infinity.
 
Unit-IV; Professional Sales Representative (PSR).pptx
Unit-IV; Professional Sales Representative (PSR).pptxUnit-IV; Professional Sales Representative (PSR).pptx
Unit-IV; Professional Sales Representative (PSR).pptx
 
Activity 01 - Artificial Culture (1).pdf
Activity 01 - Artificial Culture (1).pdfActivity 01 - Artificial Culture (1).pdf
Activity 01 - Artificial Culture (1).pdf
 
Vishram Singh - Textbook of Anatomy Upper Limb and Thorax.. Volume 1 (1).pdf
Vishram Singh - Textbook of Anatomy  Upper Limb and Thorax.. Volume 1 (1).pdfVishram Singh - Textbook of Anatomy  Upper Limb and Thorax.. Volume 1 (1).pdf
Vishram Singh - Textbook of Anatomy Upper Limb and Thorax.. Volume 1 (1).pdf
 
Google Gemini An AI Revolution in Education.pptx
Google Gemini An AI Revolution in Education.pptxGoogle Gemini An AI Revolution in Education.pptx
Google Gemini An AI Revolution in Education.pptx
 
Holdier Curriculum Vitae (April 2024).pdf
Holdier Curriculum Vitae (April 2024).pdfHoldier Curriculum Vitae (April 2024).pdf
Holdier Curriculum Vitae (April 2024).pdf
 
SKILL OF INTRODUCING THE LESSON MICRO SKILLS.pptx
SKILL OF INTRODUCING THE LESSON MICRO SKILLS.pptxSKILL OF INTRODUCING THE LESSON MICRO SKILLS.pptx
SKILL OF INTRODUCING THE LESSON MICRO SKILLS.pptx
 

Memory organization (Computer architecture)

  • 1. MEMORY ORGANIZATION 25.Sandesh Jonchhe 26.Sanjay Bhandari 27.Shiva Ghimire 28.Sudesh Parajuli 29.Sumanti Rajbanshi 1
  • 3. an essential component in any general purpose computer since it is needed to store programs and data. memory unit that communicates directly with the CPU = main memory devices that provide backup storage = auxiliary memory. Auxiliary memory devices are used to store system programs, large data files and other backup information. Only programs and data currently needed by the processor reside in main memory. All other information is stored in main memory and transferred to main memory when needed. Memory Unit3
  • 4. Cache Memory • Memory that lies in between main memory and CPU Holds those parts of the program and data that are most heavily used • increases the overall processing speed of the computer by providing frequently required data to the CPU at a faster speed. 4
  • 5. Main Memory • Memory unit that communicates directly with CPU • Programs and data currently needed by the processor reside here • Also known as primary memory • RAM and ROM 5
  • 6. Auxiliary Memory • Made of devices that provide backup storage • Magnetic tapes, Magnetic disks • At the bottom of the hierarchy are the relatively slow magnetic tapes used to store removable files whereas at the top level, magnetic disks used as backup storage 6
  • 7. • A class of data storage device that read their data in sequence • Are usually a form of magnetic memory • Typically used for secondary storage in general-purpose computers due to their higher density, resistance to wear and non-volatility • Eg: hard disk, CD-ROMs, magnetic tapes etc Sequential Access Memory • Is a form of computer data storage • Allows stored data to be accessed in any order • Associated with volatile types of memory • Type: SRAM and DRAM Random Access Memory Memory Types7
  • 8. • To obtain the highest possible access speed while minimizing the total cost of the memory system • Consists of all storage device in a computer system (auxiliary, cache, main , high speed registers and processing logic) Memory Hierarchy8
  • 9. 9
  • 12. • Basic memory of the computer • Temprorary memory except rom • Faster for read write operation • Expensive internal memory so not portable. RAM • Volatile memory. • Stores information required during processing Two types of random Static Ram(SRAM) and Dynamic Ram(DRAM) Main memory 12
  • 13. • Does not lose its content until computer is turned off • Information is stored in form of voltage • faster • Loses its content after few seconds • Information is stored in the form of charge • slower  SRAM  DRAM TYPES OF RAM13
  • 14. • Permanent memory • Stores information required for computer operations • Types of rom(PROM,EPROM,EEPROM) ROM 14
  • 15. Boot Strap loader  Initial program whose function is to start the computer operating system after the power is turned on. and it is stored in the rom portion of the main memory .  Computer start up :starting the execution of initial program after computer is turned on  Boot strap loader loads the portion of disk to main memory and control is then transferred to os. 15
  • 16. • The most common auxilliary device used in the computer system is magnetic disk and magnetic tape. • Store large amount of data permanantly. • Portable  Types of auxilliary memory  Magnetic disk  Magnetic tape Auxiliary memory(SECONDARY MEMORY) 16
  • 17. • circular plate ,made of metal or plastic coated with magnetize material.High speed of rotation • Bits are store in a concentric circle called tracks. • Division of tracks are called sectors. Magnetic disk17
  • 19.  Sequential access memory used for storing,backup,audio,video data etc .  Highly reliable memory.  Slower for read write operation. Magnetic tape19
  • 21. RAM AND ROM CHIP 21 Shiva
  • 22. RAM AND ROM CHIPS RAM chip: Used for communication with the CPU if one or more control inputs. requires 7-bit address and an 8-bit bidirectional data bus.  chip select (CS) are for enabling the chip. 22
  • 24.  when CS1=1 and (CS2)’=0, the unit in operation.  High impedance state indicates open circuit.  When CS1=1 and (CS2)’=0, the memory is places in a R/W mode.  When the RD input is enabled, the content of the selected byte is placed into the data bus. 24
  • 26. A ROM chip is unidirectional. 9 address lines to address 512 bytes.  chip select CS1=1 and (CS2)’=0 for the unit to operate. Otherwise, the data bus in a high-impedance state. 26
  • 28. Attempts to optimize the use of the main memory(the high speed portion) with the hard disk (the lower speed portion). Technique for using the secondary storage to extend the apparent limited size of the physical memory beyond its physical size .  Implemented since the available physical memory will not be enough to host all the program. 28
  • 29. Address space and Memory space  An address used by the programmer is virtual memory , the set of such address is called address space.  An address in main memory is location ,the set of such location is called memory space.  Example: consider main memory :32k words(k=1024)=2^15 and auxiliary memory 1024k words=2^20(to address 15 bits of physical memory and 20 bits of virtual memory is required) 29
  • 30. . 30
  • 31. .  In our example we have 20-bit address of an instruction (to refer 20-bit virtual address) but physical memory addresses are specified with 15-bits. So a table is needed to map a virtual address of 20-bits to a physical address of 15-bits.  Mapping is a dynamic operation, which means that every address is translated immediately as a word is referenced by CPU. 31
  • 32. 32
  • 33. .Address Mapping using Pages Blocks (or page frame): Blocks are the groups of equal size which are broken down from physical memory and ranges from 64 to 4096words each. Pages: refers to a portion of subdivided virtual memory having same size as blocks i.e. groups of address space. 33
  • 34. . Example: consider computer with address space = 8K and memory space = 4K. If we spit both spaces into groups of 1k words we get 8 pages and 4 blocks. blocks. 34
  • 35. . Page Replacement A virtual memory system is a combination of hardware and software techniques. A memory management software system handles: Which page in main memory should be removed to make room for a new page?  When a new page is to be transferred from auxiliary memory to main memory? 35
  • 36. .  Where the page is to be placed in main memory? There are numerous page replacement algorithms, two of which are: 1. First-in First-out (FIFO): replaces a page that has been in memory longest time. 2. Least Recently Used (LRU): assumes that least recently used page is the better candidate for removal than the least recently loaded page. 36
  • 37. . When a page fault occurs in a virtual memory system, it signifies that the page referenced by the program is not in main memory. A new page is then transferred from auxiliary memory to main memory. If main memory is full, it would be necessary to remove a page from a memory block to make a room for a new page. The policy for choosing pages to remove is determined from the replacement algorithm that is used. GOAL: try to remove the page least likely to be referenced by in the immediate future. 37
  • 39. Introduction Collection of hardware and software procedures for managing various program. 39
  • 40. Basic component of MMU  Sharing common program by multiple user  Protection of information unauthorized 40
  • 41. Segmented Page Mapping  Length of each segment allowed to grow and contract according need of program execution.  Way of specifying the length of a segment by associating with it a no. of equal sized page  Consider diagram below 41
  • 42. 42
  • 43. In above fig: Consider Logical Address=Segment+page+word segment specifies segment no. Page field specifies page within the segment Word field specifies specific word within the page 43
  • 44. 44
  • 45. 45