SlideShare ist ein Scribd-Unternehmen logo
1 von 18
Addressability
Memory
11110011
Address
00000000
00000001
00000010
00000011
00000100
00000101
00000110
00000111
00001000
00001001
Each memory location has to
have an address
Each address is a unique
identifier for that specific
memory location
The way in which the computer
identifies memory locations is
known as addressability
Memory locations
Memory Address
0
1
The width of the address bus determines
how many memory locations can be
addressed
A 1 bit address bus can access 2 memory
locations
Processor
1 Bit
Address Bus
Memory locations
Memory Address
10
11
The width of the address bus determines
how many memory locations can be
addressed
A 2 bit address bus can access 4 memory
locations
Processor
00
012 Bit
Address Bus
Memory locations
Memory Address
110
111
The width of the address bus determines
how many memory locations can be
addressed
A 3 bit address bus can access 8 memory
locations
Processor
100
101
010
011
000
0013 Bit
Address Bus
Memory locations
How many memory locations could a computer with an 8 bit address bus
access?
How many memory locations could a computer with an 16 bit address bus
access?
How many memory locations could a computer with an 32 bit address bus
access?
Memory locations
How many memory locations could a computer with an 8 bit address bus
access?
28
= 256 memory locations
How many memory locations could a computer with an 16 bit address bus
access?
How many memory locations could a computer with an 32 bit address bus
access?
Memory locations
How many memory locations could a computer with an 8 bit address bus
access?
28
= 256 memory locations
How many memory locations could a computer with an 16 bit address bus
access?
216
= 65,536 memory locations
How many memory locations could a computer with an 32 bit address bus
access?
Memory locations
How many memory locations could a computer with an 8 bit address bus
access?
28
= 256 memory locations
How many memory locations could a computer with an 16 bit address bus
access?
216
= 65,536 memory locations
How many memory locations could a computer with an 32 bit address bus
access?
232
= 4,294,967,296 memory locations
Calculating addressable memory
If a computer has an 3 bit address bus, we know that it has 23
= 8 memory locations
But how much actual memory is that?
Memory Address
110
111
Processor
100
101
010
011
000
0013 Bit
Address Bus
Calculating addressable memory
In order to answer that question, we need to know how many bits can be
stored in each memory location.
This is determined by the width of the data bus.
Memory Address
110
111
Processor
100
101
010
011
000
0013 Bit
Address Bus
Data Bus
Calculating addressable memory
A computer with a data bus 2 bits wide would store 2 bits in each memory
location.
Memory Address
110
111
Processor
100
101
00
00
11
00
10
11
01
01
010
011
000
0013 Bit
Address Bus
2 Bit
Data Bus
Calculating addressable memory
Therefore, a computer with a 2 bit data bus and a 3 bit address bus would
have an addressable memory of
8 x 2 = 16 bits
= 2 bytes
Memory Address
110
111
Processor
100
101
00
00
11
00
10
11
01
01
010
011
000
0013 Bit
Address Bus
2 Bit
Data Bus
Calculating addressable memory
Total addressable memory =
the number of storage locations x the size of each storage location
Calculating addressable memory
Example:
Calculate the total addressable memory of a computer with a 16 bit address
bus and an 8 bit data bus.
Calculating addressable memory
Example:
Calculate the total addressable memory of a computer with a 16 bit address
bus and an 8 bit data bus.
addressable memory =
Number of storage locations x the size of each location
= 216
bits x 8 bits
Calculating addressable memory
Example:
Calculate the total addressable memory of a computer with a 16 bit address
bus and an 8 bit data bus.
addressable memory =
Number of storage locations x the size of each location
= 216
x 8 bits
= 65536 x 1 byte
= 65536 bytes
= 64 kb
Credits
Higher Computing – Computer Structure – Addressability
Produced by M. Cunningham for the City of Edinburgh Council 2010
All images licenced under Creative Commons 3.0
• Metropolitan Vickers, Trafford Park stationery by sludgegulper on Flickr
• Calculator Dreams by Keith Ramsey (RambergMediaImages on Flickr)

Weitere ähnliche Inhalte

Was ist angesagt?

