CSE332.

7 Computer Organization and

Architecture
Lecture 3
February 2 , 2022
Prof. Dr. Muhammad Shahin Uddin
Email: muhammad.uddin@northsouth.edu
The COA Important Topics
Functional Units

Memory

1. Bus
2. Memory
3. I/P
Control 4. O/P
I/P O/P
Unit 5. ALU
(CU) 6. CU

Data or Information line

Set of Channel
is called Bus Control Line or Control Signal
ALU

Processor

Basic functional units of a computer

Information Handled by a Computer
• Instructions/machine instructions
Govern the transfer of information within a computer as well as between the
computer and its I/O devices
Specify the arithmetic and logic operations to be performed
Program
• Data
Used as operands by the instructions
Source program
• Encoded in binary code – 0 and 1
Bus
Bus is a set of channel
 Function of Channel: Signal Transmission
Types of Bus
Bus Contention Problem
Remedy
Bus: Types of Bus
Types of Bus:
 Data Bus (Bi-Directional) : Send data or information to devices or device
 Address Bus (Unidirectional) : Give address to devices
 Control Bus (Bidirectional) :

Address Bus

D1 D2 D3 … Dn

µP
Data Bus

Control Bus
Bus: Bus Contention Problem
Overlap

Bidirectional
0/1 0/1
D1 Data Bus D2
Vmin Vmax
0/1 1/0

Imax = Vmax /Rmin

Contention

D1 D2 Status Bidirectional Bus

D1->D2 D2->D1
Bus Organization
0 0 Overlap
 Bus Arbitration(Sharing) Use one
0 1 Contention
Remedy device only at a time
1 0 Contention  Tristate Bus (Tristate Buffer)
1 1 Overlap  Output hold Buffer
Bus Contention Problem: Remedy
 Bus Arbitration (Sharing)
• Daisy Chaining • Polling •Independent Requesting

 Daisy Chaining
• The Daisy chain in the computer network topology is the interconnection of
computers, peripherals or network nodes in sequence (one by one).
• If a message is intended for a computer that is in the middle line, each system
bounces them in the chain until it reaches its destination.
 Advantages:
• No Use of extra cables
• Data transmission is relatable fast and easier
• Cheap in terms of construction
 Disadvantages:
• The value of priority assigned to a device depends on the position of the master bus
• Propagation delay arises in this method
• If one device fails then the entire system will stop working
• If a number of nodes increases in the network, it can slow down the whole network
Bus Arbitration (Sharing)
Daisy Chaining

D1 D2 D3 … Dn

BR

µP
Common Data Bus

BR =Bus Request
Bus Arbitration (Sharing)
Daisy Chaining

D1 D2 D3 … Dn

BR

BB
µP
Common Data Bus

BR =Bus Request
BB = Bus Busy
Bus Arbitration (Sharing)
Daisy Chaining

BG
D1 D2 D3 … Dn
Normally D1->
D2->… Dn
But if there is no
BR priority

BB
µP
Common Data Bus

BG = Bus Grant
BR =Bus Request After Assigning data bus
BB = Bus Busy suppose D3 request BUS
Then mp send BB signal to D3
Bus Arbitration (Sharing)
Daisy Chaining

BG
D1 D2 D3
… Dn

BR

BB
µP
Common Data Bus

BG = Bus Grant
BR =Bus Request
BB = Bus Busy
Bus Contention Problem: Remedy
 Bus Arbitration (Sharing)
• Daisy Chaining • Polling •Independent Requesting

 Polling
• Overcome the problem in Daisy chaining method
Bus Arbitration (Sharing)
Polling
Poll count number
BG D0 000

D0 D1 D2
… Dn

BR

BB
µP
Common Data Bus

BG = Bus Grant D0 000

BR =Bus Request D 001
1
BB = Bus Busy D2 010
Bus Arbitration (Sharing)
Independent Requesting
BG

BR D0 D1 D2
… Dn

BB
µP
Common Data Bus

BG = Bus Grant
BR =Bus Request
BB = Bus Busy
Thanks