ECEG-3202 Computer Architecture and Organization

Slides:



Advertisements
Similar presentations
Instruction Set Design
Advertisements

Computer Organization and Architecture
Computer Organization and Architecture
Chapter 11 Instruction Sets
The Central Processing Unit Instruction Sets: Addressing Modes and Formats.
1 Registers and MAL - Part I. Motivation So far there are some details that we have ignored instructions can have different formats most computers have.
Mod-Mod Pengalamat Segera (Immediate) Terus (Direct)
CH11 Instruction Sets: Addressing Modes and Formats
Pentium Addressing Modes
CH12 CPU Structure and Function
Processor Organization and Architecture Module III.
Instruction Set Architecture
COMPUTER ORGANIZATION AND ASSEMBLY LANGUAGE Lecture 15 & 16 Stacks, Endianness Addressing Modes Course Instructor: Engr. Aisha Danish.
Homework Problems 1. M1 runs the program P in 1.4 * 9 * ns or ns M2 runs the program P in 1.6*9800*10ns or ns Hence M2 is faster by.
Module 3 Instruction Set Architecture (ISA): ISA Level Elements of Instructions Instructions Types Number of Addresses Registers Types of Operands.
Instruction Sets: Characteristics Functions Addressing Modes Formats Chapter7:
COMPUTER ARCHITECURE INSTRUCTION SET ARCHITECTURE.
Computer Organization
Chapter 11 Instruction Sets: Addressing Modes and Formats
Represents different voltage levels High: 5 Volts Low: 0 Volts At this raw level a digital computer is instructed to carry out instructions.
ECEG-3202 Computer Architecture and Organization Chapter 6 Instruction Sets: Addressing Modes and Formats.
Chapter 11 Instruction Sets: Addressing Modes and Formats Gabriel Baron Sydney Chow.
Instruction Sets: Addressing modes and Formats Group #4  Eloy Reyes  Rafael Arevalo  Julio Hernandez  Humood Aljassar Computer Design EEL 4709c Prof:
Addressing Modes and Formats
WEEK 3 I/O Port Programming ET2640 Microprocessors and Microcontrollers.
EKT 422/4 COMPUTER ARCHITECTURE SoME-0809-I 1 Chapter 3a Instruction Sets: Characteristics and Functions.
MicroProcessors Lec. 3 Dr. Tamer Samy Gaafar. Course Web Page
Computer Architecture
İnformasiya texnologiyaları kafedrası Mövzu № 7. Ünvanlaşdırma üsulları. (Ünvanlaşdırma rejimləri. Bilavasitə ünvanlaşdırma. Birbaşa ünvanlaşdırma. Registrli.
Computer Architecture. Instruction Set “The collection of different instructions that the processor can execute it”. Usually represented by assembly codes,
Displacement (Indexed) Stack
Overview of Instruction Set Architectures
William Stallings Computer Organization and Architecture 6th Edition
Immediate Addressing Mode
Chapter 11 Instruction Sets
A Closer Look at Instruction Set Architectures
William Stallings Computer Organization and Architecture 8th Edition
Alvaro Mauricio Peña Dariusz Niworowski Frank Rodriguez
A Closer Look at Instruction Set Architectures
William Stallings Computer Organization and Architecture 8th Edition
Asst. Prof. Dr. Gazi Erkan BOSTANCI Slides are mainly based on
Processor Organization and Architecture
BIC 10503: COMPUTER ARCHITECTURE
Central Processing Unit
Processor Organization and Architecture
Stack Relative Deferred (sf) Indexed (x) Stack Indexed (sx)
Computer Architecture and the Fetch-Execute Cycle
ECEG-3202 Computer Architecture and Organization
Computer Architecture
Stack Relative Deferred (sf) Indexed (x) Stack Indexed (sx)
ECEG-3202 Computer Architecture and Organization
Chapter 11 Processor Structure and function
William Stallings Computer Organization and Architecture 8 th Edition Chapter 11 Instruction Sets: Addressing Modes and Formats.
COMPUTER ORGANIZATION AND ARCHITECTURE
CS-447– Computer Architecture M,W 10-11:20am Lecture 5 Instruction Set Architecture Sep 12th, 2007 Majd F. Sakr
Asst. Prof. Dr. Gazi Erkan BOSTANCI Slides are mainly based on
Presentation transcript:

ECEG-3202 Computer Architecture and Organization Chapter 6 Instruction Sets: Addressing Modes and Formats

Displacement (Indexed) Stack Addressing Modes Immediate Direct Indirect Register Register Indirect Displacement (Indexed) Stack 2

Operand is part of instruction Operand = address field e.g. ADD 5 Immediate Addressing Operand is part of instruction Operand = address field e.g. ADD 5 Add 5 to contents of accumulator 5 is operand No memory reference to fetch data Fast Limited range 3

Immediate Addressing Diagram Instruction Opcode Operand 4

Address field contains address of 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 5

Direct Addressing Diagram Instruction Opcode Address A Memory Operand 6

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 7

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 8

Indirect Addressing Diagram Instruction Opcode Address A Memory Pointer to operand Operand 9

Register Addressing (1) Operand is held in register named in address filed EA = R Limited number of registers Very small address field needed Shorter instructions Faster instruction fetch 10

Register Addressing (2) No memory access Very fast execution Very limited address space Multiple registers helps performance Requires good assembly programming or compiler writing N.B. C programming register int a; c.f. Direct addressing 11

Register Addressing Diagram Instruction Opcode Register Address R Registers Operand 12

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 13

Register Indirect Addressing Diagram Instruction Opcode Register Address R Memory Registers Pointer to Operand Operand 14

Displacement Addressing EA = A + (R) Address field hold two values A = base value R = register that holds displacement or vice versa 15

Displacement Addressing Diagram Instruction Opcode Register R Address A Memory Registers Pointer to Operand + Operand 16

A version of displacement addressing R = Program counter, PC Relative Addressing A version of displacement addressing R = Program counter, PC EA = A + (PC) i.e. get operand from A cells from current location pointed to by PC c.f locality of reference & cache usage 17

Base-Register Addressing A holds displacement R holds pointer to base address R may be explicit or implicit e.g. segment registers in 80x86 18

Good for accessing arrays Indexed Addressing A = base R = displacement EA = A + (R) Good for accessing arrays (R)++ 19

Combinations Postindex EA = (A) + (R) Preindex EA = (A+(R)) (Draw the diagrams) 20

Operand is (implicitly) on top of stack e.g. Stack Addressing Operand is (implicitly) on top of stack e.g. ADD Pop top two items from stack and add 21

Instruction Formats Layout of bits in an instruction Includes opcode Includes (implicit or explicit) operand(s) Usually more than one instruction format in an instruction set

Assembler Machines store and understand binary instructions E.g. N= I + J + K initialize I=2, J=3, K=4 Program starts in location 101 Data starting 201 Code: Load contents of 201 into AC Add contents of 202 to AC Add contents of 203 to AC Store contents of AC to 204 Tedious and error prone

Program in: Binary Hexadecimal Address Contents 101 0010 2201 102 0001 1202 103 1203 104 0011 3204 201 0000 0002 202 0003 203 0004 204

Use hexadecimal rather than binary Improvements Use hexadecimal rather than binary Code as series of lines Hex address and memory address Need to translate automatically using program Add symbolic names or mnemonics for instructions Three fields per line Location address Three letter opcode If memory reference: address Need more complex translation program

Symbolic Program Address Instruction 101 LDA 201 102 ADD 202 103 203 104 STA 204 DAT 2 3 4

First field (address) now symbolic Symbolic Addresses First field (address) now symbolic Memory references in third field now symbolic Now have assembly language and need an assembler to translate Assembler used for some systems programming Compliers I/O routines

Assembler Program Label Operation Operand FORMUL LDA I ADD J K STA N DATA 2 3 4