Dale & Lewis Chapter 5 Computing components

Slides:



Advertisements
Similar presentations
Chapter 2: Data Manipulation
Advertisements

The CPU The Central Presentation Unit What is the CPU?
The Fetch – Execute Cycle
The CPU. Parts of the CPU Control Unit Arithmetic & Logic Unit Registers.
Computer Systems. Computer System Components Computer Networks.
CHAPTER 4 COMPUTER SYSTEM – Von Neumann Model
LMC Little Moron Computer
Midterm Wednesday Chapter 1-3: Number /character representation and conversion Number arithmetic Combinational logic elements and design (DeMorgan’s Law)
Memory - Registers Instruction Sets
The processor and main memory chapter 4, Exploring the Digital Domain The Development and Basic Organization of Computers.
Chapters 5 - The LC-3 LC-3 Computer Architecture Memory Map
The central processing unit and main memory chapter 4, Exploring the Digital Domain The Development and Basic Organization of Computers.
Dale & Lewis Chapter 5 Computing components. Let’s design a computer Generic CPU with registers −Program counter (PC) – 5 bits (size of addresses) −Instruction.
Overview von Neumann Model Components of a Computer Some Computer Organization Models The Computer Bus An Example Organization: The LC-3.
The Computer Processor
Lecture 13 - Introduction to the Central Processing Unit (CPU)
Computer Science 210 Computer Organization The Instruction Execution Cycle.
Basic Operational Concepts of a Computer
SAP1 (Simple-As-Possible) Computer
CS 1308 Computer Literacy and the Internet Computer Systems Organization.
Computer Science 210 Computer Organization The von Neumann Architecture.
Stack Stack Pointer A stack is a means of storing data that works on a ‘Last in first out’ (LIFO) basis. It reverses the order that data arrives and is.
Introduction to Computing Systems from bits & gates to C & beyond The Von Neumann Model Basic components Instruction processing.
Chapter 4 The Von Neumann Model
Chapter 8: The Very Simple Computer
Model Computer CPU Arithmetic Logic Unit Control Unit Memory Unit
Computer Science 101 Computer Systems Organization.
Computer Organization CSC 405 (VSC) Very Simple Computer.
Computer Architecture Memory, Math and Logic. Basic Building Blocks Seen: – Memory – Logic & Math.
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI CSCI N305 Information Representation: Machine Instructions.
© GCSE Computing Candidates should be able to:  describe the characteristics of an assembler Slide 1.
COMPILERS CLASS 22/7,23/7. Introduction Compiler: A Compiler is a program that can read a program in one language (Source) and translate it into an equivalent.
Computer Systems Organization
Chapter 2 Data Manipulation © 2007 Pearson Addison-Wesley. All rights reserved.
Chapter 20 Computer Operations Computer Studies Today Chapter 20.
Lec 4-2 Five operations of the machine cycle Fetch- fetch the next program instruction from memory. (PC+1); instruction to IR Decode- decode the instruction.
3.1.4 Hardware a. describe the function and purpose of the control unit, memory unit and ALU (arithmetic logic unit) as individual parts of a computer;
Stored Program Concept Learning Objectives Learn the meaning of the stored program concept The processor and its components The fetch-decode-execute and.
OCR GCSE Computer Science Teaching and Learning Resources
The Stored Program Computer
Lecture 13 - Introduction to the Central Processing Unit (CPU)
Chapter 4 The Von Neumann Model
CHAPTER 6: The Little Man Computer
Computer Science 210 Computer Organization
Lesson Objectives A note about notes: Aims
Chapter 4 The Von Neumann Model
Computer Architecture
Chapter 4 The Von Neumann Model
Computer Science 210 Computer Organization
System Architecture 1 Chapter 2.
The fetch-execute cycle
The Processor and Machine Language
The Basic Organization of Computers T.Jeya M.Sc., M.Phil Assistant Professor, Department of CS, SAC Women’s College. Cumbum. Tamilnadu.
Chapter 4 The Von Neumann Model
Computer Science 210 Computer Organization
Computer Science 210 Computer Organization
CS149D Elements of Computer Science
The Little Man Computer
Computer Architecture
Chapter 4 The Von Neumann Model
The Stored Program Computer
GCSE OCR 1 The CPU Computer Science J276 Unit 1
Program Execution.
Basic components Instruction processing
A Level Computer Science Topic 5: Computer Architecture and Assembly
THE FETCH-EXECUTE CYCLE.
Information Representation: Machine Instructions
Objectives Describe common CPU components and their function: ALU Arithmetic Logic Unit), CU (Control Unit), Cache Explain the function of the CPU as.
Computer Architecture
Little Man Computer.
Presentation transcript:

Dale & Lewis Chapter 5 Computing components

von Neumann architecture Memory holds both data and instructions (interchangeable) Central Processing Unit (CPU) Arithmetic/Logic Unit (ALU) Control Unit Input, output units

Fetch-Decode-Execute cycle Fetch next instruction (program counter (PC) determines from where) Decode instruction (extract op code, operand address) Get data, if needed (operand address determines from where) Execute instruction Advance PC Faster cycles  faster computing Computers can reach 3.5 billion instructions per second

Let’s design a computer Generic CPU with registers Program counter (PC) – 5 bits (size of addresses) Instruction register (IR) – 8 bits (op code + address) Memory Address Register (MAR) – 5 bits  Main Memory Memory Data Register (MDR) – 8 bits (byte addressable) Accumulator (A or Acc) – 8 bits

BRANCH ON POSITIVE (BRP) Instructions Instruction format: 3-bit op code, 5-bit address Instructions and their op codes op code Instruction 000 HALT (HLT) 001 LOAD (LDA) 010 STORE (STA) 011 ADD (ADD) 100 SUBTRACT (SUB) 101 BRANCH (BR) 110 BRANCH ON ZERO (BRZ) 111 BRANCH ON POSITIVE (BRP)

Types of instructions Data movement Arithmetic and logic operations Move data between memory and CPU Move data between different memory locations Input, output Arithmetic and logic operations Integer arithmetic Comparing two quantities Shifting or rotating bits in a quantity Testing, comparing and converting bits Program control Starting a program Halting a program Skipping to another location Testing data to decide whether to skip to another instruction

Instructions LOAD instruction (LDA) ADD instruction (ADD) PC  MAR MDR  IR IR [address]  MAR MDR  A PC + 1  PC ADD instruction (ADD) A + MDR  A STORE instruction (STA) PC  MAR MDR  IR A  MDR IR [address]  MAR PC + 1  PC HALT instruction (HLT) stop FETCH – DECODE – GET DATA – EXECUTE

FETCH Address of next instruction is transferred from PC to MAR and the instruction is located in the memory

FETCH Instruction is copied from memory to the MDR

DECODE Decode the instruction

EXECUTE Execute the instruction – control unit sends signals to appropriate devices to carry out execution of the instruction

A small computer program Assembly language op code LOAD A 00100 00101000 ADD B 00101 01101001 STORE C 00110 01001010 HLT 00111 00000000 DATA +5 01000 00000101 -3 01001 11111101 01010 Program Data Address Contents Main memory