1 Lecture 6 The CPU and Memory ITEC 1000 “Introduction to Information Technology” [Prof. Peter...

Lecture 6Lecture 6

The CPU and The CPU and MemoryMemory

ITEC 1000 “Introduction to Information Technology”

[Prof. Peter Khaiter]

Pitxot, Antoni Figures of the Allegory of Memory

1981Oil on canvas

180.30 x 90.40 cm. TEATRE-MUSEU DALI

http://www.salvador-dali.org/dali/coleccio

Lecture Template:Lecture Template:

CPUCPU RegistersRegisters Register operationsRegister operations Memory implementationMemory implementation Computer BusesComputer Buses InstructionsInstructions Using the StacksUsing the Stacks Multiple Data InstructionsMultiple Data Instructions

Computer unitComputer unit

Input/outputinterface

Control unit

Program counter

HighestAddress

Memory

Lowest Address

Memory is separated from the CPU

Components of the CPU (1 of 2)Components of the CPU (1 of 2)

ALUALU (arithmetic logic unit)Performs arithmetic and logic operations (data changed)Arithmetic: add, subtract, multiply, divide, etc.Logic: AND, OR, NOT, Shift, etc.Data held temporary

CUCU (control unit): functionsperforms fetch/execute cycle Accesses and retrieves program instructions from the memory and issues commands to the ALUMoves data to and from CPU registers and other hardware components (no change in data)

RegistersRegistersExample: Program counter (PC) or instruction pointer determines next instruction for execution

Components of the CU (2 of 2)Components of the CU (2 of 2)

Program counter (instruction pointer)Contains the address of the current or next instruction Normally instructions are executed sequentially

Memory management unitSupervises fetching of instructions and data from memory

I/O InterfaceProvides mechanism for input/output of datasometimes combined with memory management unit in a single Bus Interface Unit

Concept of RegistersConcept of Registers

Single storage locations within the CPU used for a particular purpose

Used to hold a binary value temporarily Manipulated directly by the Control Unit Each register is wired within the CPU

directly (no address needed) for specific function

Size in bits or bytes (not MB like memory) Can hold data, an address or an instruction

Registers: what they doRegisters: what they do

Hold data being processed Hold instruction being executed Memory or I/O address being

accessed Keep status of the computer Conditional branch instructions

General-Purpose RegistersGeneral-Purpose Registers

User-visible registers Part of ALU Accumulators Typically several dozen in modern CPUs

(R0, R1,…) Hold data of arithmetic operations Hold intermediate results or data values,

e.g., loop counters To transfer data between different

memory locations and between I/0 and memory

Special-Purpose RegistersSpecial-Purpose Registers

Part of CU Program Counter Register (PC) (instruction pointer)

Holds address of the currently executed instruction Instruction Register (IR)

Holds the actual instruction being executed Memory Address Register (MAR)

Holds the address of a memory location Memory Data Register (MDR)

Holds the actual data value from location specified in MAR

Flags (one-bit register) to track special conditions like arithmetic carry and overflow, power failure, internal computer error

Status RegistersSeveral flag registers grouped together

Register OperationsRegister Operations

Load values from other locations (registers and memory)

Destroys (erases) previous value in destination Source register (or memory location) unchangeable

Addition and subtractionResult stored in the register

Shift or rotate (left or right) data Test contents for conditions

zero Positive/negativeTo large

Program Counter ( PC )Program Counter ( PC )

A dedicated register in the CPU

Contains the address in memory of the current instruction being executed.

Incremented automatically after each instruction.

May be forced to change: e.g. “jump” instruction.

Usually initialized to zero when machine starts, or is reset.

Instruction Register ( IR )Instruction Register ( IR )

A dedicated register in the CPU which contains the actual current instruction.

Op Code + Address

What To Do Location of Data

Simple 16-bit example: 1101 101101100100

AccumulatorAccumulator

A dedicated register (or set of registers) in the CPU used for the actual manipulation of data

Default source (or destination) register

Usually contains results of arithmetic or logical operations

Operation of MemoryOperation of Memory

Each memory location has a unique address

Address from an instruction is copied to the MAR which finds the location in memory

CPU determines if it is a store or retrieval

Transfer takes place between the MDR and memory

MDR is a two way register

MAR and MDRMAR and MDR

Memory Address Register (MAR)Contains Address in memory to find or place data

Memory Data Register (MDR)Contains Actual Data to be placed in location given in MAR, or which has been retrieved from location given in MAR

Generic CPU With RegistersGeneric CPU With Registers

Accumulator ( A or Acc )

Instruction Register ( IR )

Memory Address Register ( MAR )

Memory Data Register ( MDR )

Program Counter ( PC )

Memory

MAR, MDR and MemoryMAR, MDR and Memory

Address

MAR-MDR: ExampleMAR-MDR: Example

Individual Memory CellIndividual Memory Cell

Memory CapacityMemory Capacity

Determined by two factors 1. Number of bits in the MAR

• 2K where K = width of the MAR register in bits• 4 bits allow 16 locations• 8 bits allow 256 locations• 32 bits allow 4,294,967,296 or 4 GB

2. Size of each memory location, m

Memory capacity is the product:m x 2K

Typical values:k: 16, 17, 18, 19, 20, 21, 22, etc.m: 8, 16, 32, 64

Memory ImplementationMemory Implementation

Magnetic core (1949/51 – late 1960s/early 1970s

Random Access Memory (RAM) Read Only Memory (ROM) EEPROM Flash ROM Volatile Nonvolatile

RAM: Random Access MemoryRAM: Random Access Memory

Random – any piece of data can be accessed in a constant time regardless of physical location (unlike tapes, magnetic or optical discs)

Difference – in technical design DRAM (Dynamic RAM)

Most common, cheapVolatile: must be refreshed (recharged with power) 1000’s of times each second

SRAM (static RAM)Faster to access than DRAM and more expensive than DRAMVolatilesmall amount used in cache memory for high-speed access

RAM: SampleRAM: Sample

DRAM modules used as primary memory in PCs, workstations, servers.

ROM - Read Only MemoryROM - Read Only Memory

Implemented in early stored-program computers (e.g., ENIAC, after 1948)

If write protected, becomes read-only memory Non-volatile memory to hold built-in software that is not expected to change over

the life of the computer (e.g., initial program that runs computer)

• BIOS: initial boot instructions and diagnostics Data are physically encoded into chips EEPROM

Electrically Erasable Programmable ROMCan be erased and reprogrammed, 1 byte at a time (up to 1000 times)Slower and less flexible than Flash ROM

Flash ROM Modern type of EEPROM (invented in 1984), faster (erase and write in blocks of bytes)Higher endurance (up to 1,000,000 cycles)E.g., USB Flash Drives

ROM: SampleROM: Sample

First erasable ROM, Intel 1702; erase window – in the middle

Memory MapsMemory Maps

The usage of memory space on a system is commonly depicted in a “memory map”

The height of the map is determined by the number of addresses

The width of the map is usually 8 bits E.g.,

a system with a capacity of 216 bytes…

7 6 5 4 3 2 1 0

000200010000

Hexadecimaladdress

Data bitposition

The “bottom” of memory

Memory Map: Sample 1Memory Map: Sample 1

Use of Memory MapsUse of Memory Maps

Memory maps are usually drawn to show “what is where” on a system

“what” can be:RAM, ROM, I/O, empty space

“Where”:Determined by the starting/ending addresses for each “block” of RAM, ROM, I/O,…,

E.g., a memory map for a system with a capacity of 224 bytes with two 1 MB RAM modules residing consecutively at the bottom of memory….

Memory Map: Sample 2Memory Map: Sample 2

FFFFFF

2000001FFFFF

1000000FFFFF

000000

224 bytes = 16 MB “capacity”

1 MB RAM

Memory Space: Exercise 1Memory Space: Exercise 1

Q: A system with a memory capacity of 128 GB has four 32 MB memory modules installed. The rest of the memory is unused. How much memory space is available for future expansion? (Give your answer in decimal in megabytes.)

Skip answer Answer

Answer

Q: A system with a memory capacity of 128 GB has four 32 MB memory modules installed. The rest of the memory is unused. How much memory space is available for future expansion? (Give your answer in decimal in megabytes.)

A: 128 GB – 4 x 32 MB = 27 x 210 MB - 22 x 25 MB= (217 – 27) MB= (131,072 – 128) MB= 130,944 MB 210 = 127.875 GB

Draw a memory map for a system with a capacity of 2 GB. Assume the system has three 32 MB memory modules residing consecutively at the bottom of memory. Illustrate the size of each block in MB and the starting and ending address of each block of memory in hexadecimal.

Skip answer Answer

Answer

7FFFFFFF

0600000005FFFFFF

0400000003FFFFFF

0200000001FFFFFF

00000000

231 bytes = 2 GB “capacity”

32 MB RAM

1,952 MB

32 MB RAM

Note:2 GB = 2,048 MB

Fetch-Execute CycleFetch-Execute Cycle

Two-step process because both instructions and data are in memory

FetchDecode or find instruction, load the code of the instruction from memory

ExecutePerforms operation that instruction requiresMove/transform data

Fetch-part of the CycleFetch-part of the Cycle

The value in the PC (program counter) register is the address of the memory location that holds instruction to be executed

First step is always: transfer (copy) the value in the PC to the MAR

Then computer can retrieve the instruction located at that address and place it in the MDR

PC MAR (step 1) Memory MDR Next step: transfer instruction to the IR MDR IR (step 2) Remaining steps – instruction dependent

Load InstructionLoad Instruction

Next step: the address partaddress part of the instruction located in the IR is copied and placed in the MAR

Computer retrieves actual data located at the address in memory and places it in the MDR

IR [address] MAR (step 3) Memory MDR Next step: MDR copies data to the “accumulator”

register MDR A (step 4) Last step: PC is incremented PC + 1 PC (step 5)

Load Accumulator: Sample (1 of 12)Load Accumulator: Sample (1 of 12)

Task: Simple Eight bit system.

Thirty-two memory locations (0 to 31).

“Load” instruction is 010.

Value in location 15 is ten (i.e.: binary 00001010)

PC is at 5, about to increment.

The instruction, 01001111, is in location 6.

PC: 00101

IR: (previous)

A: (previous)

MAR: (previous)

MDR: (previous)

CPU Before PC increments

Location 31

15: 00001010

06: 01001111

Location 0

Memory

Increment PC: PC = PC + 1

PC: 00110

IR: (previous)

A: (previous)

MAR: (previous)

MDR: (previous)

Location 31

15: 00001010

06: 01001111

Location 0

Memory

PC: 00110

IR: (previous)

A: (previous)

MAR: 00110

MDR: (previous)

MAR loaded with PC: PC -> MAR

Location 31

15: 00001010

06: 01001111

Location 0

Memory

PC: 00110

IR: (previous)

A: (previous)

MAR: 00110

MDR: (previous)

Memory Location 00110 Accessedand Contents Placed in MDR:

Location 31

15: 00001010

06: 01001111

Location 0

Memory

PC: 00110

IR: (previous)

A: (previous)

MAR: 00110

MDR: 01001111

Memory Location 00110 Accessedand Contents Placed in MDR:

Location 31

15: 00001010

06: 01001111

Location 0

Memory

PC: 00110

IR: 01001111

A: (previous)

MAR: 00110

MDR: 01001111

MDR copied to IR: MDR -> IR

Location 31

15: 00001010

06: 01001111

Location 0

Memory

PC: 00110

IR: 01001111

A: (previous)

MAR: 01111

MDR: 01001111

IR [ address part ] -> MAR

Location 31

15: 00001010

06: 01001111

Location 0

Memory

PC: 00110

IR: 01001111

A: (previous)

MAR: 01111

MDR: 01001111

Location in MAR (01111) Accessed

Location 31

15: 00001010

06: 01001111

Location 0

Memory

PC: 00110

IR: 01001111

A: (previous)

MAR: 01111

MDR: 00001010

Contents of 01111 loaded into MDR

Location 31

15: 00001010

06: 01001111

Location 0

Memory

PC: 00110

IR: 01001111

A: 00001010

MAR: 01111

MDR: 00001010

IR [op code] executed: MDR -> A

Location 31

15: 00001010

06: 01001111

Location 0

Memory

PC: 00110

IR: 01001111

A: 00001010

MAR: 01111

MDR: 00001010

Finished !

Location 31

15: 00001010

06: 01001111

Location 0

Load Fetch/Execute CycleLoad Fetch/Execute Cycle

1. PC -> MAR Transfer the address from the PC to the MAR

2. MDR -> IR Transfer the instruction to the IR

3. IR(address) -> MAR Address portion of the instruction loaded in MAR

4. MDR -> A Actual data copied into the accumulator

5. PC + 1 -> PC Program Counter incremented

Store Fetch/Execute Cycle (1 of 2)Store Fetch/Execute Cycle (1 of 2)

4. A -> MDR* Accumulator copies data into MDR

*Notice how Step #4 differs for LOAD and STORE

Store Fetch/Execute Cycle (2 of 2)Store Fetch/Execute Cycle (2 of 2)

PC MAR

MDR IR

IR[address] MAR

PC + 1 PC

Execute

ADD Fetch/Execute CycleADD Fetch/Execute Cycle (1 of 2)(1 of 2)

4. A + MDR -> A Contents of MDR added to contents of accumulator

ADD Fetch/Execute CycleADD Fetch/Execute Cycle (2 of 2)(2 of 2)

PC MAR

MDR IR

IR[address] MAR

A + MDR A

PC + 1 PC

Execute

Add Instruction: Sample (1 of 10)Add Instruction: Sample (1 of 10)

Task: Value in location 7 is 10110010.

“Add” instruction is 101.

Value in location 18 is seventy-one

(i.e.: binary 01000111)

Everything else is as we left it!

PC: 00111

IR: 01001111

A: 00001010

MAR: 01111

MDR: 00001010

PC = PC + 1

Location 31

18: 01000111

15: 00001010

07: 10110010

06: 01001111

Location 0

Memory

PC: 00111

IR: 01001111

A: 00001010

MAR: 00111

MDR: 00001010

PC -> MAR

Location 31

18: 01000111

15: 00001010

07: 10110010

06: 01001111

Location 0

Memory

PC: 00111

IR: 01001111

A: 00001010

MAR: 00111

MDR: 00001010

MAR Accesses Location 00111

Location 31

18: 01000111

15: 00001010

07: 10110010

06: 01001111

Location 0

Memory

PC: 00111

IR: 01001111

A: 00001010

MAR: 00111

MDR: 10110010

Contents of 00111 -> MDR

Location 31

18: 01000111

15: 00001010

07: 10110010

06: 01001111

Location 0

Memory

PC: 00111

IR: 10110010

A: 00001010

MAR: 00111

MDR: 10110010

MDR -> IR

Location 31

18: 01000111

15: 00001010

07: 10110010

06: 01001111

Location 0

Memory

PC: 00111

IR: 10110010

A: 00001010

MAR: 10010

MDR: 10110010

IR [address] -> MAR

Location 31

18: 01000111

15: 00001010

07: 10110010

06: 01001111

Location 0

Memory

PC: 00111

IR: 10110010

A: 00001010

MAR: 10010

MDR: 10110010

Location 10010 [MAR] Accessed

Location 31

18: 01000111

15: 00001010

07: 10110010

06: 01001111

Location 0

Memory

PC: 00111

IR: 10110010

A: 00001010

MAR: 10010

MDR: 01000111

Contents of [10010] -> MDR

Location 31

18: 01000111

15: 00001010

07: 10110010

06: 01001111

Location 0

PC: 00111

IR: 10110010

A: 01010001

MAR: 10010

MDR: 01000111

IR [opcode] executed: A = A + MDR

Location 31

18: 01000111

15: 00001010

07: 10110010

06: 01001111

Location 0

Memory

Computer BusesComputer Buses

PCI Express BUS Card Slots (from top to bottom: x4, x16, x1, x16) compared to a traditional 32-bit PCI bus card slot.

Buses (1 of 3)Buses (1 of 3)

Group of electrical conductors (wires) for carrying signals from one location to another

Line: each conductor (or wire) in the busThe physical connection that makes it

possible to transfer data from one location in the computer system to another

4 kinds of signalsData (alphanumeric, numerical, instructions)AddressesControl signalsPower (sometimes)

Diskcontroller

Graphicscard

Soundcard

Networkcard

Printer

Keyboard

ModemMonitor

Speakers

Computer

Connect CPU and Memory I/O peripherals: on same bus as

CPU/memory or separate bus If connect CPU, Memory and I/O

modules in the same Physical package, called backplanebackplane

Also called system bussystem bus or external busexternal busExample of broadcast busbroadcast busCommon method of connecting CPU, Memory and I/O modules: to a printed circuit board called motherboardmotherboard

MotherboardMotherboard

Types of Buses (1 of 2)Types of Buses (1 of 2)

Point-to-pointPoint-to-point When connect plug-in devices,

called portsports

Serialport

Controlunit ALU

Types of Buses (2 of 2)Types of Buses (2 of 2)

MultipointMultipoint: to connect several points together

Computer

Disk controller

Computer

Computer Computer

Memory

Video controller

Point-to-point vs. MultipointPoint-to-point vs. Multipoint

Bus InterfaceBus Interface

Bus interface bridgesBus interface bridges: provide communication between different buses

Special buses provide interconnections within the CPU chip

Buses that form the backplanebackplaneExternal CPU busPeripheral control interface (PCI) busAccelerated graphic processor (AGP)Accelerated graphic processor (AGP)Industrial standard architecture (ISA)Industrial standard architecture (ISA)

Typical bus and port connectionsTypical bus and port connections

Bus interface bridgesBus interface bridges connect different bus types

Bus CharacteristicsBus Characteristics

ProtocolProtocolDocumented agreement for communicationSpecification that spells out the meaning of each line and each signal on each line

ThroughputThroughput, i.e., data transfer rate in bits per second

Data widthData width in bits carried simultaneously DistanceDistance between two end points Type of signalsType of signals: unique/specialized or

shared Addressing capacityAddressing capacity Etc.

Buses Inside a ComputerBuses Inside a Computer

Data busAddress busControl bus

MemoryI/O Module

I/O Device

Motherboard• Many

configurations possible

Data BusData Bus

Carries data between the CPU and memory or I/O devices

Bi-directionalData transferred “out of” the CPU for write operationsData transferred “into” the CPU for read operations

Typical sizes: 8, 16, 32, 64 lines Signal names:

D0, D1, D2, D3, etc.

Address BusAddress Bus

Carries an address from the CPU to Memory or I/O devices

UnidirectionalThe address is always supplied by the CPU

(There is one exception to this, which we’ll discuss later.)

Typical sizes: 16, 20, 24 lines Signal names:

A0, A1, A2, A3, etc.

Control BusControl Bus

Collection of signals for coordinating CPU activities Each signal has a unique purpose Typical sizes: 10-20 lines Signals are output, input, or bi-directional Typical signals

/RD (read)/WR (writeCLK (clock)/IRQ (interrupt request)etc.

PCI Bus ConnectionsPCI Bus Connections

PCI BusPCI Bus

32- or 64-bit backplane Interconnects:

CPUPlug-in I/O (serial and parallel ports, sound cards, disc drives

Lines are non-specialized: carry addresses and data, labeled AD00 to AD31 (or AD63)

Additional lines: control and power lines

InstructionsInstructions

InstructionDirection given to a computerCauses electrical signals to be sent through specific circuits for processing

Instruction setDesign defines functions performed by the processorDifferentiates computer architecture by the

Number of instructionsComplexity of operations performed by individual instructionsData types supportedFormat (layout, fixed vs. variable length)Use of registersAddressing (size, modes)

InstructionInstruction ElementsElements

OPCODE: task Source OPERAND(s) Result OPERAND

Location of data (register, memory)Explicit: included in instructionImplicit: default assumed

OPCODE SourceOPERAND

Result OPERAND

Instruction FormatInstruction Format

Machine-specificMachine-specific template that specifies Length of the op code Number of operands Length of operands

Simple 32-bit Instruction Format

28 = 256 different instructions

224 = 16 million memory addresses

Instruction Format: IBM MainframeInstruction Format: IBM Mainframe

Instruction Types (1 of 2)Instruction Types (1 of 2)

Data Transfer (load, store)Most common, greatest flexibilityInvolve memory and registersWhat’s a word ? 16? 32? 64 bits?

ArithmeticOperators + - / * ^Integers and floating point

Logical or Boolean Relational operators: > < = Boolean operators AND, OR, XOR, NOR, and NOT

Single operand manipulation instructionsNegating, decrementing, incrementing

Instruction Types (2 of 2)Instruction Types (2 of 2)

PrivilegedPrivilegedSecurityAccess controlNot available to the application programs

Bit manipulation instructionsFlags to test for conditions

Shift and rotate Program control Stack instructions Multiple data instructions I/O and machine control

Register Shifts and RotatesRegister Shifts and Rotates

Program Control InstructionsProgram Control Instructions

Program controlJump and branchSubroutine call and return

Stack InstructionsStack Instructions

Stack instructionsLIFO method for organizing information Items removed in the reverse order from that in which they are added

Fixed Location Subroutine Fixed Location Subroutine Return Address StorageReturn Address Storage

Stack Subroutine Return Address Stack Subroutine Return Address StorageStorage

Multiple Data InstructionsMultiple Data Instructions

Perform a single operation on multiple pieces of data simultaneously

SIMD: Single Instruction, Multiple DataIntel MMX: 57 multimedia instructionsCommonly used in vector and array processing applications

Thank you!Thank you!Reading: Lecture slides and notes, Chapter 7Reading: Lecture slides and notes, Chapter 7

http://www.visualjokes.com

1 Lecture 6 The CPU and Memory ITEC 1000 “Introduction to Information Technology” [Prof. Peter...

Documents

What is an allegory ?

Performing Hamlet's Religious Allegory

Religious Allegory And Allegory Throughout History

Symbol and allegory[1]

Epic and Allegory

The Crucible as Allegory Encountering Conflict. What is an Allegory? Allegory: a story that is used to represent specific ideas or principles. Similar

Symbolism in Lord of the Flies ALLEGORY. SUCKS TO YOUR ALLEGORY

greek notion of allegory

Allegory Part 2

the cambridge companion to allegory - Assetsassets.cambridge.org/97805216/80820/frontmatter/... · 2010-04-26 · the cambridge companion to allegory Allegory is a vast subject, and

Plato’s allegory

Allegory of the Cave

Symbol and Allegory

Satire, Allegory, and Fable

Allegory and Symbolism

SYMBOLISM & ALLEGORY

What is an allegory?

Allegory in King Lear

Allegory, Negritude,Globalization

ELA Symbolism vs Allegory