SlideShare a Scribd company logo
1 of 40
Download to read offline
Unit 2
PROCESSOR AND
MEMORY ORGANIZATION
By,
Mrs. Pavithra S
Asst. Prof.
GSSSIETW, Mysuru
Karnataka
Contents
1. Structural Units in a Processor
2. Processor selection for an Embedded System
3. Memory Devices
4. Memory Selection for an Embedded System
5. Allocation of memory to Program segments &
Blocks and Memory map of a system
6. Direct Memory Access
7. Interfacing Processor
8. Memories and Input Output Devices
Structural Units in a Processor
Structural Unit Functions
MAR – Memory
Address Register
• holds address of byte/word to be fetched from external memory.
• processor issues the address of instruction or data to MAR
before it initiates fetch cycle.
MDR – Memory
Data Register
• holds a byte/word fetched (to be sent) from (to) an external
memory / IO address.
System Buses
1. Internal Bus
2. Address Bus
3. Data Bus
4. Control Bus
• internally connects all the structural units inside the processor
(width – 8,18, 32, 48 or 64 bits)
• external bus that carries address from MAR to memory as well
as to IO devices & other units of system.
• external bus that carries, during read/write operation, the bytes
for instruction/data from/to an address. (determined by MAR)
• external set of signals to carry control signal to
processor/memory/device
BIU – Bus Interface Unit • interface unit between processor’s internal units &
external buses
IR – Instruction Register • sequentially takes instruction codes (opcode) to
execution unit of processor.
ID – Instruction Decoder • decodes the instruction received at the IR & passes it to
processor CU.
CU – Control Unit • controls all the bus activities & unit functions needed for
processing.
ARS – Application Register
Set
• set of on-chip registers used during processing of
instruction of an application program or
• a register window
• a subset of registers with each subset storing static
variables of a software routine
• a register file associated to a unit (ALU/FPLU)
ALU – Arithmetic Logic Unit • unit to execute arithmetic/logical instruction according to
current instruction present at IR.
PC – Program Counter • generates an instruction cycle by sending the address
defined by it to memory through MAR
• auto increments as the instructions are fetched regularly
& sequentially
• called as instruction pointer in 80x86 processors
SP – Stack Pointer • pointer for an address which corresponds to a stack top in
memory.
IQ – Instruction
Queue
• queue of instructions so that IR does nit have to wait for next
instruction
PFCU – Pre-fetch
Control Unit
• unit that controls the fetching of data into I- & D- caches in
advance from memory units.
• improve performance by fetching instructions and data in
advance for processing.
I- Cache – Instruction
Cache
• sequentially stores (like instruction queue) instructions in FIFO
mode.
• lets the processor execute instructions at greater speed using
PFCU.
D- Cache –
Data Cache
• stores pre-fetch data from external memory.
• stores both key and value together at a location.
• also stores write-through data when configured.
BT- Cache – Branch
Target Cache
• facilitate ready availability of the next instruction-set when a
branch instruction like JUMP/LOOP/CALL is encountered.
MMU – Memory
Management Unit
• manages the memories such that the instructions and date are
readily available for processing.
SRS – System
Register Set
• set of registers used while processing the instructions of the
supervisory system program.
FLPU – Floating Point
Processing Set
• separate unit from ALU for floating point processing
which is essential in processing mathematical function
fast in a microprocessor/DSP
FRS – Floating point Register
Set
• register set dedicated for storing floating point
numbers in a standard format and used by FLPU for its
data & stack.
MAC – Multiply and
Accumulate unit
• units for multiplying coefficients of a series and
accumulating these during computations.
AOU – Atomic Operation
Unit
• it lets a user/compiler instructions when broken into
a number of processor instructions called atomic
operations, finish before an interrupt of a process
occurs.
• it prevents problems from arising out of shared data
between various routines and tasks.
Organisation of various structural units of processor
Units shown with dashed boundary are present in the high performance processors only
Features in most processors
1. Instruction CycleTime:
◦ It’s the time taken by a processor to execute a simple instruction ( ˜1µs
for 8051- ˜1.6ns for MPC604 )
◦ System designer uses as an indicator to match the processor speed with
application
2. Internal BusWidth:
◦ ALU gets inputs through internal buses
◦ 32 bit bus to facilitate the availability of arithmetic operations on 32-bit
operands in a single cycle
◦ 32-bit bus – a necessity for signal processing and control system instructions
3. Program-Counter (PC) bits & Reset value:
◦ Number of PC bits decides maximum possible size of physical memory that
can be accessed by the processor
◦ Reset value tells the designer the initial program address from where the
program runs on a system reset/power up
4. Stack-Pointer bits & initial reset value
◦ SP values must point to addresses of the words stored at
stack
◦ Software designer defines an initial reset value & sets the
beginning SP accordingly
5. Interrupt Controller
◦ To program the service routine priorities and to allocate
vector addresses
6. Direct Memory Access (DMA) controller with
multiple channels
◦ More number of I/O devices needs to access a multi byte data
set faster, DMA is useful.
Features in most processors
PROCESSOR SELECTION
Processor specific feature:
1. Should operate at higher clock speed for processing more
instructions per second.
2. High computing performance when there exist
◦ (a) Pipeline(s) and superscalar architectures,
◦ (b) pre-fetch cache unit, caches, and register-files and MMU and
(c) RISC architecture.
3. Register-windows provides fast context switching in a
multitasking system.
4. Power-efficient embedded system requires a processor
that has auto-shut down feature for its units and
programmability for the disabling use of caches when the
processing need for a function or instruction set is not
constrained by limit or execution time. Uses Stop, Sleep
and Wait instructions, also require special cache design.
Processor specific feature:
5. Burst mode accesses external memories fast, reads
fast and writes fast.
6. Atomic operation unit provides hardware solution to
shared data problem when designing embedded
software, else special programming skill and efforts
are to be made when sharing the variables among the
multiple tasks.
7. Big-endian (MSB to lowest address) or Little-endian
(LSB to lowest address)
8. Energy efficient
Case Studies:
 Case-1
◦ Systems in which processor instruction cycle time
is ˜1µs and on-chip devices & memory can suffice.
◦ Examples:Automatic chocolate vending machine,
robots, data acquisition systems
 Case-2
◦ Systems in which processor instruction cycle
time is ˜10 to 40ns and on-chip devices &
memory do not suffice and medium processor
performance required.
◦ Examples: 2Mbps router, image processing, voice data
acquisition, voice compression
Case Studies:
 Case-3
