Scribd
Upload
141 views28 pages

ECEG-3202 Computer Architecture and Organization Instruction Sets: Characteristics and Functions

An instruction set defines the operations a CPU can perform. It includes operation codes, source and result operands, and next instruction references. Operands can be in memory, registers, or I/O devices. Instructions are represented in machine code as unique bit patterns and symbolically in assembly code. Instruction formats vary based on the number of addresses, from 3 to 0 addresses. Instruction types include data processing, storage, movement, flow control, and system operations. Characteristics like byte order, data types, and transfer methods impact the design of the instruction set.

Uploaded by

ESTIFANOS Nega
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
141 views28 pages

ECEG-3202 Computer Architecture and Organization Instruction Sets: Characteristics and Functions

An instruction set defines the operations a CPU can perform. It includes operation codes, source and result operands, and next instruction references. Operands can be in memory, registers, or I/O devices. Instructions are represented in machine code as unique bit patterns and symbolically in assembly code. Instruction formats vary based on the number of addresses, from 3 to 0 addresses. Instruction types include data processing, storage, movement, flow control, and system operations. Characteristics like byte order, data types, and transfer methods impact the design of the instruction set.

Uploaded by

ESTIFANOS Nega
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 28

ECEG-3202 Computer Architecture

and Organization

Chapter 5
Instruction Sets:
Characteristics and Functions
What is an Instruction Set?
• The complete collection of instructions
that are understood by a CPU
• Machine Code
• Binary
• Usually represented by assembly codes
Elements of an Instruction
• Operation code (Op code)
—Do this
• Source Operand reference
—To this
• Result Operand reference
—Put the answer here
• Next Instruction Reference
—When you have done that, do this...
Where have all the Operands Gone?
• Main memory (or virtual memory or
cache)
• CPU register
• I/O device
• Immediate
Instruction Representation
• In machine code each instruction has a
unique bit pattern
• For human consumption (well,
programmers anyway) a symbolic
representation is used
—e.g. ADD, SUB, LOAD
• Operands can also be represented in this
way
—ADD A,B
Simple Instruction Format
Instruction Types
• Data processing
• Data storage (main memory)
• Data movement (I/O)
• Program flow control
Number of Addresses (a)
• 3 addresses
—Operand 1, Operand 2, Result
—a = b + c;
—Not common
—Needs very long words to hold everything
Number of Addresses (b)
• 2 addresses
—One address doubles as operand and result
—a = a + b
—Reduces length of instruction
—Requires some extra work
– Temporary storage to hold some results
Number of Addresses (c)
• 1 address
—Implicit second address
—Usually a register (accumulator)
—Common on early machines
Number of Addresses (d)
• 0 (zero) addresses
—All addresses implicit
—Uses a stack
—e.g. push a
— push b
— add
— pop c

—c = a + b
How Many Addresses
• More addresses
—More complex (powerful?) instructions
—Fewer instructions per program
• Fewer addresses
—Less complex (powerful?) instructions
—More instructions per program
—Faster fetch/execution of instructions
Types of Operand
• Addresses
• Numbers
—Integer/floating point
• Characters
—ASCII etc.
• Logical Data
—Bits or flags
Byte Order
(A portion of chips?)
• What order do we read numbers that
occupy more than one byte
• e.g. (numbers in hex to make it easy to
read)
• 0x12345678 can be stored in 4x8bit
locations as follows
Byte Order (example)
• Address Value (1) Value(2)
• 184 12 78
• 185 34 56
• 186 56 34
• 186 78 12

• i.e. read top down or bottom up?


Byte Order Names
• The problem is called Endian
• The system on the left has the least
significant byte in the highest address
• This is called big-endian
• The system on the right has the least
significant byte in the lowest address
• This is called little-endian
Types of Operation
• Data Transfer
• Arithmetic
• Logical
• Conversion
• I/O
• System Control
• Transfer of Control
Data Transfer
• Specify
—Source
—Destination
—Amount of data
• May be different instructions for different
movements
—e.g. IBM 370
• Or one instruction and different addresses
—e.g. VAX
Arithmetic
• Add, Subtract, Multiply, Divide
• Signed Integer
• Floating point ?
• May include
—Increment (a++)
—Decrement (a--)
—Negate (-a)
Shift and Rotate Operations
Logical
• Bitwise operations
• AND, OR, NOT
Conversion
• E.g. Binary to Decimal
Input/Output
• May be specific instructions
• May be done using data movement
instructions (memory mapped)
• May be done by a separate controller
(DMA)
Systems Control
• Privileged instructions
• CPU needs to be in specific state
—Kernel mode
• For operating systems use
• Example, access to process control blocks
in a multiprogramming system.
Transfer of Control
• Branch
—e.g. branch to x if result is zero
• Skip
—e.g. increment and skip if zero
—ISZ Register1
—Branch xxxx
—ADD A
• Subroutine call
—c.f. interrupt call
Branch Instruction
Nested Procedure Calls
Use of Stack

You might also like