Chapter 1.

Basic Structure of
Computers
 Computer system Architectur

• What is Computer Architecture?

• computer architecture is the science of
integrating the components to achieve a level
of functionality and performance.
 COMPUTER TYPES

Computers are classified based on the

parameters like
• Speed of operation
• Cost
• Computational power
• Type of application
DESK TOP COMPUTER

• Processing &storage units, visual display &audio uits,

keyboards
• Storage media-Hard disks, CD-ROMs
• Eg: Personal computers which is used in homes and offices
• Advantage: Cost effective, easy to operate, suitable for general
purpose educational or business application
NOTEBOOK COMPUTER

• Compact form of personal computer (laptop)

• Advantage is portability
WORK STATIONS
• More computational power than PC
•Costlier
•Used to solve complex problems which arises in engineering
application (graphics, CAD/CAM etc)

ENTERPRISE SYSTEM (MAINFRAME)

•More computational power
•Larger storage capacity
•Used for business data processing in large organization
•Commonly referred as servers or super computers
SERVER SYSTEM

• Supports large volumes of data which frequently need to be

accessed or to be modified
•Supports request response operation

SUPER COMPUTERS

•Faster than mainframes

•Helps in calculating large scale numerical and algorithm
calculation in short span of time
•Used for aircraft design and testing, military application and
weather forecasting
HANDHELD
• Also called a PDA (Personal
Digital Assistant).
• A computer that fits into a
pocket, runs on batteries, and
is used while holding the unit
in your hand.
• Typically used as an
appointment book, address
book, calculator, and notepad.
• Can be synchronized with a
personal microcomputer as a
backup.
 Basic Terminology

• Computer • Software
– A device that accepts input, – A computer program that tells
processes data, stores data, and the computer how to perform
produces output, all according to particular tasks.
a series of stored instructions.
• Network
• Hardware – Two or more computers and
– Includes the electronic and other devices that are
mechanical devices that process connected, for the purpose of
the data; refers to the computer sharing data and programs.
as well as peripheral devices.
• Peripheral devices
– Used to expand the computer’s
input, output and storage
capabilities.
 Basic Terminology

• Input
– Whatever is put into a computer system.
• Data
– Refers to the symbols that represent facts, objects, or ideas.
• Information
– The results of the computer storing data as bits and bytes; the words, numbers,
sounds, and graphics.
• Output
– Consists of the processing results produced by a computer.
• Processing
– Manipulation of the data in many ways.
• Memory
– Area of the computer that temporarily holds data waiting to be processed,
stored, or output.
• Storage
– Area of the computer that holds data on a permanent basis when it is not
immediately needed for processing.
 Basic Terminology

•Assembly language program (ALP) – Programs are written using

mnemonics

•Mnemonic – Instruction will be in the form of English like form

•Assembler – is a software which converts ALP to MLL (Machine

Level Language)

•HLL (High Level Language) – Programs are written using English

like statements

•Compiler - Convert HLL to MLL, does this job by reading source

program at once
 Basic Terminology
•Interpreter – Converts HLL to MLL, does this job
statement by statement

•System software – Program routines which aid the user

in the execution of programs eg: Assemblers, Compilers

•Operating system – Collection of routines responsible

for controlling and coordinating all the activities in a
computer system
 Computing Systems

Computers have two kinds of components:

• Hardware, consisting of its physical devices
(CPU, memory, bus, storage devices, ...)
• Software, consisting of the programs it has
(Operating system, applications, utilities, ...)

Calvin College
 What is a computer?

• Simply put, a computer is a sophisticated electronic calculating

machine that:
– Accepts input information,
– Processes the information according to a list of internally stored
instructions and
– Produces the resulting output information.
• Functions performed by a computer are:
– Accepting information to be processed as input.
– Storing a list of instructions to process the information.
– Processing the information according to the list of instructions.
– Providing the results of the processing as output.
• What are the functional units of a computer?
13
Functional Units
 FUNCTIONAL UNITS OF
COMPUTER
• Input Unit

• Output Unit

• Central processing Unit (ALU and Control Units)

• Memory

• Bus Structure
 The Big Picture

Processor
Input
Control
Memory

ALU
Output

Since 1946 all computers have had 5 components!!!

 IMPORTANT
Function SLIDE !

• ALL computer functions are:

– Data PROCESSING
– Data STORAGE Data = Information
– Data MOVEMENT
– CONTROL Coordinates How
Information is Used

• NOTHING ELSE!
INPUT UNIT:

•Converts the external world data to a binary format, which can

be understood by CPU

•Eg: Keyboard, Mouse, Joystick etc