Unix memory management
Unix memory managementUnix memory management
Unix memory management
Tech_MX
 
File management
File managementFile management
File management
Mohd Arif
 

Was ist angesagt? (20)

Unix ppt
Unix pptUnix ppt
Unix ppt
 
Modern operating system.......
Modern operating system.......Modern operating system.......
Modern operating system.......
 
Backup and recovery
Backup and recoveryBackup and recovery
Backup and recovery
 
Threads (operating System)
Threads (operating System)Threads (operating System)
Threads (operating System)
 
Virtual memory ppt
Virtual memory pptVirtual memory ppt
Virtual memory ppt
 
Memory Management in OS
Memory Management in OSMemory Management in OS
Memory Management in OS
 
Development of Mobile Application -PPT
Development of Mobile Application -PPTDevelopment of Mobile Application -PPT
Development of Mobile Application -PPT
 
Windows V/S Linux OS - Comparison
Windows V/S Linux OS - ComparisonWindows V/S Linux OS - Comparison
Windows V/S Linux OS - Comparison
 
Von Neumann Architecture
Von Neumann ArchitectureVon Neumann Architecture
Von Neumann Architecture
 
Multimedia database
Multimedia databaseMultimedia database
Multimedia database
 
Opetating System Memory management
Opetating System Memory managementOpetating System Memory management
Opetating System Memory management
 
Android app ppt
Android app pptAndroid app ppt
Android app ppt
 
Unix memory management
Unix memory managementUnix memory management
Unix memory management
 
DBMS
DBMSDBMS
DBMS
 
File system
File systemFile system
File system
 
Centralised and distributed databases
Centralised and distributed databasesCentralised and distributed databases
Centralised and distributed databases
 
Disk management
Disk managementDisk management
Disk management
 
Operating system; Multitasking
Operating system; MultitaskingOperating system; Multitasking
Operating system; Multitasking
 
File management
File managementFile management
File management
 
An Introduction to Open Source Software and Web Application Development
An Introduction to Open Source Software and Web Application DevelopmentAn Introduction to Open Source Software and Web Application Development
An Introduction to Open Source Software and Web Application Development
 

Ähnlich wie Addressability

Chp3 designing bus system, memory & io copy
Chp3 designing bus system, memory & io   copyChp3 designing bus system, memory & io   copy
Chp3 designing bus system, memory & io copy
mkazree
 
02 the cpu
02 the cpu02 the cpu
02 the cpu
Jim Finn
 
Computer Structure Slides
Computer Structure SlidesComputer Structure Slides
Computer Structure Slides
iarthur
 
memeoryorganization PPT for organization of memories
memeoryorganization PPT for organization of memoriesmemeoryorganization PPT for organization of memories
memeoryorganization PPT for organization of memories
GauravDaware2
 
Topic 1 Data Representation
Topic 1 Data RepresentationTopic 1 Data Representation
Topic 1 Data Representation
Naruin
 

Ähnlich wie Addressability (20)

Buses
BusesBuses
Buses
 
Microprocessor Part 1
Microprocessor    Part 1Microprocessor    Part 1
Microprocessor Part 1
 
Chp3 designing bus system, memory & io copy
Chp3 designing bus system, memory & io   copyChp3 designing bus system, memory & io   copy
Chp3 designing bus system, memory & io copy
 
Session01_Intro.pdf
Session01_Intro.pdfSession01_Intro.pdf
Session01_Intro.pdf
 
National 5 Computing Science - Buses
National 5 Computing Science - BusesNational 5 Computing Science - Buses
National 5 Computing Science - Buses
 
02 the cpu
02 the cpu02 the cpu
02 the cpu
 
Register & Memory
Register & MemoryRegister & Memory
Register & Memory
 
CST-20363-Session 1-In the Bitginning
CST-20363-Session 1-In the BitginningCST-20363-Session 1-In the Bitginning
CST-20363-Session 1-In the Bitginning
 
cashe introduction, and heirarchy basics
cashe introduction, and heirarchy basicscashe introduction, and heirarchy basics
cashe introduction, and heirarchy basics
 