◦ Systems in which instruction cycle time is 5 to 10ns
required and high MIPS/MFLOPS performance needed.
◦ Examples: Multiport 100Mbps network transceiver, fast
100Mbps switches, router
 Case-4
◦ Systems in which instruction cycle time of even1ns
does not suffice and multi-processor system is required
along with use of floating point & MAC unit.
◦ Examples:Voice processing,Video processing, Real-time
audio/video processing
MEMORY DEVICES
 A simple credit-debit transaction card may
require just 2kB of memory.
◦ On other hand, smart card for secure transactions
(cryptographic functions) require 32kB of memory.
 A memory- a data byte, or a word, or a double
word, or a quad word may be accessed from
all addressable locations with a similar process
and there is would be equal access time for
a read or for a write operation.
ROM : Uses, Forms &Variants
 Non-Volatility is an important asset useful to
embed codes & data in a system.
 ROM embeds software/application logic circuit in
either forms – Masked ROM, PROM &
EPROM.
 During runtime programming EEPROM/Flash
memory is used.
Masked ROM
 One time masking charge – very high
 Therefore, system manufacturer will
place order & manufacturing foundry will
accept the order for a minimum of 1000
pieces.
 ROM is a cost effective solution to a bulk
user.
EPROM, EEPROM and OTP ROM
 EPROM:
◦ It is an ultraviolet ray erasable & device
programmable.
◦ Erasing means restoring 1 at each bit.
 EEPROM:
◦ Electrically Erasable and Programmable Read Only
Memory
 Flash Memory:
◦ Form of EEPROM, in which sector of bytes can be
erased in a flash.
 PROM:
◦ Once written is not erasable.
◦ OTP (One Time device Programmer)
RAM – Random Access Memory
 A system designer considers RAM devices of EIGHT
forms.
1. SRAM – Static RAM,
2. DRAM – Dynamic RAM,
3. NVRAM – NonVolatile RAM,
4. EDORAM – Extended Data Output RAM,
5. SDRAM – Synchronous DRAM,
6. RDRAM – Rambus DRAM,
7. Parameterized distributed RAM and
8. Parameterized Block RAM.
USES:
 Stores variables during a program run & stores stack.
 Stores input & output buffers.
◦ Eg: Speech & Image
1. SRAM: commonly used for designing caches &
in embedded systems and microcontrollers.
2. DRAM: mostly used in high performance
computers / high memory density systems.
3. EDORAM: used for system having buses with
clock rates up to 100MHz.
4. SDRAM: synchronizes read operations &
keeps next word ready, used for processor
speed of 1GHz.
5. RDRAM: accesses in burst (four successive
words in a single fetch), thus performance
1GHz speed.
6. Parameterized distributed RAM:
distributes in various system sub-units -
IO buffers & transceiver sub-units.
Distribution buffering of memory &
facilitates faster inputs from IO devices.
7. Parameterized Block RAM: used when
specific block of RAM is dedicated to sub-
unit (eg: MAC unit), used when access by
the system / IO / Internal bus is slow
compared to processing speed of sub-unit.
Summary of Memory
 Masked ROM/EPROM/Flash stores embedded software
(ROM image). Masked ROM is for bulk manufacturing.
 EPROM / EEPROM is used for testing & design stages.
 EEPROM is used to store the results during program
runtime (erased byte-by-byte and written during
system run).
 Flash is useful when a processed image /voice /data
/system configuration has to be stored.
 RAM is mostly used in SRAM form
Memory Selection for an
Embedded System
 Once Software designer’s coding is over and the
ROM image file is ready, a hardware designer is faced
with the questions, of what type of memory and what
size of each should be used.
 CASE STUDIES:
1. Automatic chocolate vending machine or real time
robotic control system.
2. Data Acquisition Systems
3. Multi-pot network transceivers, Fast switches, Routers,
or Multi-channel Fast Encryption and decryption System
4. Voice processor or video processing or Mobile Phone
system
5. Digital Camera orVideo recorder system.
Allocation of MemoryTo
Program Segments and Blocks
 Functions, Processes, Data and Stacks at theVarious
Segments of Memory:
◦ Program routines & processes can have different
segments.
◦ A pointer address, points to the start of memory block
storing a segment and an offset value is used to retrieve
for a memory address within that segment.
 Segment wise memory allocation in four segments:
Code, Data, Stack and Extra
(for examples, image, String)
Segments and Paging at the Memory
 A segment can have partitions of fixed
sizes called PAGES.
◦ Figure shows different segment types required
by software designer.
Each Segment has a starting and
ending memory address.
Each Segment has a pointer and
an offset address.
Using offset, code / data is
retrieved from a segment
Different Data Structures/Sets at
Various Memory Blocks
1) Stacks –
• allotted memory
block, from which
data is read (LIFO)
• Return addresses on
the nested calls,
• Sets of LIFO (Last In
First Out)
retrievable data,
• Saved Contexts of
the tasks as the
stacks
2) Arrays – One dimensional or multidimensional
data can be retrieved from any element
address.
3) Queues – Sets of FIFO (First In First Out)
retrievable data;Two pointer (Front/Head & Back/Tail)
Circular Queue (Example- a Printer Buffer);
bounded memory block, on exceeding limit reset to start.
PIPE / Block Queue (Example- a network stack)
common memory block allotted for a queue with source &
destination.
For Circular Queue, when back attempts
To exceed end, back becomes equal to start.
4) Table – two dimensional array (matrix)
three pointers – table base, column index, destination index pointer
5) HashTable – collection of pairs of key &
corresponding value.
data set allocated with a memory block - Look-up-table
6) List – a data structure with number of memory
blocks, one for each element.
each list-element stores pointer to next element
last element points to NULL
A list is for non-consecutively located objects
at the memory.
The Memory Maps
Fig (a) - Princeton
and
Fig (b) - Harvard
Memory
Organizations
The Memory Maps
 Memory areas needed in the case of Princeton
and Harvard architecture are different and as
shown
◦ Vectors and pointers, variables, program segments
and memory blocks for data and stacks have different
addresses in the program – PRINCETON memory
architecture.
◦ Program segments and memory blocks for data and
stacks have separate sets of addresses in Harvard
architecture. Control signals and read-write
instructions are also separate.
 Designer must remember that if main memory is