OUTPUT UNIT:

•Converts the binary format data to a format that a common

man can understand

•Eg: Monitor, Printer, LCD, LED etc

CPU
•The “brain” of the machine

•Responsible for carrying out computational task

•Contains ALU, CU, Registers

•ALU Performs Arithmetic and logical operations

•CU Provides control signals in accordance with some

timings which in turn controls the execution process

•Register Stores data and result and speeds up the

operation
Example
Add R1, R2

T1 Enable R1

T2 Enable R2

T3 Enable ALU for addition operation

T4 Enable out put of ALU to store result of the

operation
 •Control unit works with a
reference signal called
T1 processor clock

T2 •Processor divides the

operations into basic steps

R1 R2
•Each basic step is
executed in one clock
cycle

R2
MEMORY

•Stores data, results, programs

•Two class of storage

(i) Primary (ii) Secondary

•Two types are RAM or R/W memory and ROM read only memory

•ROM is used to store data and program which is not going to change.

•Secondary storage is used for bulk storage or mass storage

 Basic Operational Concepts

Basic Function of Computer

• To Execute a given task as per the appropriate program

• Program consists of list of instructions stored in

memory
 Review

• Activity in a computer is governed by instructions.

• To perform a task, an appropriate program consisting of a
list of instructions is stored in the memory.
• Individual instructions are brought from the memory into
the processor, which executes the specified operations.
• Data to be used as operands are also stored in the
memory.
 A Typical Instruction

• Add LOCA, R0
• Add the operand at memory location LOCA to the
operand in a register R0 in the processor.
• Place the sum into register R0.
• The original contents of LOCA are preserved.
• The original contents of R0 is overwritten.
• Instruction is fetched from the memory into the
processor – the operand at LOCA is fetched and added to
the contents of R0 – the resulting sum is stored in
register R0.
 Separate Memory Access and
ALU Operation

• Load LOCA, R1
• Add R1, R0
• Whose contents will be overwritten?
Interconnection between Processor and Memory
Registers
Registers are fast stand-alone storage locations that hold data
temporarily. Multiple registers are needed to facilitate the
operation of the CPU. Some of these registers are

 Two registers-MAR (Memory Address Register) and

MDR (Memory Data Register) : To handle the data
transfer between main memory and processor. MAR-
Holds addresses, MDR-Holds data
 Instruction register (IR) : Hold the Instructions that is
currently being executed
 Program counter: Points to the next instructions that is
to be fetched from memory
•(PC) (MAR)( the contents of
PC transferred to MAR)

•(MAR) (Address bus) Select a

particular memory location

•Issues RD control signals

•Reads instruction present in memory

and loaded into MDR

•Will be placed in IR (Contents transferred

from MDR to IR)
•Instruction present in IR will be decoded by which
processor understand what operation it has to
perform

•Increments the contents of PC by 1, so that it

points to the next instruction address

•If data required for operation is available in

register, it performs the operation

•If data is present in memory following sequence is

performed
•Address of the data MAR

•MAR Address bus select memory

location where is issued RD signal

•Reads data via data bus MDR

•From MDR data can be directly routed to ALU or it

can be placed in register and then operation can be
performed

•Results of the operation can be directed towards

output device, memory or register

•Normal execution preempted (interrupt)

 Interrupt

• An interrupt is a request from I/O device for

service by processor
• Processor provides requested service by
executing interrupt service routine (ISR)
• Contents of PC, general registers, and some
control information are stored in memory .
• When ISR completed, processor restored, so
that interrupted program may continue
 BUS STRUCTURE
Connecting CPU and memory
The CPU and memory are normally connected by three
groups of connections, each called a bus: data bus, address
bus and control bus

Connecting CPU and memory using three buses

 BUS STRUCTURE
•Group of wires which carries information form CPU to peripherals or vice
– versa

•Single bus structure: Common bus used to communicate between

peripherals and microprocessor

INPUT MEMORY PROCESSOR OUTPUT

SINGLE BUS STRUCTURE

Continued:-

• To improve performance multibus structure can be used

•In two – bus structure : One bus can be used to fetch

instruction other can be used to fetch data, required for
execution.

•Thus improving the performance ,but cost increases

 A2 A1 A0 Selected
CONTROL BUS location

0 0 0 0th Location
0 0 1 1st Location
0 1 0

W/R
0 1 1
CS RD
A0 PROCESSOR
A1 1 0 0
A2
1 0 1
ADDRESS BUS
1 1 0
D7 D0
D0 D7
1 1 1

DATA BUS
Cont:-