8086 architecture
8086 architecture8086 architecture
8086 architecture
 
Bt0068 computer organization and architecture
Bt0068 computer organization and architecture Bt0068 computer organization and architecture
Bt0068 computer organization and architecture
 
Memory Organization
Memory OrganizationMemory Organization
Memory Organization
 
Computer Structure Slides
Computer Structure SlidesComputer Structure Slides
Computer Structure Slides
 
Bits and bytes
Bits and bytesBits and bytes
Bits and bytes
 
memeoryorganization PPT for organization of memories
memeoryorganization PPT for organization of memoriesmemeoryorganization PPT for organization of memories
memeoryorganization PPT for organization of memories
 
Computer structurepowerpoint
Computer structurepowerpointComputer structurepowerpoint
Computer structurepowerpoint
 
8085 Microprocessor - Ramesh Gaonkar.pdf-27 (1).pptx
8085 Microprocessor - Ramesh Gaonkar.pdf-27 (1).pptx8085 Microprocessor - Ramesh Gaonkar.pdf-27 (1).pptx
8085 Microprocessor - Ramesh Gaonkar.pdf-27 (1).pptx
 
901320_Main Memory.ppt
901320_Main Memory.ppt901320_Main Memory.ppt
901320_Main Memory.ppt
 
Computer data representation (integers, floating-point numbers, text, images,...
Computer data representation (integers, floating-point numbers, text, images,...Computer data representation (integers, floating-point numbers, text, images,...
Computer data representation (integers, floating-point numbers, text, images,...
 
Topic 1 Data Representation
Topic 1 Data RepresentationTopic 1 Data Representation
Topic 1 Data Representation
 

Mehr von Forrester High School

Mehr von Forrester High School (20)

Program Design
Program DesignProgram Design
Program Design
 
Database Evaluation
Database EvaluationDatabase Evaluation
Database Evaluation
 
Testing SQL
Testing SQLTesting SQL
Testing SQL
 
SQL
SQLSQL
SQL
 
Database Query Design
Database Query DesignDatabase Query Design
Database Query Design
 
Data Dictionary
Data DictionaryData Dictionary
Data Dictionary
 
Compound Keys
Compound KeysCompound Keys
Compound Keys
 
Entity Occurrence Diagrams
Entity Occurrence DiagramsEntity Occurrence Diagrams
Entity Occurrence Diagrams
 
Entity Relationship Diagrams
Entity Relationship DiagramsEntity Relationship Diagrams
Entity Relationship Diagrams
 
Database Analysis
Database AnalysisDatabase Analysis
Database Analysis
 
Software Evaluation
Software EvaluationSoftware Evaluation
Software Evaluation
 
Software Testing
Software TestingSoftware Testing
Software Testing
 
Standard Algorithms
Standard AlgorithmsStandard Algorithms
Standard Algorithms
 
File Handling
File HandlingFile Handling
File Handling
 
Python Predefined Functions
Python Predefined FunctionsPython Predefined Functions
Python Predefined Functions
 
Python Substrings
Python SubstringsPython Substrings
Python Substrings
 
Variable Scope
Variable ScopeVariable Scope
Variable Scope
 
Sub-programs
Sub-programsSub-programs
Sub-programs
 
Records in Python
Records in PythonRecords in Python
Records in Python
 
Parallel arrays in python
Parallel arrays in pythonParallel arrays in python
Parallel arrays in python
 

Kürzlich hochgeladen

The basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptxThe basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptx
heathfieldcps1
 
Beyond the EU: DORA and NIS 2 Directive's Global Impact
Beyond the EU: DORA and NIS 2 Directive's Global ImpactBeyond the EU: DORA and NIS 2 Directive's Global Impact
Beyond the EU: DORA and NIS 2 Directive's Global Impact
PECB
 
Gardella_PRCampaignConclusion Pitch Letter
Gardella_PRCampaignConclusion Pitch LetterGardella_PRCampaignConclusion Pitch Letter
Gardella_PRCampaignConclusion Pitch Letter
MateoGardella
 
An Overview of Mutual Funds Bcom Project.pdf
An Overview of Mutual Funds Bcom Project.pdfAn Overview of Mutual Funds Bcom Project.pdf
An Overview of Mutual Funds Bcom Project.pdf
SanaAli374401
 

Kürzlich hochgeladen (20)

The basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptxThe basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptx
 
Z Score,T Score, Percential Rank and Box Plot Graph
Z Score,T Score, Percential Rank and Box Plot GraphZ Score,T Score, Percential Rank and Box Plot Graph
Z Score,T Score, Percential Rank and Box Plot Graph
 
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
 
Beyond the EU: DORA and NIS 2 Directive's Global Impact
Beyond the EU: DORA and NIS 2 Directive's Global ImpactBeyond the EU: DORA and NIS 2 Directive's Global Impact
Beyond the EU: DORA and NIS 2 Directive's Global Impact
 
APM Welcome, APM North West Network Conference, Synergies Across Sectors
APM Welcome, APM North West Network Conference, Synergies Across SectorsAPM Welcome, APM North West Network Conference, Synergies Across Sectors
APM Welcome, APM North West Network Conference, Synergies Across Sectors
 
Measures of Dispersion and Variability: Range, QD, AD and SD
Measures of Dispersion and Variability: Range, QD, AD and SDMeasures of Dispersion and Variability: Range, QD, AD and SD
Measures of Dispersion and Variability: Range, QD, AD and SD
 
Class 11th Physics NEET formula sheet pdf
Class 11th Physics NEET formula sheet pdfClass 11th Physics NEET formula sheet pdf
Class 11th Physics NEET formula sheet pdf
 
Mattingly "AI & Prompt Design: The Basics of Prompt Design"
Mattingly "AI & Prompt Design: The Basics of Prompt Design"Mattingly "AI & Prompt Design: The Basics of Prompt Design"
Mattingly "AI & Prompt Design: The Basics of Prompt Design"
 
PROCESS RECORDING FORMAT.docx
PROCESS      RECORDING        FORMAT.docxPROCESS      RECORDING        FORMAT.docx
PROCESS RECORDING FORMAT.docx
 
INDIA QUIZ 2024 RLAC DELHI UNIVERSITY.pptx
INDIA QUIZ 2024 RLAC DELHI UNIVERSITY.pptxINDIA QUIZ 2024 RLAC DELHI UNIVERSITY.pptx
INDIA QUIZ 2024 RLAC DELHI UNIVERSITY.pptx
 
Web & Social Media Analytics Previous Year Question Paper.pdf
Web & Social Media Analytics Previous Year Question Paper.pdfWeb & Social Media Analytics Previous Year Question Paper.pdf
Web & Social Media Analytics Previous Year Question Paper.pdf
 
psychiatric nursing HISTORY COLLECTION .docx
psychiatric  nursing HISTORY  COLLECTION  .docxpsychiatric  nursing HISTORY  COLLECTION  .docx
psychiatric nursing HISTORY COLLECTION .docx
 
Holdier Curriculum Vitae (April 2024).pdf
Holdier Curriculum Vitae (April 2024).pdfHoldier Curriculum Vitae (April 2024).pdf
Holdier Curriculum Vitae (April 2024).pdf
 
Gardella_PRCampaignConclusion Pitch Letter
Gardella_PRCampaignConclusion Pitch LetterGardella_PRCampaignConclusion Pitch Letter
Gardella_PRCampaignConclusion Pitch Letter
 
microwave assisted reaction. General introduction
microwave assisted reaction. General introductionmicrowave assisted reaction. General introduction
microwave assisted reaction. General introduction
 
Sports & Fitness Value Added Course FY..
Sports & Fitness Value Added Course FY..Sports & Fitness Value Added Course FY..
Sports & Fitness Value Added Course FY..
 
Grant Readiness 101 TechSoup and Remy Consulting
Grant Readiness 101 TechSoup and Remy ConsultingGrant Readiness 101 TechSoup and Remy Consulting
Grant Readiness 101 TechSoup and Remy Consulting
 
An Overview of Mutual Funds Bcom Project.pdf
An Overview of Mutual Funds Bcom Project.pdfAn Overview of Mutual Funds Bcom Project.pdf
An Overview of Mutual Funds Bcom Project.pdf
 
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
 
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...
 

Addressability

  • 1.
  • 2. Addressability Memory 11110011 Address 00000000 00000001 00000010 00000011 00000100 00000101 00000110 00000111 00001000 00001001 Each memory location has to have an address Each address is a unique identifier for that specific memory location The way in which the computer identifies memory locations is known as addressability
  • 3. Memory locations Memory Address 0 1 The width of the address bus determines how many memory locations can be addressed A 1 bit address bus can access 2 memory locations Processor 1 Bit Address Bus
  • 4. Memory locations Memory Address 10 11 The width of the address bus determines how many memory locations can be addressed A 2 bit address bus can access 4 memory locations Processor 00 012 Bit Address Bus
  • 5. Memory locations Memory Address 110 111 The width of the address bus determines how many memory locations can be addressed A 3 bit address bus can access 8 memory locations Processor 100 101 010 011 000 0013 Bit Address Bus
  • 6. Memory locations How many memory locations could a computer with an 8 bit address bus access? How many memory locations could a computer with an 16 bit address bus access? How many memory locations could a computer with an 32 bit address bus access?
  • 7. Memory locations How many memory locations could a computer with an 8 bit address bus access? 28 = 256 memory locations How many memory locations could a computer with an 16 bit address bus access? How many memory locations could a computer with an 32 bit address bus access?
  • 8. Memory locations How many memory locations could a computer with an 8 bit address bus access? 28 = 256 memory locations How many memory locations could a computer with an 16 bit address bus access? 216 = 65,536 memory locations How many memory locations could a computer with an 32 bit address bus access?
  • 9. Memory locations How many memory locations could a computer with an 8 bit address bus access? 28 = 256 memory locations How many memory locations could a computer with an 16 bit address bus access? 216 = 65,536 memory locations How many memory locations could a computer with an 32 bit address bus access? 232 = 4,294,967,296 memory locations
  • 10. Calculating addressable memory If a computer has an 3 bit address bus, we know that it has 23 = 8 memory locations But how much actual memory is that? Memory Address 110 111 Processor 100 101 010 011 000 0013 Bit Address Bus
  • 11. Calculating addressable memory In order to answer that question, we need to know how many bits can be stored in each memory location. This is determined by the width of the data bus. Memory Address 110 111 Processor 100 101 010 011 000 0013 Bit Address Bus Data Bus
  • 12. Calculating addressable memory A computer with a data bus 2 bits wide would store 2 bits in each memory location. Memory Address 110 111 Processor 100 101 00 00 11 00 10 11 01 01 010 011 000 0013 Bit Address Bus 2 Bit Data Bus
  • 13. Calculating addressable memory Therefore, a computer with a 2 bit data bus and a 3 bit address bus would have an addressable memory of 8 x 2 = 16 bits = 2 bytes Memory Address 110 111 Processor 100 101 00 00 11 00 10 11 01 01 010 011 000 0013 Bit Address Bus 2 Bit Data Bus
  • 14. Calculating addressable memory Total addressable memory = the number of storage locations x the size of each storage location
  • 15. Calculating addressable memory Example: Calculate the total addressable memory of a computer with a 16 bit address bus and an 8 bit data bus.
  • 16. Calculating addressable memory Example: Calculate the total addressable memory of a computer with a 16 bit address bus and an 8 bit data bus. addressable memory = Number of storage locations x the size of each location = 216 bits x 8 bits
  • 17. Calculating addressable memory Example: Calculate the total addressable memory of a computer with a 16 bit address bus and an 8 bit data bus. addressable memory = Number of storage locations x the size of each location = 216 x 8 bits = 65536 x 1 byte = 65536 bytes = 64 kb
  • 18. Credits Higher Computing – Computer Structure – Addressability Produced by M. Cunningham for the City of Edinburgh Council 2010 All images licenced under Creative Commons 3.0 • Metropolitan Vickers, Trafford Park stationery by sludgegulper on Flickr • Calculator Dreams by Keith Ramsey (RambergMediaImages on Flickr)