of Harvard architecture, program memory map
will be separate.
Memory Map
 Map to show the program and data
allocation of the addresses to ROM, RAM,
EEPROM or Flash in the system
Fig: Memory map for an
exemplary embedded
system,
smart card needing
2 kB memory
Direct Memory Access
 A DMA is required when a multi-byte data set or a
burst of data or a block of data is to be transferred
between the external device and system or two
systems.
 A device facilitates DMA transfer with a processing
element (single purpose processor) and that device is
called DMAC (DMA Controller).
 Three modes of DMA operations:
◦ Single transfer at a time and then release of the hold on
the system bus.
◦ Burst transfer at a time and then release of the hold on
the system bus.A burst may be of a few kB.
◦ Bulk transfer and then release of the hold on the system
bus after the transfer is completed.
DMAC - DMA Controller
 Data transfer occurs efficiently between I/O
devices and system memory with the least
processor intervention using DMAC.
 DMAC provide memory access to Multiple
channels
◦ Separate set of registers for programming each
channel.
◦ Separate interrupt signals in the case of a multi-
channel DMAC
 Provides DMA action from system memories
and two (or more IO) devices.
DMA Controller with the buses &
control signals in between
Figure shows the buses and control signals between processor, Memory,
DMAC and the data transferring I/O devices.
DMA Controller Execution
 DMA proceeds without the CPU intervening
◦ Except
(i) at the start for DMAC programming and
initializing and
(ii) at the end.
◦ Whenever a DMA request by external device is
made to the DMAC, the CPU is requested (using
interrupt signal) the DMA transfer by DMAC at
the start to initiate the DMA and at the end to
notify (using interrupt signal) the end of the
DMA by DMAC.
Interfacing Processor, Memories
& Input Output Devices
 Interconnections for a simple bus structure has three sets
of signals – data, address and control signals.
 A system-bus interfacing-design is according to the timing
diagrams of processor signals, speed and word length for
instructions and data.
 Interfacing of processor, memory and IO devices using
memory system bus
Time division multiplexed (TDM)
address and data bits for the memories
 TDM ─ Different time slots, there is a different sets
(channel) of the signals.
 Address signals during one time slot and
data bus signals in another time slot.
 Interfacing circuit for the demultiplexing of the buses
uses a control signal.
 Control signal - Address Latch Enable (ALE) in 8051,
Address Strobe (AS) in 68HC11 and address valid
(ADV) in 80196.
 ALE or AS or ADV demultiplexes the address and data
buses to the devices
Interfacing circuit using Latch and
decoders
 ALE for latching the address
 PSEN (Program Store ENable) for program
memory read using address data buses
 Each chip of the memory or port that
connects the processor has a separate chip
select input from a decoder.
 Decoder is a circuit, which has appropriate
signals of the address bus at the input and
control circuit signals to generate
corresponding CS (chip select) control
signals for each device (memory and ports)
Summary: Interfacing- circuit
 Consists of latches, decoders and demultiplexers
 Designed as per available control signals and
timing diagrams of the bus signals.
 Circuit connects all the units, processor, memory
and the IO device through the system buses.
 Also called glue circuit used as it joins the
devices and memory with the system bus and
processor
 Can be designed using a GAL (generic array
logic) or FPGA
Memory system bus and I/O bus
interconnections in a bus structure

More Related Content

What's hot

Real Time OS For Embedded Systems
Real Time OS For Embedded SystemsReal Time OS For Embedded Systems
Real Time OS For Embedded SystemsHimanshu Ghetia
 
Computer Organization : CPU, Memory and I/O organization
Computer Organization : CPU, Memory and I/O organizationComputer Organization : CPU, Memory and I/O organization
Computer Organization : CPU, Memory and I/O organizationAmrutaMehata
 
Computer System Architecture
Computer System ArchitectureComputer System Architecture
Computer System ArchitectureBrenda Debra
 
Unit 1 basic structure of computers
Unit 1   basic structure of computersUnit 1   basic structure of computers
Unit 1 basic structure of computerschidabdu
 
Processor architecture
Processor architectureProcessor architecture
Processor architectureMuuluu
 
Computer Organisation & Architecture (chapter 1)
Computer Organisation & Architecture (chapter 1) Computer Organisation & Architecture (chapter 1)
Computer Organisation & Architecture (chapter 1) Subhasis Dash
 
Computer Organization: Introduction to Microprocessor and Microcontroller
Computer Organization: Introduction to Microprocessor and MicrocontrollerComputer Organization: Introduction to Microprocessor and Microcontroller
Computer Organization: Introduction to Microprocessor and MicrocontrollerAmrutaMehata
 
Computer Organization and Architecture 10th Edition by Stallings Test Bank
Computer Organization and Architecture 10th Edition by Stallings Test BankComputer Organization and Architecture 10th Edition by Stallings Test Bank
Computer Organization and Architecture 10th Edition by Stallings Test Bankrohalcabaye
 
The central processing unit by group 5 2015
The central processing unit by group 5 2015The central processing unit by group 5 2015
The central processing unit by group 5 2015Tendai Karuma
 
operating system structure
operating system structureoperating system structure
operating system structureHAMZA AHMED
 
Topic 5 Digital Technique basic computer structure
Topic 5 Digital Technique basic computer structureTopic 5 Digital Technique basic computer structure
Topic 5 Digital Technique basic computer structureBai Haqi
 
Embedded systems 101 final
Embedded systems 101 finalEmbedded systems 101 final
Embedded systems 101 finalKhalid Elmeadawy
 
Computer architecture and organization
Computer architecture and organizationComputer architecture and organization
Computer architecture and organizationTushar B Kute
 
Embedded System basic and classifications
Embedded System basic and classificationsEmbedded System basic and classifications
Embedded System basic and classificationsrajkciitr
 

What's hot (20)

Real Time OS For Embedded Systems
Real Time OS For Embedded SystemsReal Time OS For Embedded Systems
Real Time OS For Embedded Systems
 
Computer Organization : CPU, Memory and I/O organization
Computer Organization : CPU, Memory and I/O organizationComputer Organization : CPU, Memory and I/O organization
Computer Organization : CPU, Memory and I/O organization
 
Ch 01 os8e
Ch 01  os8eCh 01  os8e
Ch 01 os8e
 
Computer System Architecture
Computer System ArchitectureComputer System Architecture
Computer System Architecture
 