•23 = 8 i.e. 3 address line is required to select 8 location

•In general 2x = n where x number of address lines

(address bit) and n is number of location

•Address bus : unidirectional : group of wires which

carries address information bits form processor to
peripherals (16,20,24 or more parallel signal lines)
Cont:-

•Databus: bidirectional : group of wires which

carries data information bit form processor to
peripherals and vice – versa

•Controlbus: bidirectional: group of wires which

carries control signals form processor to
peripherals and vice – versa

•Figure below shows address, data and control bus

and their connection with peripheral and
microprocessor
Single bus structure showing the details of connection
 Memory Locations,
Addresses, and Operations
 Memory Location, Addresses,
and Operation
n bits
first word
• Memory consists of
second word
many millions of
storage cells, each
of which can store 1 •
•
bit. •
• Data is usually i th word
accessed in n-bit
groups. n is called
word length. •
•
•
last word

Figure 2.5. Memory words.

 MEMORY LOCATIONS AND ADDRESSES
•Main memory is the second major subsystem in a
computer. It consists of a collection of storage locations,
each with a unique identifier, called an address.

•Data is transferred to and from memory in groups of

bits called words. A word can be a group of 8 bits, 16
bits, 32 bits or 64 bits (and growing).

•If the word is 8 bits, it is referred to as a byte. The term

“byte” is so common in computer science that
sometimes a 16-bit word is referred to as a 2-byte word,
or a 32-bit word is referred to as a 4-byte word.
Figure 5.3 Main memory
 Address space

•To access a word in memory requires an identifier. Although

programmers use a name to identify a word (or a collection
of words), at the hardware level each word is identified by an
address.

•The total number of uniquely identifiable locations in

memory is called the address space.

•For example, a memory with 64 kilobytes (16 address line

required) and a word size of 1 byte has an address space that
ranges from 0 to 65,535.
i
Memory addresses are defined using unsigned
binary integers.
Example 1
A computer has 32 MB (megabytes) of memory. How many bits
are needed to address any single byte in memory?
Solution
The memory address space is 32 MB, or 225 (25 × 220). This
means that we need log2 225, or 25 bits, to address each byte.

Example 2
A computer has 128 MB of memory. Each word in this computer
is eight bytes. How many bits are needed to address any single
word in memory?
Solution
The memory address space is 128 MB, which means 227.
However, each word is eight (23) bytes, which means that we
have 224 words. This means that we need log2 224, or 24 bits, to
address each word.
 MEMORY OPERATIONS

• Today, general-purpose computers use a set of instructions called a

program to process data.

• A computer executes the program to create output data from input

data

• Both program instructions and data operands are stored in memory

• Two basic operations requires in memory access

• Load operation (Read or Fetch)-Contents of specified
memory location are read by processor
• Store operation (Write)- Data from the processor is stored in
specified memory location
 Assignment of Byte Address

• Big-endian and little-endian are terms that

describe the order in which a sequence of
bytes are stored in computer memory. Big-
endian is an order in which the "bigend"
(most significant value in the sequence) is
stored first (at the lowest storage address).
 Assignment of byte addresses

• Little Endian (e.g., in DEC, Intel)

» low order byte stored at lowest address
» byte0 byte1 byte2 byte3

• Eg: 46,78,96,54 (32 bit data)

• H BYTE L BYTE

• 8000 54
• 8001 96
• 8002
78
• 8003
• 8004 46

|
 Big Endian

• Big Endian (e.g., in IBM, Motorolla, Sun, HP)

» high order byte stored at lowest address
» byte3 byte2 byte1 byte0

• Programmers/protocols should be careful

when transferring binary data between Big
Endian and Little Endian machines
Big-Endian and Little-Endian
Assignments
Big-Endian: lower byte addresses are used for the most significant bytes of the word
Little-Endian: opposite ordering. lower byte addresses are used for the less significant bytes of the
word
Word
address Byte address Byte address

0 0 1 2 3 0 3 2 1 0

4 4 5 6 7 4 7 6 5 4

• •
• •
• •

k k k k k k k k k k
2 -4 2 -4 2 -3 2- 2 2 - 1 2 - 4 2- 1 2 - 2 2 -3 2 -4

(a) Big-endian assignment (b) Little-endian assignment

Figure 2.7. Byte and word addressing.

• In case of 16 bit data, aligned words begin at
byte addresses of 0,2,4,………………………….
• In case of 32 bit data, aligned words begin at
byte address of 0,4,8,………………………….
• In case of 64 bit data, aligned words begin at
byte addresses of 0,8,16,………………………..
• In some cases words can start at an arbitrary
byte address also then, we say that word
locations are unaligned
 Instruction and
