CPIT 201 Introduction to Computing CH 5 Computer
- Slides: 94
CPIT 201 Introduction to Computing CH (5) Computer Organization King Abdul. Aziz University Faculty of Computing & Information Technology Department CPIT 201
2 CPIT 201
CPU 3 CPIT 201
We can divide the parts that make up a computer into three broad categories or subsystem: the central processing unit (CPU), the main memory and the input/output subsystem. Computer hardware (subsystems) 4 CPIT 201
5 -1 Central Processing Unit The central processing unit (CPU) performs operations on data. In most architectures it has three parts: • An arithmetic logic unit (ALU) • A control unit • A set of registers, fast storage locations. 5 CPIT 201
The arithmetic logic unit (ALU) Performs logic, shift, and arithmetic operations on data Registers are fast stand-alone storage locations that hold data temporarily. Multiple registers are needed to facilitate the operation of the CPU. q Data registers q Instruction register q Program counter 6 CPIT 201
The Control Unit The third part of any CPU is the control unit. The control unit controls the operation of each subsystem. Controlling is achieved through signals sent from the control unit to other subsystems. 7 CPIT 201
Computer hardware (subsystems) 8 CPIT 201
5 -2 Main Memory • 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. 9 CPIT 201
Main memory 10 CPIT 201
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 and a word size of 1 byte has an address space that ranges from 0 to 65, 535. 11 CPIT 201
Memory addresses are defined using unsigned binary integers. 12 CPIT 201
Example 5. 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 log 2 225, or 25 bits, to address each byte. Example 5. 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 2 27. However, each word is eight (23) bytes, which means that we have 224 words. This means that we need log 2 224, or 24 bits, to address each word. 13 CPIT 201
Memory Types Two main types of memory exist: RAM and ROM. Random access memory (RAM) “Volatile” q Static RAM (SRAM) q Dynamic RAM (DRAM) Read-only memory (ROM) “non-volatile” q Programmable read-only memory (PROM). q Erasable programmable read-only memory (EPROM). q Electrically erasable programmable read-only memory (EEPROM). 14 CPIT 201
15 CPIT 201
Memory hierarchy • Computer users need a lot of memory, especially memory that is very fast and inexpensive. • This demand is not always possible to satisfy—very fast memory is usually not cheap. • A compromise needs to be made. The solution is hierarchical levels of memory. 16 CPIT 201
Cache Memory • Cache memory is faster than main memory, but slower than the CPU and its registers. • Cache memory, which is normally small in size, is placed between the CPU and main memory. 17 CPIT 201
5 -3 Input/Output Subsystem • The third major subsystem in a computer is the collection of devices referred to as the input/output (I/O) subsystem. • This subsystem allows a computer to communicate with the outside world and to store programs and data even when the power is off. • Input/output devices can be divided into two broad categories: non-storage and storage devices. 18 CPIT 201
Non-storage devices allow the CPU/memory to communicate with the outside world, but they cannot store information. q Keyboard and Monitor q Printer 19 CPIT 201
Storage devices • Storage devices, although classified as I/O devices, can store large amounts of information to be retrieved at a later time. • They are cheaper than main memory, and their contents are nonvolatile—that is, not erased when the power is turned off. • They are sometimes referred to as auxiliary storage devices. • We can categorize them as either magnetic or optical. 20 CPIT 201
A magnetic disk 21 CPIT 201
CPIT 201
CPIT 201
A magnetic tape 24 CPIT 201
CPIT 201
Creation and use of CD-ROMs 26 CPIT 201
CD-ROM format 27 CPIT 201
28 CPIT 201
Making a CD-R 29 CPIT 201
Making a CD-RW 30 CPIT 201
31 CPIT 201
CPIT 201
5 -4 Subsystem Interconnection • The previous sections outlined the characteristics of the three subsystems (CPU, main memory, and I/O) in a standalone computer. • In this section, we explore how these three subsystems are interconnected. • The interconnection plays an important role because information needs to be exchanged between the three subsystems. 33 CPIT 201
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 34 CPIT 201
Memory Slots CPU Sockets CPIT 201
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 36 CPIT 201
Data Bus q Is made of several connections. q Each carrying 1 bit at a time. q The number of connections depends on the size of the word. q EX: 32 bits word need data bus with 32 connections. 37 CPIT 201
Address Bus q Allows access to a particular word in memory. q. The number of connections depends on the Address space of the memory. q. EX: memory with 2 n words need bus with n connections. 38 CPIT 201
Control Bus q carries communication between CPU and memory q. The number of connections depends on the total number of control commands a computer needs. q. EX: a computer with 2 m control actions need m connections 39 CPIT 201
CPIT 201
Connecting I/O devices • I/O devices cannot be connected directly to the buses that connect the CPU and memory, because the nature of I/O devices is different from the nature of CPU and memory. • I/O devices are electromechanical, magnetic, or optical devices, whereas the CPU and memory are electronic devices. • I/O devices also operate at a much slower speed than the CPU/memory. • There is a need for some sort of intermediary to handle this difference. • I/O devices are therefore attached to the buses through input/output controllers or interfaces. • There is one specific controller for each input/output device. 41 CPIT 201
Connecting I/O devices to the buses 42 CPIT 201
Connecting I/O devices • Controllers/Interfaces • They are bridge the gap between the nature of the I/O device and the CPU and memory. • Controller can be. . • Serial: has only one data wire. • Parallel: has several data connections 43 CPIT 201
Parallel Interface Serial Interface CPIT 201
CPIT 201
Connecting I/O devices • Controllers/Interfaces • Most common kinds of controllers… • SCSI (Parallel Interface) • Fire. Wire (Serial Interface) • USB (Serial Interface) 46 CPIT 201
SCSI controller • Macintosh • Daisy Chained connection • Both end connected to a terminator • Each device much have a unique ID 47 CPIT 201
SCSI controller CPIT 201
Fire. Wire controller • IEEE • High-Speed Interface transfer data as packets • Used to connect devices in a daisy chain or tree using one connection. • No need to termination CPIT 201 49
Fire. Wire controller CPIT 201
USB controller • Used to connect low/high speed devices • Devices easily removed or attached • 4 wires cable (2 for power/2 for data) CPIT 201
CPIT 201
Addressing input/output devices • The CPU usually uses the same bus to read data from or write data to main memory and I/O device. • The only difference is the instruction. • If the instruction refers to a word in main memory, data transfer is between main memory and the CPU. • If the instruction identifies an I/O device, data transfer is between the I/O device and the CPU. • There are two methods for handling the addressing of I/O devices: isolated I/O and memory-mapped I/O. 53 CPIT 201
Isolated I/O addressing • Instructions used to read/write memory and I/O devises are totally different • There are instructions to Test, Control, Read from, Write to I/O devices • Each I/O device has its own address. • I/O addresses can OVERLAP with memory addresses without ambiguity because the instructions are different • EX: CPU instructions “Read 101”, “Input 101”. CPIT 201 54
Memory-mapped I/O addressing • CPU treats each register in the I/O controller as a word in memory. • Advantage: Small number of instructions • Disadvantage: part of memory address space is allocated to registers in I/O controllers • If we have 5 controllers with 4 registers to each 20 addresses are used from memory CPIT 201 55
5 -5 Program Execution • 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 the program and the data are stored in memory. 56 CPIT 201
Machine Cycle • The CPU uses repeating machine cycles to execute instructions in the program, one by one, from beginning to end. • A simplified cycle can consist of three phases: fetch, decode and execute. The steps of a cycle 57 CPIT 201
Input/output operation • Commands are required to transfer data from I/O devices to the CPU and memory. • Because I/O devices operate at much slower speeds than the CPU, the operation of the CPU must be somehow synchronized with the I/O devices. • Three methods have been devised for this synchronization: q Programmed I/O q Interrupt driven I/O q Direct memory access (DMA) 58 CPIT 201
- Primitive - CPU waits for I/O device -The Data transferred to memory after the Input operation - The Data transferred from memory before the Output operation Programmed I/O 59 CPIT 201
Interrupt-driven I/O 60 CPIT 201
-Type of transfer I/O - start address of memory location -Number of byte to be transfer DMA connection to the general bus -Transfer large data between high-speed I/O device and memory without using CPU. -Requires DMA controller which has register to hold a block of data before and after memory transfer. -CPU is idle for a short time CPIT 201 61
DMA input/output 62 CPIT 201
5 -6 Different Architectures The architecture and organization of computers has gone through many changes in recent decades. In this section we discuss some common architectures and organization that differ from the simple computer architecture we discussed earlier. 63 CPIT 201
CISC • CISC stands for Complex Instruction Set Computer. • The strategy behind CISC architectures is to have a large set of instructions, including complex ones. • Programming CISC-based computers is easier than in other designs because there is a single instruction for both simple and complex tasks. • Programmers, therefore, do not have to write a set of instructions to do a complex task. 64 CPIT 201
CISC • CPU and Control Unit are very complicated. • Two levels programming to simplify complication: o. The instruction is not executed directly by CPU, CPU performs only simple operations called microoperation o. A complex instruction is transformed into a set of these simple operations and then executed by the CPU. • addition memory “micromemory” used to hold the set of operations for each complex instruction. • The type of programming here called microprogramming 65 CPIT 201
RISC • RISC stands for Reduced Instruction Set Computer. • The strategy behind RISC architecture is to have a small set of instructions that do a minimum number of simple operations. • Complex instructions are simulated using a subset of simple instructions. • Programming in RISC is more difficult and time-consuming than in the other design, because most of the complex instructions are simulated using simple instructions. 66 CPIT 201
Pipelining • A computer uses three phases, fetch, decode and execute, for each instruction. • In early computers, these three phases needed to be done in series for each instruction. Instruction n needs to finish all these phases before instruction n + 1. • Modern computers use a technique called pipelining to improve throughput (the total number of instructions performed in each period of time). • The idea is that if the control unit can do two or three of these phases simultaneously, the next instruction can start before the previous one is finished. 67 CPIT 201
Pipelining 68 CPIT 201
Parallel Processing • Traditionally a computer had a single control unit, a single arithmetic logic unit and a single memory unit. • With the evolution in technology and the drop in the cost of computer hardware, today we can have a single computer with multiple control units, multiple arithmetic logic units and multiple memory units. • This idea is referred to as parallel processing. Like pipelining, parallel processing can improve throughput. 69 CPIT 201
Flynn’s taxonomy of computer organization Single Instruction Multiple Instruction Single Data SISD Multiple Data SIMD MIMD CPIT 201
1. SISD organization • Single Instruction, Single Data -Stream • Represents a computer that has one control unit, one ALU, and one memory unit. • The instructions are executed sequentially and each instruction may access one or more data item in the data stream. • EX: the earlier simple computer. 71 CPIT 201
2. SIMD organization • Single Instruction, Multiple Data -Stream • Represents a computer that has one control unit, multiple processing units (ALUs), and one memory unit. • All processor units receive the same instruction from the control unit, but operate on different items of data • EX: An array processor that simultaneously operates on an array of data. 72 CPIT 201
3. MISD organization • Multiple Instruction, Single Data -Stream • Several instructions belonging to several instruction streams simultaneously operate on the same data stream. • EX: Pipelining 73 CPIT 201
4. MIMD organization • Multiple Instruction , Multiple Data -Stream • Several instructions belonging to several instruction streams simultaneously operate on several data streams 74 CPIT 201
CPIT 201
5 -7 A Simple Computer • To explain the architecture of computers as well as their instruction processing, we introduce a simple (unrealistic) computer. • Our simple computer has three components: CPU, memory and an input/output subsystem. 76 CPIT 201
1400 The components of a simple computer 77 CPIT 201
Instruction Set • Our simple computer is capable of having a set of sixteen instructions, although we are using only fourteen of these instructions. • Each computer instruction consists of two parts: the operation code (opcode) and the operand (s). • The opcode specifies the type of operation to be performed on the operand (s). • Each instruction consists of sixteen bits divided into four 4 -bit fields. • The leftmost field contains the opcode and the other three fields contains the operand or address of operand (s). 78 CPIT 201
79 CPIT 201
Format and different instruction types 80 CPIT 201
Processing the Instruction • Our simple computer, 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 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. 81 CPIT 201
1400 The components of a simple computer 82 CPIT 201
An Example Let us show our simple computer can add two integers A and B and create the result as C. We assume that integers are in two’s complement format. Mathematically, we show this operation as: We assume that the first two integers are stored in memory locations (40)16 and (41)16 and the result should be stored in memory location (42)16. To do the simple addition needs five instructions, as shown next: 83 CPIT 201
In the language of our simple computer, these five instructions are encoded as: 84 CPIT 201
Storing program and data We can store the five-line program in memory starting from location (00)16 to (04)16. We already know that the data needs to be stored in memory locations (40)16, (41)16, and (42)16. Cycles Our computer uses one cycle per instruction. If we have a small program with five instructions, we need five cycles. We also know that each cycle is normally made up of three steps: fetch, decode, execute. Assume for the moment that we need to add 161 + 254 = 415. The numbers are shown in memory in hexadecimal is, (00 A 1)16, (00 FE)16, and (019 F)16. 85 CPIT 201
Status of cycle 1 86 CPIT 201
Status of cycle 2 87 CPIT 201
Status of cycle 3 88 CPIT 201
Status of cycle 4 89 CPIT 201
Status of cycle 5 90 CPIT 201
Another Example • In the previous example we assumed that the two integers to be added were already in memory and the result of addition will be held in memory. • You may ask how we can store the two integers we want to add in memory, or how we use the result when it is stored in the memory. • In a real situation, we enter the first two integers into memory using an input device such as keyboard, and we display the third integer through an output device such as a monitor. • Getting data via an input device is normally called a read operation. • Sending data to an output device is normally called a write operation. • To make our previous program more practical, we need modify it as follows: 91 CPIT 201
In our computer we can simulate read and write operations using the LOAD and STORE instruction. Furthermore, LOAD and STORE read data input to the CPU and write data from the CPU. We need two instructions to read data into memory or write data out of memory. The read operation is: 92 CPIT 201
The write operation is: The input operation must always read data from an input device into memory: the output operation must always write data from memory to an output device. 93 CPIT 201
The program is coded as: Operations 1 to 4 are for input and operations 9 and 10 are for output. When we run this program, it waits for the user to input two integers on the keyboard and press the enter key. The program then calculates the sum and displays the result on the monitor. 94 CPIT 201
- Cpit 201
- Cpit 201
- Convert from decimal number system to binary digit : 201
- Cpit 201
- Cpit 221
- Cpit 221
- Cpit110
- Cpit 110
- Cpit 110
- What is an msc?
- Sara yousef
- Cpit110
- Cpit 110
- Conventional computing and intelligent computing
- Design principles of computer clusters
- Zonbu computer green computing
- What is electromechanical period
- Regarder introduction to cloud computing vidéos
- Introduction to parallel computing grama
- Introduction to evolutionary computing
- It 101 - introduction to computing
- It 101 introduction to computing
- Introduction to mapreduce in cloud computing
- Introduction to ubiquitous computing
- Mobility of bits and bytes
- It 101 introduction to computing
- Introduction to distributed computing
- Introduction to cloud computing
- Introduction to grid computing
- Grid computing introduction
- Introduction to cloud computing
- It 111 introduction to computing
- Introduction to cluster computing
- Management myths in software engineering
- Introduction to parallel computing ananth grama ppt
- Introduction to parallel computing ananth grama
- Introduction to grid computing
- Nf p 40-201
- Mcb 201
- Math 201 bryant and stratton
- James f. shackelford
- Toon company
- Fst 201
- Et 201
- Engr 201
- 201 principles of software development pdf
- Duke cs 201
- Cmsc 201 umbc
- Cmsc 201
- Class of 201
- Clase 201
- Fmvss 201
- Bch 201
- 5 c.f.r. § 2640.201(a)
- 201 kar 20:057
- 201 isabella st pittsburgh pa 15212
- English 201
- Afi 31-201
- What is software
- Se-201
- Life cycle of a record
- Patrio eztec
- Rick warren class 201 pdf
- 201 principles of software development
- Met 201
- Ics 201 example
- Csci 201 usc
- Records management 201 answers
- Spn 201
- Ee 201
- Bme 201
- Che 201
- X-201 for a sole proprietorship
- 201 in binary
- Capa ns kentucky
- Ktu environmental impact assessment syllabus
- Comp
- Section 201
- How many sig figs in 3400
- Nserc pdf
- Ma 201 cmr 17
- Ar 1-201 key points
- Afi 34-201
- Ece 201
- Ee 201
- Declaratia 201
- Csci 201 usc
- Compsci 201
- Duke compsci 201
- 201 to binary
- Szkoła podstawowa nr 82 warszawa ul górczewska 201
- Glabelloalveolar line
- Prime and composite
- Chm 201
- Cv 201