Unit 1 basic structure of computers
Unit 1   basic structure of computersUnit 1   basic structure of computers
Unit 1 basic structure of computers
 
Processor architecture
Processor architectureProcessor architecture
Processor architecture
 
Input-Output Modules
Input-Output ModulesInput-Output Modules
Input-Output Modules
 
Computer Organisation & Architecture (chapter 1)
Computer Organisation & Architecture (chapter 1) Computer Organisation & Architecture (chapter 1)
Computer Organisation & Architecture (chapter 1)
 
Computer Organization: Introduction to Microprocessor and Microcontroller
Computer Organization: Introduction to Microprocessor and MicrocontrollerComputer Organization: Introduction to Microprocessor and Microcontroller
Computer Organization: Introduction to Microprocessor and Microcontroller
 
Computer Organization and Architecture 10th Edition by Stallings Test Bank
Computer Organization and Architecture 10th Edition by Stallings Test BankComputer Organization and Architecture 10th Edition by Stallings Test Bank
Computer Organization and Architecture 10th Edition by Stallings Test Bank
 
Basic computer architecture
Basic computer architectureBasic computer architecture
Basic computer architecture
 
The central processing unit by group 5 2015
The central processing unit by group 5 2015The central processing unit by group 5 2015
The central processing unit by group 5 2015
 
Intro to cao &store program
Intro to cao &store programIntro to cao &store program
Intro to cao &store program
 
operating system structure
operating system structureoperating system structure
operating system structure
 
Topic 5 Digital Technique basic computer structure
Topic 5 Digital Technique basic computer structureTopic 5 Digital Technique basic computer structure
Topic 5 Digital Technique basic computer structure
 
Embedded systems 101 final
Embedded systems 101 finalEmbedded systems 101 final
Embedded systems 101 final
 
Computer architecture and organization
Computer architecture and organizationComputer architecture and organization
Computer architecture and organization
 
Intro to the unit
Intro to the unitIntro to the unit
Intro to the unit
 
Processors selection
Processors selectionProcessors selection
Processors selection
 
Embedded System basic and classifications
Embedded System basic and classificationsEmbedded System basic and classifications
Embedded System basic and classifications
 

Similar to Unit 1 processormemoryorganisation

BAIT1003 Chapter 2
BAIT1003 Chapter 2BAIT1003 Chapter 2
BAIT1003 Chapter 2limsh
 
Introduction to embedded System.pptx
Introduction to embedded System.pptxIntroduction to embedded System.pptx
Introduction to embedded System.pptxPratik Gohel
 
I. Introduction to Microprocessor System.ppt
I. Introduction to Microprocessor System.pptI. Introduction to Microprocessor System.ppt
I. Introduction to Microprocessor System.pptHAriesOa1
 
11. Computer Systems Hardware 1
11. Computer Systems   Hardware 111. Computer Systems   Hardware 1
11. Computer Systems Hardware 1New Era University
 
Challenges in Embedded Computing
Challenges in Embedded ComputingChallenges in Embedded Computing
Challenges in Embedded ComputingPradeep Kumar TS
 
1.CPU INSTRUCTION AND EXECUTION CYCLEThe primary function of the .pdf
1.CPU INSTRUCTION AND EXECUTION CYCLEThe primary function of the .pdf1.CPU INSTRUCTION AND EXECUTION CYCLEThe primary function of the .pdf
1.CPU INSTRUCTION AND EXECUTION CYCLEThe primary function of the .pdfaniyathikitchen
 
HHCJ AMUMARA:COMPUTER STUDIES LECTURE NOTE FOR SS3:005
HHCJ AMUMARA:COMPUTER STUDIES LECTURE NOTE FOR SS3:005HHCJ AMUMARA:COMPUTER STUDIES LECTURE NOTE FOR SS3:005
HHCJ AMUMARA:COMPUTER STUDIES LECTURE NOTE FOR SS3:005SOLOMONCHINAEMEUCHEA
 
micro controllers 1.ppt
micro controllers 1.pptmicro controllers 1.ppt
micro controllers 1.pptsiminkhan
 
HHCJ AMUMARA:COMPUTER STUDIES LECTURE NOTE FOR SS1:002
HHCJ AMUMARA:COMPUTER STUDIES LECTURE NOTE FOR SS1:002HHCJ AMUMARA:COMPUTER STUDIES LECTURE NOTE FOR SS1:002
HHCJ AMUMARA:COMPUTER STUDIES LECTURE NOTE FOR SS1:002SOLOMONCHINAEMEUCHEA
 
introduction of microprocessor
introduction of microprocessorintroduction of microprocessor
introduction of microprocessorReetika Singh
 

Similar to Unit 1 processormemoryorganisation (20)

Chap 3 CA.pptx
Chap 3 CA.pptxChap 3 CA.pptx
Chap 3 CA.pptx
 
BAIT1003 Chapter 2
BAIT1003 Chapter 2BAIT1003 Chapter 2
BAIT1003 Chapter 2
 
Introduction to embedded System.pptx
Introduction to embedded System.pptxIntroduction to embedded System.pptx
Introduction to embedded System.pptx
 
I. Introduction to Microprocessor System.ppt
I. Introduction to Microprocessor System.pptI. Introduction to Microprocessor System.ppt
I. Introduction to Microprocessor System.ppt
 
Co notes3 sem
Co notes3 semCo notes3 sem
Co notes3 sem
 
11. Computer Systems Hardware 1
11. Computer Systems   Hardware 111. Computer Systems   Hardware 1
11. Computer Systems Hardware 1
 
Chapter01 (1).ppt
Chapter01 (1).pptChapter01 (1).ppt
Chapter01 (1).ppt
 
Cpu & its execution of instruction
Cpu & its execution of instructionCpu & its execution of instruction
Cpu & its execution of instruction
 
esunit1.pptx
esunit1.pptxesunit1.pptx
esunit1.pptx
 
Challenges in Embedded Computing
Challenges in Embedded ComputingChallenges in Embedded Computing
Challenges in Embedded Computing
 
1.CPU INSTRUCTION AND EXECUTION CYCLEThe primary function of the .pdf
1.CPU INSTRUCTION AND EXECUTION CYCLEThe primary function of the .pdf1.CPU INSTRUCTION AND EXECUTION CYCLEThe primary function of the .pdf
1.CPU INSTRUCTION AND EXECUTION CYCLEThe primary function of the .pdf
 