Instruction Sequencing
• INSTRUCTION SET ARCHITECTURE:-Complete
instruction set of the processor

• BASIC 4 TYPES OF OPERATION:-

• Data transfer between memory and
processor register
• Arithmetic and logic operation
• Program sequencing and control
• I/O transfer
 Register transfer notation (RTN)

Transfer between processor registers & memory, between

processor register & I/O devices

Memory locations, registers and I/O register names are

identified by a symbolic name in uppercase alphabets

• LOC,PLACE,MEM are the address of memory location

• R1 , R2,… are processor registers
• DATA_IN, DATA_OUT are I/O registers
•Contents of location is indicated by using square
brackets [ ]

•RHS of RTN always denotes a values, and is called

Source

•LHS of RTN always denotes a symbolic name where

value is to be stored and is called destination

•Source contents are not modified

•Destination contents are overwritten

Examples of RTN statements

• R2 [LOCN]

• R4 [R3] +[R2]
 ASSEMBLY LANGUAGE
NOTATION (ALN)
• RTN is easy to understand and but cannot be
used to represent machine instructions
• Mnemonics can be converted to machine
language, which processor understands
using assembler
Eg:
1. MOVE LOCN, R2
2. ADD R3, R2, R4
 TYPES OF INSTRUCTION

 Three address instruction

•Syntax: Operation source 1, source 2, destination

•Eg: ADD D,E,F where D,E,F are memory location
•Advantage: Single instruction can perform the complete
operation
•Disadvantage : Instruction code will be too large to fit in
one word location in memory
TWO ADDRESS INSTRUCTION
•Syntax : Operation source, destination

•Eg: MOVE E,F MOVE D,F

ADD D,F OR ADD E,F

Perform ADD A,B,C using 2 instructions

MOVE B,C
ADD A,C

Disadvantage: Single instruction is not sufficient to perform

the entire operation.
ONE ADDRESS INSTRUCTION

• Syntax- Operation source/destination

• In this type either a source or destination
operand is mentioned in the instruction
• Other operand is implied to be a processor
register called Accumulator
• Eg: ADD B (general)
• Load D; ACC [memlocation _D]
• ADD E; ACC (ACC) +(E)
• STORE F; memlocation_ F (ACC )
 Zero address instruction

• Location of all operands are defined implicitly

• Operands are stored in a structure called

pushdown stack
 Continued

 If processor supports ALU operations one data in memory and

other in register then the instruction sequence is
• MOVE D, Ri
• ADD E, Ri
• MOVE Ri, F
 If processor supports ALU operations only with registers then
one has to follow the instruction sequence given below
• LOAD D, Ri
• LOAD E, Rj
• ADD Ri, Rj
• MOVE Rj, F
 Instruction Formats

Example: Evaluate (A+B)  (C+D)

• Three-Address
1. ADD R1, A, B ; R1 ← M[A] +
M[B]
2. ADD R2, C, D ; R2 ← M[C] +
M[D]
3. MUL X, R1, R2 ; M[X] ← R1 
R2
 Instruction Formats

Example: Evaluate (A+B)  (C+D)

• Two-Address
1. MOV R1, A ; R1 ← M[A]
2. ADD R1, B ; R1 ← R1 +
M[B]
3. MOV R2, C ; R2 ← M[C]
4. ADD R2, D ; R2 ← R2 +
M[D]
5. MUL R1, R2 ; R1 ← R1 
R2
6. MOV X, R1 ; M[X] ← R1
 Instruction Formats

Example: Evaluate (A+B)  (C+D)

• One-Address
1. LOAD A ; AC ← M[A]
2. ADD B ; AC ← AC +
M[B]
3. STORE T ; M[T] ← AC
4. LOAD C ; AC ← M[C]
5. ADD D ; AC ← AC +
M[D]
6. MUL T ; AC ← AC 
M[T]
 Instruction Formats

Example: Evaluate (A+B)  (C+D)

• Zero-Address
1. PUSH A ; TOS ← A
2. PUSH B ; TOS ← B
3. ADD ; TOS ← (A +
B)
4. PUSH C ; TOS ← C
5. PUSH D ; TOS ← D
6. ADD ; TOS ← (C +
D)
7. MUL ; TOS ←
 Basic Instruction Cycle

• Basic computer operation cycle

– Fetch the instruction from memory into a control
register (PC)
– Decode the instruction
– Locate the operands used by the instruction
– Fetch operands from memory (if necessary)
– Execute the operation in processor registers
– Store the results in the proper place
– Go back to step 1 to fetch the next instruction
 INSTRUCTION EXECUTION & STRIAGHT LINE