ch1.pptx
ch1.pptxch1.pptx
ch1.pptx
 
HHCJ AMUMARA:COMPUTER STUDIES LECTURE NOTE FOR SS3:005
HHCJ AMUMARA:COMPUTER STUDIES LECTURE NOTE FOR SS3:005HHCJ AMUMARA:COMPUTER STUDIES LECTURE NOTE FOR SS3:005
HHCJ AMUMARA:COMPUTER STUDIES LECTURE NOTE FOR SS3:005
 
CAO.pptx
CAO.pptxCAO.pptx
CAO.pptx
 
micro controllers 1.ppt
micro controllers 1.pptmicro controllers 1.ppt
micro controllers 1.ppt
 
Cao u1
Cao u1Cao u1
Cao u1
 
HHCJ AMUMARA:COMPUTER STUDIES LECTURE NOTE FOR SS1:002
HHCJ AMUMARA:COMPUTER STUDIES LECTURE NOTE FOR SS1:002HHCJ AMUMARA:COMPUTER STUDIES LECTURE NOTE FOR SS1:002
HHCJ AMUMARA:COMPUTER STUDIES LECTURE NOTE FOR SS1:002
 
introduction of microprocessor
introduction of microprocessorintroduction of microprocessor
introduction of microprocessor
 
12429908.ppt
12429908.ppt12429908.ppt
12429908.ppt
 
Microprocessor
MicroprocessorMicroprocessor
Microprocessor
 

Recently uploaded

Employee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptxEmployee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptxNirmalaLoungPoorunde1
 
Biting mechanism of poisonous snakes.pdf
Biting mechanism of poisonous snakes.pdfBiting mechanism of poisonous snakes.pdf
Biting mechanism of poisonous snakes.pdfadityarao40181
 
Computed Fields and api Depends in the Odoo 17
Computed Fields and api Depends in the Odoo 17Computed Fields and api Depends in the Odoo 17
Computed Fields and api Depends in the Odoo 17Celine George
 
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdfEnzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdfSumit Tiwari
 
DATA STRUCTURE AND ALGORITHM for beginners
DATA STRUCTURE AND ALGORITHM for beginnersDATA STRUCTURE AND ALGORITHM for beginners
DATA STRUCTURE AND ALGORITHM for beginnersSabitha Banu
 
Crayon Activity Handout For the Crayon A
Crayon Activity Handout For the Crayon ACrayon Activity Handout For the Crayon A
Crayon Activity Handout For the Crayon AUnboundStockton
 
CELL CYCLE Division Science 8 quarter IV.pptx
CELL CYCLE Division Science 8 quarter IV.pptxCELL CYCLE Division Science 8 quarter IV.pptx
CELL CYCLE Division Science 8 quarter IV.pptxJiesonDelaCerna
 
Introduction to ArtificiaI Intelligence in Higher Education
Introduction to ArtificiaI Intelligence in Higher EducationIntroduction to ArtificiaI Intelligence in Higher Education
Introduction to ArtificiaI Intelligence in Higher Educationpboyjonauth
 
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...Marc Dusseiller Dusjagr
 
Full Stack Web Development Course for Beginners
Full Stack Web Development Course  for BeginnersFull Stack Web Development Course  for Beginners
Full Stack Web Development Course for BeginnersSabitha Banu
 
Meghan Sutherland In Media Res Media Component
Meghan Sutherland In Media Res Media ComponentMeghan Sutherland In Media Res Media Component
Meghan Sutherland In Media Res Media ComponentInMediaRes1
 
Hierarchy of management that covers different levels of management
Hierarchy of management that covers different levels of managementHierarchy of management that covers different levels of management
Hierarchy of management that covers different levels of managementmkooblal
 
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17Incoming and Outgoing Shipments in 1 STEP Using Odoo 17
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17Celine George
 
Proudly South Africa powerpoint Thorisha.pptx
Proudly South Africa powerpoint Thorisha.pptxProudly South Africa powerpoint Thorisha.pptx
Proudly South Africa powerpoint Thorisha.pptxthorishapillay1
 
How to Make a Pirate ship Primary Education.pptx
How to Make a Pirate ship Primary Education.pptxHow to Make a Pirate ship Primary Education.pptx
How to Make a Pirate ship Primary Education.pptxmanuelaromero2013
 
CARE OF CHILD IN INCUBATOR..........pptx
CARE OF CHILD IN INCUBATOR..........pptxCARE OF CHILD IN INCUBATOR..........pptx
CARE OF CHILD IN INCUBATOR..........pptxGaneshChakor2
 
18-04-UA_REPORT_MEDIALITERAСY_INDEX-DM_23-1-final-eng.pdf
18-04-UA_REPORT_MEDIALITERAСY_INDEX-DM_23-1-final-eng.pdf18-04-UA_REPORT_MEDIALITERAСY_INDEX-DM_23-1-final-eng.pdf
18-04-UA_REPORT_MEDIALITERAСY_INDEX-DM_23-1-final-eng.pdfssuser54595a
 
Introduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptxIntroduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptxpboyjonauth
 
Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions  for the students and aspirants of Chemistry12th.pptxOrganic Name Reactions  for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions for the students and aspirants of Chemistry12th.pptxVS Mahajan Coaching Centre
 
Framing an Appropriate Research Question 6b9b26d93da94caf993c038d9efcdedb.pdf
Framing an Appropriate Research Question 6b9b26d93da94caf993c038d9efcdedb.pdfFraming an Appropriate Research Question 6b9b26d93da94caf993c038d9efcdedb.pdf
Framing an Appropriate Research Question 6b9b26d93da94caf993c038d9efcdedb.pdfUjwalaBharambe
 

Recently uploaded (20)

Employee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptxEmployee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptx
 
Biting mechanism of poisonous snakes.pdf
Biting mechanism of poisonous snakes.pdfBiting mechanism of poisonous snakes.pdf
Biting mechanism of poisonous snakes.pdf
 
Computed Fields and api Depends in the Odoo 17
Computed Fields and api Depends in the Odoo 17Computed Fields and api Depends in the Odoo 17
Computed Fields and api Depends in the Odoo 17
 
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdfEnzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
Enzyme, Pharmaceutical Aids, Miscellaneous Last Part of Chapter no 5th.pdf
 