SEQUENCING
Address Contents
Move A,R0

}
Begin execution here i
i+4 Add B,R0
3-instruction program
i+8 Move R0,C
. segment
.
.

A
.
.
.

B Data for Program

. C [A]+[B]
.

C
• PC – Program counter: hold the address of the next
instruction to be executed
• Straight line sequencing: If fetching and executing of
instructions is carried out one by one from successive
addresses of memory, it is called straight line sequencing.
• Major two phase of instruction execution
• Instruction fetch phase: Instruction is fetched form
memory and is placed in instruction register IR
• Instruction execute phase: Contents of IR is decoded and
processor carries out the operation either by reading data
from memory or registers.
 BRANCHING

A straight line program for adding n numbers

Using a loop to add n numbers

 BRANCHING
• Branch instruction are those which changes the normal
sequence of execution.

• Sequence can be changed either conditionally or

unconditionally.

• Accordingly we have conditional branch instructions

and unconditional branch instruction.

• Conditional branch instruction changes the sequence

only when certain conditions are met.

• Unconditional branch instruction changes the sequence

of execution irrespective of condition of the results.
 CONDITION CODES
 CONDITIONAL CODE FLAGS: The processor keeps track of
information about the results of various operations for
use by subsequent conditional branch instructions

• N – Negative 1 if results are Negative

0 if results are Positive
• Z – Zero 1 if results are Zero
0 if results are Non zero
• V – Overflow 1 if arithmetic overflow occurs
0 non overflow occurs
• C – Carry 1 if carry and from MSB bit
0 if there is no carry from MSB bit
Conditional Branch Instructions

A: 11110000
• Example:
– A: 1 1 1 1 0 0 0 0 +(−B): 1 1 1 0 1 1 0 0

– B: 0 0 0 1 0 1 0 0 11011100

C=1 Z=0
S=1
V=0
Overflow occurs when the magnitude of a
number exceeds the range allowed by the size of
the bit field
 Status Bits

Cn-1
A B

Cn ALU
F
V Z S C
Fn-1

Zero Check
Figure Format and different instruction types
 Processing the instructions
Simple computer, like most computers, uses machine cycles.

A cycle is made of three phases: fetch, decode and execute.

During the fetch phase, the instruction whose address is determined by

the PC is obtained from the memory and loaded into the IR. The PC is
then incremented to point to the next instruction.

During the decode phase, the instruction in IR is decoded and the

required operands are fetched from the register or from memory.

During the execute phase, the instruction is executed and the results are
placed in the appropriate memory location or the register.

Once the third phase is completed, the control unit starts the cycle again,
but now the PC is pointing to the next instruction.
The process continues until the CPU reaches a HALT instruction.
 Types of Addressing Modes
The different ways in which the location of the operand is
specified in an instruction are referred to as addressing
modes

• Immediate Addressing
• Direct Addressing
• Indirect Addressing
• Register Addressing
• Register Indirect Addressing
• Relative Addressing
• Indexed Addressing
 Immediate Addressing

• Operand is given explicitly in the instruction

• Operand = Value
• e.g. ADD 5
– Add 5 to contents of accumulator
– 5 is operand
• No memory reference to fetch data
• Fast
• Limited range

Instruction
opcode
operand
 Direct Addressing
• Address field contains address of operand
• Effective address (EA) = address field (A)
• e.g. ADD A
– Add contents of cell A to accumulator
– Look in memory at address A for operand
• Single memory reference to access data
• No additional calculations to work out effective address
• Limited address space
Direct Addressing Diagram

Instruction
Opcode Address A
Memory

Operand
 Indirect Addressing (1)

• Memory cell pointed to by address field

contains the address of (pointer to) the
operand
• EA = [A]
– Look in A, find address (A) and look there for
operand
• e.g. ADD (A)
– Add contents of cell pointed to by contents of A to
accumulator
 Indirect Addressing (2)

• Large address space

• 2n where n = word length
• May be nested, multilevel, cascaded
– e.g. EA = (((A)))
• Draw the diagram yourself
• Multiple memory accesses to find operand
• Hence slower
 Indirect Addressing Diagram
Instruction
Opcode Address A
Memory

Pointer to operand

Operand
 Register Addressing (1)

• Operand is held in register named in address

field
• EA = R
• Limited number of registers
• Very small address field needed
– Shorter instructions
– Faster instruction fetch
 Register Addressing (2)

• No memory access

• Very fast execution

• Very limited address space

• Multiple registers helps performance