DATA STRUCTURE AND ALGORITHM for beginners
DATA STRUCTURE AND ALGORITHM for beginnersDATA STRUCTURE AND ALGORITHM for beginners
DATA STRUCTURE AND ALGORITHM for beginners
 
Crayon Activity Handout For the Crayon A
Crayon Activity Handout For the Crayon ACrayon Activity Handout For the Crayon A
Crayon Activity Handout For the Crayon A
 
CELL CYCLE Division Science 8 quarter IV.pptx
CELL CYCLE Division Science 8 quarter IV.pptxCELL CYCLE Division Science 8 quarter IV.pptx
CELL CYCLE Division Science 8 quarter IV.pptx
 
Introduction to ArtificiaI Intelligence in Higher Education
Introduction to ArtificiaI Intelligence in Higher EducationIntroduction to ArtificiaI Intelligence in Higher Education
Introduction to ArtificiaI Intelligence in Higher Education
 
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
“Oh GOSH! Reflecting on Hackteria's Collaborative Practices in a Global Do-It...
 
Full Stack Web Development Course for Beginners
Full Stack Web Development Course  for BeginnersFull Stack Web Development Course  for Beginners
Full Stack Web Development Course for Beginners
 
Meghan Sutherland In Media Res Media Component
Meghan Sutherland In Media Res Media ComponentMeghan Sutherland In Media Res Media Component
Meghan Sutherland In Media Res Media Component
 
Hierarchy of management that covers different levels of management
Hierarchy of management that covers different levels of managementHierarchy of management that covers different levels of management
Hierarchy of management that covers different levels of management
 
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17Incoming and Outgoing Shipments in 1 STEP Using Odoo 17
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17
 
Proudly South Africa powerpoint Thorisha.pptx
Proudly South Africa powerpoint Thorisha.pptxProudly South Africa powerpoint Thorisha.pptx
Proudly South Africa powerpoint Thorisha.pptx
 
How to Make a Pirate ship Primary Education.pptx
How to Make a Pirate ship Primary Education.pptxHow to Make a Pirate ship Primary Education.pptx
How to Make a Pirate ship Primary Education.pptx
 
CARE OF CHILD IN INCUBATOR..........pptx
CARE OF CHILD IN INCUBATOR..........pptxCARE OF CHILD IN INCUBATOR..........pptx
CARE OF CHILD IN INCUBATOR..........pptx
 
18-04-UA_REPORT_MEDIALITERAСY_INDEX-DM_23-1-final-eng.pdf
18-04-UA_REPORT_MEDIALITERAСY_INDEX-DM_23-1-final-eng.pdf18-04-UA_REPORT_MEDIALITERAСY_INDEX-DM_23-1-final-eng.pdf
18-04-UA_REPORT_MEDIALITERAСY_INDEX-DM_23-1-final-eng.pdf
 
Introduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptxIntroduction to AI in Higher Education_draft.pptx
Introduction to AI in Higher Education_draft.pptx
 
Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions  for the students and aspirants of Chemistry12th.pptxOrganic Name Reactions  for the students and aspirants of Chemistry12th.pptx
Organic Name Reactions for the students and aspirants of Chemistry12th.pptx
 
Framing an Appropriate Research Question 6b9b26d93da94caf993c038d9efcdedb.pdf
Framing an Appropriate Research Question 6b9b26d93da94caf993c038d9efcdedb.pdfFraming an Appropriate Research Question 6b9b26d93da94caf993c038d9efcdedb.pdf
Framing an Appropriate Research Question 6b9b26d93da94caf993c038d9efcdedb.pdf
 