– Requires good assembly programming or compiler
writing
Register Addressing Diagram

Instruction
Opcode Register Address R
Registers

Operand
 Register Indirect
Addressing
• C.f. indirect addressing
• EA = [R]
• Operand is in memory cell pointed to by
contents of register R
• Large address space (2n)
• One fewer memory access than indirect
addressing
 Register Indirect
Addressing Diagram

Instruction
Opcode Register Address R
Memory

Registers

Pointer to Operand Operand

 Indexed Addressing
• EA = X + [R]
• Address field hold two values
– X = constant value (offset)
– R = register that holds address of memory
locations
– or vice versa
 (Offset given as constant or in the index register)
Add 20(R1),R2 or Add 1000(R1),R2
Indexed Addressing Diagram

Instruction
Opcode Register R Constant Value
Memory

Registers

Pointer to Operand + Operand

 Relative Addressing

• A version of displacement addressing

• R = Program counter, PC
• EA = X + (PC)
• i.e. get operand from X bytes away from
current location pointed to by PC
• c.f locality of reference & cache usage
 Auto increment mode

• The effective address of the operand is the

contents of a register specified in the instruction.
• After accessing the operand, the contents of this
register are automatically incremented to point
to the next item in the list
• EA=[Ri]; Increment Ri ---- (Ri)+
Eg: Add (R2)+,R0
 Auto decrement mode

• The contents of a register specified in the

instruction are first automatically
decremented and are then used as the
effective address of the operand

• Decrement Ri; EA= [Ri] ----- -(Ri)

 Addressing Modes

• Implied mode
– The operand is specified implicitly in the definition
of the opcode.
• Immediate mode
– The actual operand is specified in the instruction
itself.
Addressing Modes (Summary)

Base register LDA #ADRS(R1) ACC <- M[R1+ADRS]

 Assembly Language

Mnemonics
Assembly Language
Assembler
Assembler Directives
Assembly language is mostly a thin layer above the machine
structure. An assembly language is a low-level programming
language for a  computer, microcontroller, or other
programmable device, in which each statement corresponds
to a single machine code instruction. Each assembly language
is specific to a particular computer architecture, in contrast to
most high-level programming languages, which are generally
portable across multiple systems. Assembly language is
converted into executable machine code by a utility program
referred to as an assembler; the conversion process is referred
to as assembly, or assembling the code.
 An assembler directive is a message to the assembler that tells the assembler something it
needs to know in order to carry out the assembly process; for example, an assemble directive
tells the assembler where a program is to be located in memory. 
Examples of common assembler directives are ORG (origin), EQU (equate), and DS.B (define
space for a byte). 
Equate 

The EQU assembler directive simply equates a symbolic name to a numeric value. Consider: 
Sunday EQU 1 
Monday EQU 2 

The assembler substitutes the equated value for the symbolic name; for example, if you write
the instruction ADD.B #Sunday,D2, the assembler treats it as if it were ADD.B #1,D2. 

You could also write 

Sunday EQU 1 
Monday EQU Sunday + 1 

In this case, the assembler evaluates "Sunday + 1" as 1 + 1 and assigns the value 2 to the
symbolic name "Monday".
ORG
sets the current origin to a new value. This is used to
set the program or register address during assembly.
For example, ORG 0100h tells the assembler to
assemble all s
Subsequent code starting at address 0100h.
 
DS
Defines an amount of free space. No code is
generated. This is sometimes used for allocating
variable space.
Basic Input/Output
Operations
 I/O

• The data on which the instructions operate

are not necessarily already stored in memory.
• Data need to be transferred between
processor and outside world (disk, keyboard,
etc.)
• I/O operations are essential, the way they are
performed can have a significant effect on the
performance of the computer.
 Program-Controlled I/O
Example

• Read in character input from a keyboard and

produce character output on a display screen.
 Rate of data transfer (keyboard, display, processor)
 Difference in speed between processor and I/O device creates
the need for mechanisms to synchronize the transfer of data.
 A solution: on output, the processor sends the first character
and then waits for a signal from the display that the character
has been received. It then sends the second character. Input is
sent from the keyboard in a similar way.
 Program-Controlled I/O
Example

Bus

Processor
DATAIN DATAOUT

SIN SOUT
- Registers
- Flags Keyboard Display
- Device interface

Figure 2.19 Bus connection for processor, keyboard, and display.

 Program-Controlled I/O
Example

• Machine instructions that can check the state

of the status flags and transfer data:
READWAIT Branch to READWAIT if SIN = 0
Input from DATAIN to R1

WRITEWAIT Branch to WRITEWAIT if SOUT = 0

Output from R1 to DATAOUT
 Program-Controlled I/O
Example

• Memory-Mapped I/O – some memory address

values are used to refer to peripheral device
buffer registers. No special instructions are
needed. Also use device status registers.

READWAIT Testbit #3, INSTATUS

Branch=0 READWAIT
MoveByte DATAIN, R1
 Program-Controlled I/O
Example

• Assumption – the initial state of SIN is 0 and the

initial state of SOUT is 1.
• Any drawback of this mechanism in terms of
efficiency?
– Two wait loopsprocessor execution time is wasted
• Alternate solution?
– Interrupt
 I/O

• The data on which the instructions operate

are not necessarily already stored in memory.
• Data need to be transferred between
processor and outside world (disk, keyboard,
etc.)
• I/O operations are essential, the way they are
performed can have a significant effect on the
performance of the computer.
Evolution of parallel
computers
What is Parallel Computing?

– Parallel Processing Systems are designed to speed

up the execution of programs by dividing the
program into multiple fragments and processing
these fragments simultaneously
What is Parallel Computing?

• In the simplest sense, parallel computing is the simultaneous use of multiple

compute resources to solve a computational problem.
– To be run using multiple CPUs
– A problem is broken into discrete parts that can be solved concurrently
– Each part is further broken down to a series of instructions
• Instructions from each part execute simultaneously on different CPUs
 Flynn's Classical Taxonomy

• There are different ways to classify parallel

computers. One of the more widely used
classifications, in use since 1966, is called Flynn's
Taxonomy.
• Flynn's taxonomy distinguishes multi-processor
computer architectures according to how they can
be classified along the two independent dimensions
of Instruction and Data. Each of these dimensions
can have only one of two possible states: Single or
Multiple.
 Flynn Matrix

• The matrix below defines the 4 possible

classifications according to Flynn
Single Instruction, Single Data
(SISD)
• A serial (non-parallel) computer
• Single instruction: only one instruction
stream is being acted on by the CPU
during any one clock cycle
• Single data: only one data stream is being
used as input during any one clock cycle
• Deterministic execution
• This is the oldest and until recently, the
most prevalent form of computer
• Examples: most PCs, single CPU
workstations and mainframes
 Single Instruction, Multiple
Datacomputer
• A type of parallel (SIMD)
• Single instruction: All processing units execute the same instruction at any given clock
cycle
• Multiple data: Each processing unit can operate on a different data element
• This type of machine typically has an instruction dispatcher, a very high-bandwidth
internal network, and a very large array of very small-capacity instruction units.
• Best suited for specialized problems characterized by a high degree of regularity,such as
image processing.
• Synchronous (lockstep) and deterministic execution
• Two varieties: Processor Arrays and Vector Pipelines
• Examples:
– Processor Arrays: Connection Machine CM-2, Maspar MP-1, MP-2
– Vector Pipelines: IBM 9000, Cray C90, Fujitsu VP, NEC SX-2, Hitachi S820
 Multiple Instruction, Single
Datastream
• A single data (MISD)
is fed into multiple processing units.
• Each processing unit operates on the data independently via
independent instruction streams.
• Few actual examples of this class of parallel computer have ever
existed. One is the experimental Carnegie-Mellon C.mmp computer
(1971).
• Some conceivable uses might be:
– multiple frequency filters operating on a single signal stream
• multiple cryptography algorithms attempting to crack a single coded
message.
Multiple Instruction, Multiple
Data
• Currently, (MIMD)
the most common type of parallel computer. Most modern
computers fall into this category.
• Multiple Instruction: every processor may be executing a different
instruction stream
• Multiple Data: every processor may be working with a different data
stream
• Execution can be synchronous or asynchronous, deterministic or non-
deterministic
• Examples: most current supercomputers, networked parallel
computer "grids" and multi-processor SMP computers - including
some types of PCs.
Performance
 Performance

• The most important measure of a computer is

how quickly it can execute programs.
• Three factors affect performance:
 Hardware design
 Instruction set
 Compiler
 Performance

• Processor time to execute a program depends on the hardware

involved in the execution of individual machine instructions.

Main Cache
memory memory Processor

Bus

Figure 1.5. The processor cache.

 Performance

• The processor and a relatively small cache

memory can be fabricated on a single
integrated circuit chip.
• Speed
• Cost
• Memory management
 Processor Clock

• Processor Ckts are controlled by a timing signal

called Clock.
• clock cycle, and clock rate
• The execution of each instruction is divided into
several steps, each of which completes in one
clock cycle.
• Hertz – cycles per second
• 500 million cycles per second-500MHz
• 1250- million cycles per second-1.25GHz
 Basic Performance Equation