Unit 1 processormemoryorganisation

  • 1. Unit 2 PROCESSOR AND MEMORY ORGANIZATION By, Mrs. Pavithra S Asst. Prof. GSSSIETW, Mysuru Karnataka
  • 2. Contents 1. Structural Units in a Processor 2. Processor selection for an Embedded System 3. Memory Devices 4. Memory Selection for an Embedded System 5. Allocation of memory to Program segments & Blocks and Memory map of a system 6. Direct Memory Access 7. Interfacing Processor 8. Memories and Input Output Devices
  • 3. Structural Units in a Processor Structural Unit Functions MAR – Memory Address Register • holds address of byte/word to be fetched from external memory. • processor issues the address of instruction or data to MAR before it initiates fetch cycle. MDR – Memory Data Register • holds a byte/word fetched (to be sent) from (to) an external memory / IO address. System Buses 1. Internal Bus 2. Address Bus 3. Data Bus 4. Control Bus • internally connects all the structural units inside the processor (width – 8,18, 32, 48 or 64 bits) • external bus that carries address from MAR to memory as well as to IO devices & other units of system. • external bus that carries, during read/write operation, the bytes for instruction/data from/to an address. (determined by MAR) • external set of signals to carry control signal to processor/memory/device
  • 4. BIU – Bus Interface Unit • interface unit between processor’s internal units & external buses IR – Instruction Register • sequentially takes instruction codes (opcode) to execution unit of processor. ID – Instruction Decoder • decodes the instruction received at the IR & passes it to processor CU. CU – Control Unit • controls all the bus activities & unit functions needed for processing. ARS – Application Register Set • set of on-chip registers used during processing of instruction of an application program or • a register window • a subset of registers with each subset storing static variables of a software routine • a register file associated to a unit (ALU/FPLU) ALU – Arithmetic Logic Unit • unit to execute arithmetic/logical instruction according to current instruction present at IR. PC – Program Counter • generates an instruction cycle by sending the address defined by it to memory through MAR • auto increments as the instructions are fetched regularly & sequentially • called as instruction pointer in 80x86 processors
  • 5. SP – Stack Pointer • pointer for an address which corresponds to a stack top in memory. IQ – Instruction Queue • queue of instructions so that IR does nit have to wait for next instruction PFCU – Pre-fetch Control Unit • unit that controls the fetching of data into I- & D- caches in advance from memory units. • improve performance by fetching instructions and data in advance for processing. I- Cache – Instruction Cache • sequentially stores (like instruction queue) instructions in FIFO mode. • lets the processor execute instructions at greater speed using PFCU. D- Cache – Data Cache • stores pre-fetch data from external memory. • stores both key and value together at a location. • also stores write-through data when configured. BT- Cache – Branch Target Cache • facilitate ready availability of the next instruction-set when a branch instruction like JUMP/LOOP/CALL is encountered. MMU – Memory Management Unit • manages the memories such that the instructions and date are readily available for processing. SRS – System Register Set • set of registers used while processing the instructions of the supervisory system program.
  • 6. FLPU – Floating Point Processing Set • separate unit from ALU for floating point processing which is essential in processing mathematical function fast in a microprocessor/DSP FRS – Floating point Register Set • register set dedicated for storing floating point numbers in a standard format and used by FLPU for its data & stack. MAC – Multiply and Accumulate unit • units for multiplying coefficients of a series and accumulating these during computations. AOU – Atomic Operation Unit • it lets a user/compiler instructions when broken into a number of processor instructions called atomic operations, finish before an interrupt of a process occurs. • it prevents problems from arising out of shared data between various routines and tasks.
  • 7. Organisation of various structural units of processor Units shown with dashed boundary are present in the high performance processors only
  • 8. Features in most processors 1. Instruction CycleTime: ◦ It’s the time taken by a processor to execute a simple instruction ( ˜1µs for 8051- ˜1.6ns for MPC604 ) ◦ System designer uses as an indicator to match the processor speed with application 2. Internal BusWidth: ◦ ALU gets inputs through internal buses ◦ 32 bit bus to facilitate the availability of arithmetic operations on 32-bit operands in a single cycle ◦ 32-bit bus – a necessity for signal processing and control system instructions 3. Program-Counter (PC) bits & Reset value: ◦ Number of PC bits decides maximum possible size of physical memory that can be accessed by the processor ◦ Reset value tells the designer the initial program address from where the program runs on a system reset/power up
  • 9. 4. Stack-Pointer bits & initial reset value ◦ SP values must point to addresses of the words stored at stack ◦ Software designer defines an initial reset value & sets the beginning SP accordingly 5. Interrupt Controller ◦ To program the service routine priorities and to allocate vector addresses 6. Direct Memory Access (DMA) controller with multiple channels ◦ More number of I/O devices needs to access a multi byte data set faster, DMA is useful. Features in most processors
  • 10. PROCESSOR SELECTION Processor specific feature: 1. Should operate at higher clock speed for processing more instructions per second. 2. High computing performance when there exist ◦ (a) Pipeline(s) and superscalar architectures, ◦ (b) pre-fetch cache unit, caches, and register-files and MMU and (c) RISC architecture. 3. Register-windows provides fast context switching in a multitasking system. 4. Power-efficient embedded system requires a processor that has auto-shut down feature for its units and programmability for the disabling use of caches when the processing need for a function or instruction set is not constrained by limit or execution time. Uses Stop, Sleep and Wait instructions, also require special cache design.
  • 11. Processor specific feature: 5. Burst mode accesses external memories fast, reads fast and writes fast. 6. Atomic operation unit provides hardware solution to shared data problem when designing embedded software, else special programming skill and efforts are to be made when sharing the variables among the multiple tasks. 7. Big-endian (MSB to lowest address) or Little-endian (LSB to lowest address) 8. Energy efficient
  • 12. Case Studies:  Case-1 ◦ Systems in which processor instruction cycle time is ˜1µs and on-chip devices & memory can suffice. ◦ Examples:Automatic chocolate vending machine, robots, data acquisition systems  Case-2 ◦ Systems in which processor instruction cycle time is ˜10 to 40ns and on-chip devices & memory do not suffice and medium processor performance required. ◦ Examples: 2Mbps router, image processing, voice data acquisition, voice compression
  • 13. Case Studies:  Case-3 ◦ Systems in which instruction cycle time is 5 to 10ns required and high MIPS/MFLOPS performance needed. ◦ Examples: Multiport 100Mbps network transceiver, fast 100Mbps switches, router  Case-4 ◦ Systems in which instruction cycle time of even1ns does not suffice and multi-processor system is required along with use of floating point & MAC unit. ◦ Examples:Voice processing,Video processing, Real-time audio/video processing
  • 14. MEMORY DEVICES  A simple credit-debit transaction card may require just 2kB of memory. ◦ On other hand, smart card for secure transactions (cryptographic functions) require 32kB of memory.  A memory- a data byte, or a word, or a double word, or a quad word may be accessed from all addressable locations with a similar process and there is would be equal access time for a read or for a write operation.
  • 15. ROM : Uses, Forms &Variants  Non-Volatility is an important asset useful to embed codes & data in a system.  ROM embeds software/application logic circuit in either forms – Masked ROM, PROM & EPROM.  During runtime programming EEPROM/Flash memory is used.
  • 16. Masked ROM  One time masking charge – very high  Therefore, system manufacturer will place order & manufacturing foundry will accept the order for a minimum of 1000 pieces.  ROM is a cost effective solution to a bulk user.
  • 17. EPROM, EEPROM and OTP ROM  EPROM: ◦ It is an ultraviolet ray erasable & device programmable. ◦ Erasing means restoring 1 at each bit.  EEPROM: ◦ Electrically Erasable and Programmable Read Only Memory  Flash Memory: ◦ Form of EEPROM, in which sector of bytes can be erased in a flash.  PROM: ◦ Once written is not erasable. ◦ OTP (One Time device Programmer)
  • 18. RAM – Random Access Memory  A system designer considers RAM devices of EIGHT forms. 1. SRAM – Static RAM, 2. DRAM – Dynamic RAM, 3. NVRAM – NonVolatile RAM, 4. EDORAM – Extended Data Output RAM, 5. SDRAM – Synchronous DRAM, 6. RDRAM – Rambus DRAM, 7. Parameterized distributed RAM and 8. Parameterized Block RAM. USES:  Stores variables during a program run & stores stack.  Stores input & output buffers. ◦ Eg: Speech & Image
  • 19. 1. SRAM: commonly used for designing caches & in embedded systems and microcontrollers. 2. DRAM: mostly used in high performance computers / high memory density systems. 3. EDORAM: used for system having buses with clock rates up to 100MHz. 4. SDRAM: synchronizes read operations & keeps next word ready, used for processor speed of 1GHz. 5. RDRAM: accesses in burst (four successive words in a single fetch), thus performance 1GHz speed.
  • 20. 6. Parameterized distributed RAM: distributes in various system sub-units - IO buffers & transceiver sub-units. Distribution buffering of memory & facilitates faster inputs from IO devices. 7. Parameterized Block RAM: used when specific block of RAM is dedicated to sub- unit (eg: MAC unit), used when access by the system / IO / Internal bus is slow compared to processing speed of sub-unit.
  • 21. Summary of Memory  Masked ROM/EPROM/Flash stores embedded software (ROM image). Masked ROM is for bulk manufacturing.  EPROM / EEPROM is used for testing & design stages.  EEPROM is used to store the results during program runtime (erased byte-by-byte and written during system run).  Flash is useful when a processed image /voice /data /system configuration has to be stored.  RAM is mostly used in SRAM form
  • 22. Memory Selection for an Embedded System  Once Software designer’s coding is over and the ROM image file is ready, a hardware designer is faced with the questions, of what type of memory and what size of each should be used.  CASE STUDIES: 1. Automatic chocolate vending machine or real time robotic control system. 2. Data Acquisition Systems 3. Multi-pot network transceivers, Fast switches, Routers, or Multi-channel Fast Encryption and decryption System 4. Voice processor or video processing or Mobile Phone system 5. Digital Camera orVideo recorder system.
  • 23. Allocation of MemoryTo Program Segments and Blocks  Functions, Processes, Data and Stacks at theVarious Segments of Memory: ◦ Program routines & processes can have different segments. ◦ A pointer address, points to the start of memory block storing a segment and an offset value is used to retrieve for a memory address within that segment.  Segment wise memory allocation in four segments: Code, Data, Stack and Extra (for examples, image, String)
  • 24. Segments and Paging at the Memory  A segment can have partitions of fixed sizes called PAGES. ◦ Figure shows different segment types required by software designer. Each Segment has a starting and ending memory address. Each Segment has a pointer and an offset address. Using offset, code / data is retrieved from a segment
  • 25. Different Data Structures/Sets at Various Memory Blocks 1) Stacks – • allotted memory block, from which data is read (LIFO) • Return addresses on the nested calls, • Sets of LIFO (Last In First Out) retrievable data, • Saved Contexts of the tasks as the stacks
  • 26. 2) Arrays – One dimensional or multidimensional data can be retrieved from any element address. 3) Queues – Sets of FIFO (First In First Out) retrievable data;Two pointer (Front/Head & Back/Tail) Circular Queue (Example- a Printer Buffer); bounded memory block, on exceeding limit reset to start. PIPE / Block Queue (Example- a network stack) common memory block allotted for a queue with source & destination. For Circular Queue, when back attempts To exceed end, back becomes equal to start.
  • 27. 4) Table – two dimensional array (matrix) three pointers – table base, column index, destination index pointer 5) HashTable – collection of pairs of key & corresponding value. data set allocated with a memory block - Look-up-table 6) List – a data structure with number of memory blocks, one for each element. each list-element stores pointer to next element last element points to NULL A list is for non-consecutively located objects at the memory.
  • 29. Fig (a) - Princeton and Fig (b) - Harvard Memory Organizations
  • 30. The Memory Maps  Memory areas needed in the case of Princeton and Harvard architecture are different and as shown ◦ Vectors and pointers, variables, program segments and memory blocks for data and stacks have different addresses in the program – PRINCETON memory architecture. ◦ Program segments and memory blocks for data and stacks have separate sets of addresses in Harvard architecture. Control signals and read-write instructions are also separate.  Designer must remember that if main memory is of Harvard architecture, program memory map will be separate.
  • 31. Memory Map  Map to show the program and data allocation of the addresses to ROM, RAM, EEPROM or Flash in the system Fig: Memory map for an exemplary embedded system, smart card needing 2 kB memory
  • 32. Direct Memory Access  A DMA is required when a multi-byte data set or a burst of data or a block of data is to be transferred between the external device and system or two systems.  A device facilitates DMA transfer with a processing element (single purpose processor) and that device is called DMAC (DMA Controller).  Three modes of DMA operations: ◦ Single transfer at a time and then release of the hold on the system bus. ◦ Burst transfer at a time and then release of the hold on the system bus.A burst may be of a few kB. ◦ Bulk transfer and then release of the hold on the system bus after the transfer is completed.
  • 33. DMAC - DMA Controller  Data transfer occurs efficiently between I/O devices and system memory with the least processor intervention using DMAC.  DMAC provide memory access to Multiple channels ◦ Separate set of registers for programming each channel. ◦ Separate interrupt signals in the case of a multi- channel DMAC  Provides DMA action from system memories and two (or more IO) devices.
  • 34. DMA Controller with the buses & control signals in between Figure shows the buses and control signals between processor, Memory, DMAC and the data transferring I/O devices.
  • 35. DMA Controller Execution  DMA proceeds without the CPU intervening ◦ Except (i) at the start for DMAC programming and initializing and (ii) at the end. ◦ Whenever a DMA request by external device is made to the DMAC, the CPU is requested (using interrupt signal) the DMA transfer by DMAC at the start to initiate the DMA and at the end to notify (using interrupt signal) the end of the DMA by DMAC.
  • 36. Interfacing Processor, Memories & Input Output Devices  Interconnections for a simple bus structure has three sets of signals – data, address and control signals.  A system-bus interfacing-design is according to the timing diagrams of processor signals, speed and word length for instructions and data.  Interfacing of processor, memory and IO devices using memory system bus
  • 37. Time division multiplexed (TDM) address and data bits for the memories  TDM ─ Different time slots, there is a different sets (channel) of the signals.  Address signals during one time slot and data bus signals in another time slot.  Interfacing circuit for the demultiplexing of the buses uses a control signal.  Control signal - Address Latch Enable (ALE) in 8051, Address Strobe (AS) in 68HC11 and address valid (ADV) in 80196.  ALE or AS or ADV demultiplexes the address and data buses to the devices
  • 38. Interfacing circuit using Latch and decoders  ALE for latching the address  PSEN (Program Store ENable) for program memory read using address data buses  Each chip of the memory or port that connects the processor has a separate chip select input from a decoder.  Decoder is a circuit, which has appropriate signals of the address bus at the input and control circuit signals to generate corresponding CS (chip select) control signals for each device (memory and ports)
  • 39. Summary: Interfacing- circuit  Consists of latches, decoders and demultiplexers  Designed as per available control signals and timing diagrams of the bus signals.  Circuit connects all the units, processor, memory and the IO device through the system buses.  Also called glue circuit used as it joins the devices and memory with the system bus and processor  Can be designed using a GAL (generic array logic) or FPGA
  • 40. Memory system bus and I/O bus interconnections in a bus structure