• T – processor time required to execute a program that has been

prepared in high-level language
• N – number of actual machine language instructions needed to
complete the execution (note: loop)
• S – average number of basic steps needed to execute one machine
instruction. Each step completes in one clock cycle
• R – clock rate
• Note: these are not independent to each other

N S
T
R
How to improve T?
 Pipeline and Superscalar
Operation
• Instructions are not necessarily executed one after another.
• The value of S doesn’t have to be the number of clock cycles
to execute one instruction.
• Pipelining – overlapping the execution of successive
instructions.
• Pipelining is an implementation technique where
multiple instructions are overlapped in execution.
The computer pipeline is divided in stages. Each stage
completes a part of an instruction in parallel.
• Add R1, R2, R3
• Superscalar operation – multiple instruction pipelines are
implemented in the processor.
• Goal – reduce S (could become <1!)
 Clock Rate

• Increase clock rate

 Improve the integrated-circuit (IC) technology to make the
circuits faster
 Reduce the amount of processing done in one basic step
(however, this may increase the number of basic steps
needed)
• Increases in R that are entirely caused by
improvements in IC technology affect all
aspects of the processor’s operation equally
except the time to access the main memory.
 CISC and RISC

• Tradeoff between N and S

• A key consideration is the use of pipelining
 S is close to 1 even though the number of basic steps per
instruction may be considerably larger
 It is much easier to implement efficient pipelining in processor
with simple instruction sets
• Reduced Instruction Set Computers (RISC)
• Complex Instruction Set Computers (CISC)
 Compiler

• A compiler translates a high-level language program into

a sequence of machine instructions.
• To reduce N, we need a suitable machine instruction set
and a compiler that makes good use of it.
• Goal – reduce N×S
• A compiler may not be designed for a specific processor;
however, a high-quality compiler is usually designed for,
and with, a specific processor.
 Performance Measurement

• T is difficult to compute.
• Measure computer performance using benchmark programs.
• System Performance Evaluation Corporation (SPEC) selects and publishes
representative application programs for different application domains,
together with test results for many commercially available computers.
• Compile and run (no simulation)
• Reference computer

Running time on the reference computer

SPEC rating 
Running time on the computer under test
n 1
SPEC rating  (  SPEC i ) n

i 1
 Multiprocessors and
Multicomputers

• Multiprocessor computer
 Execute a number of different application tasks in parallel
 Execute subtasks of a single large task in parallel
 All processors have access to all of the memory – shared-memory
multiprocessor
 Cost – processors, memory units, complex interconnection networks
• Multicomputers
 Each computer only have access to its own memory
 Exchange message via a communication network – message-passing
multicomputers
• Evolution of Computer Architecture − In last four decades,
computer architecture has gone through revolutionary
changes. We started with Von Neumann architecture and
now we have multicomputers and multiprocessors.
• Performance of a computer system − Performance of a
computer system depends both on machine capability and
program behavior. Machine capability can be improved
with better hardware technology, advanced architectural
features and efficient resource management. Program
behavior is unpredictable as it is dependent on application
and run-time conditions
• Multiprocessors and Multicomputers
• In this section, we will discuss two types of parallel computers −
• Multiprocessors
• Multicomputers
• Shared-Memory Multicomputers
• Three most common shared memory multiprocessors models are −
• Uniform Memory Access (UMA)
• In this model, all the processors share the physical memory uniformly. All the
processors have equal access time to all the memory words. Each processor may
have a private cache memory. Same rule is followed for peripheral devices.
• When all the processors have equal access to all the peripheral devices, the
system is called a symmetric multiprocessor. When only one or a few processors
can access the peripheral devices, the system is called an asymmetric
multiprocessor.
• Non-uniform Memory Access (NUMA)
• In NUMA multiprocessor model, the access
time varies with the location of the memory
word. Here, the shared memory is physically
distributed among all the processors, called
local memories. The collection of all local
memories forms a global address space which
can be accessed by all the processors.
 Cache Only Memory Architecture (COMA)
The COMA model is a special case of the NUMA model. Here,
all the distributed main memories are converted to cache
memories
• Distributed - Memory Multicomputers − A
distributed memory multicomputer system consists
of multiple computers, known as nodes, inter-
connected by message passing network. Each node
acts as an autonomous computer having a
processor, a local memory and sometimes I/O
devices. In this case, all local memories are private
and are accessible only to the local processors. This
is why, the traditional machines are called no-
remote-memory-access (NORMA)machines.