🗊Презентация Computer System Overview

Категория: Технология
Нажмите для полного просмотра!
Computer System Overview, слайд №1Computer System Overview, слайд №2Computer System Overview, слайд №3Computer System Overview, слайд №4Computer System Overview, слайд №5Computer System Overview, слайд №6Computer System Overview, слайд №7Computer System Overview, слайд №8Computer System Overview, слайд №9Computer System Overview, слайд №10Computer System Overview, слайд №11Computer System Overview, слайд №12Computer System Overview, слайд №13Computer System Overview, слайд №14Computer System Overview, слайд №15Computer System Overview, слайд №16Computer System Overview, слайд №17Computer System Overview, слайд №18Computer System Overview, слайд №19Computer System Overview, слайд №20Computer System Overview, слайд №21Computer System Overview, слайд №22Computer System Overview, слайд №23Computer System Overview, слайд №24Computer System Overview, слайд №25Computer System Overview, слайд №26Computer System Overview, слайд №27Computer System Overview, слайд №28Computer System Overview, слайд №29Computer System Overview, слайд №30Computer System Overview, слайд №31Computer System Overview, слайд №32Computer System Overview, слайд №33Computer System Overview, слайд №34Computer System Overview, слайд №35Computer System Overview, слайд №36Computer System Overview, слайд №37Computer System Overview, слайд №38Computer System Overview, слайд №39Computer System Overview, слайд №40Computer System Overview, слайд №41Computer System Overview, слайд №42Computer System Overview, слайд №43Computer System Overview, слайд №44Computer System Overview, слайд №45Computer System Overview, слайд №46Computer System Overview, слайд №47Computer System Overview, слайд №48Computer System Overview, слайд №49Computer System Overview, слайд №50Computer System Overview, слайд №51Computer System Overview, слайд №52Computer System Overview, слайд №53Computer System Overview, слайд №54Computer System Overview, слайд №55Computer System Overview, слайд №56Computer System Overview, слайд №57Computer System Overview, слайд №58Computer System Overview, слайд №59Computer System Overview, слайд №60Computer System Overview, слайд №61Computer System Overview, слайд №62Computer System Overview, слайд №63
Скачать

Содержание ▲

Вы можете ознакомиться и скачать презентацию на тему Computer System Overview. Доклад-сообщение содержит 63 слайдов. Презентации для любого класса можно скачать бесплатно. Если материал и наш сайт презентаций Mypresentation Вам понравились – поделитесь им с друзьями с помощью социальных кнопок и добавьте в закладки в своем браузере.

Слайды и текст этой презентации

Слайд 1


Chapter 1 Computer System Overview
Описание слайда:
Chapter 1 Computer System Overview

Слайд 2


Roadmap Basic Elements Processor Registers Instruction Execution Interrupts The Memory Hierarchy Cache Memory I/O Communication Techniques
Описание слайда:
Roadmap Basic Elements Processor Registers Instruction Execution Interrupts The Memory Hierarchy Cache Memory I/O Communication Techniques

Слайд 3


Operating System Exploits the hardware resources of one or more processors Provides a set of services to system users Manages secondary memory and I/O devices
Описание слайда:
Operating System Exploits the hardware resources of one or more processors Provides a set of services to system users Manages secondary memory and I/O devices

Слайд 4


A Computer’s Basic Elements Processor Main Memory I/O Modules System Bus
Описание слайда:
A Computer’s Basic Elements Processor Main Memory I/O Modules System Bus

Слайд 5


Processor Controls operation, performs data processing Two internal registers Memory address resister (MAR) Memory buffer register (MBR) I/O address register I/O buffer register
Описание слайда:
Processor Controls operation, performs data processing Two internal registers Memory address resister (MAR) Memory buffer register (MBR) I/O address register I/O buffer register

Слайд 6


Main Memory Volatile Data is typically lost when power is removed Referred to as real memory or primary memory Consists of a set of locations defined by sequentially numbers addresses Containing either data or instructions
Описание слайда:
Main Memory Volatile Data is typically lost when power is removed Referred to as real memory or primary memory Consists of a set of locations defined by sequentially numbers addresses Containing either data or instructions

Слайд 7


I/O Modules Moves data between the computer and the external environment such as: Storage (e.g. hard drive) Communications equipment Terminals Specified by an I/O Address Register (I/OAR)
Описание слайда:
I/O Modules Moves data between the computer and the external environment such as: Storage (e.g. hard drive) Communications equipment Terminals Specified by an I/O Address Register (I/OAR)

Слайд 8


System Bus Communication among processors, main memory, and I/O modules
Описание слайда:
System Bus Communication among processors, main memory, and I/O modules

Слайд 9


Top-Level View
Описание слайда:
Top-Level View

Слайд 10


Roadmap Basic Elements Processor Registers Instruction Execution Interrupts The Memory Hierarchy Cache Memory I/O Communication Techniques
Описание слайда:
Roadmap Basic Elements Processor Registers Instruction Execution Interrupts The Memory Hierarchy Cache Memory I/O Communication Techniques

Слайд 11


Processor Registers Faster and smaller than main memory User-visible registers Enable programmer to minimize main memory references by optimizing register use Control and status registers Used by processor to control operating of the processor Used by privileged OS routines to control the execution of programs
Описание слайда:
Processor Registers Faster and smaller than main memory User-visible registers Enable programmer to minimize main memory references by optimizing register use Control and status registers Used by processor to control operating of the processor Used by privileged OS routines to control the execution of programs

Слайд 12


User-Visible Registers May be referenced by machine language Available to all programs – application programs and system programs Types of registers typically available are: data, address, condition code registers.
Описание слайда:
User-Visible Registers May be referenced by machine language Available to all programs – application programs and system programs Types of registers typically available are: data, address, condition code registers.

Слайд 13


Data and Address Registers Data Often general purpose But some restrictions may apply Address Index Register Segment pointer Stack pointer
Описание слайда:
Data and Address Registers Data Often general purpose But some restrictions may apply Address Index Register Segment pointer Stack pointer

Слайд 14


Control and Status Registers Program counter (PC) Contains the address of an instruction to be fetched Instruction register (IR) Contains the instruction most recently fetched Program status word (PSW) Contains status information
Описание слайда:
Control and Status Registers Program counter (PC) Contains the address of an instruction to be fetched Instruction register (IR) Contains the instruction most recently fetched Program status word (PSW) Contains status information

Слайд 15


Condition codes Usually part of the control register Also called flags Bits set by processor hardware as a result of operations Read only, intended for feedback regarding the results of instruction execution.
Описание слайда:
Condition codes Usually part of the control register Also called flags Bits set by processor hardware as a result of operations Read only, intended for feedback regarding the results of instruction execution.

Слайд 16


Roadmap Basic Elements Processor Registers Instruction Execution Interrupts The Memory Hierarchy Cache Memory I/O Communication Techniques
Описание слайда:
Roadmap Basic Elements Processor Registers Instruction Execution Interrupts The Memory Hierarchy Cache Memory I/O Communication Techniques

Слайд 17


Instruction Execution A program consists of a set of instructions stored in memory Two steps Processor reads (fetches) instructions from memory Processor executes each instruction
Описание слайда:
Instruction Execution A program consists of a set of instructions stored in memory Two steps Processor reads (fetches) instructions from memory Processor executes each instruction

Слайд 18


Basic Instruction Cycle
Описание слайда:
Basic Instruction Cycle

Слайд 19


Instruction Fetch and Execute The processor fetches the instruction from memory Program counter (PC) holds address of the instruction to be fetched next PC is incremented after each fetch
Описание слайда:
Instruction Fetch and Execute The processor fetches the instruction from memory Program counter (PC) holds address of the instruction to be fetched next PC is incremented after each fetch

Слайд 20


Instruction Register Fetched instruction loaded into instruction register Categories Processor-memory, processor-I/O, Data processing, Control
Описание слайда:
Instruction Register Fetched instruction loaded into instruction register Categories Processor-memory, processor-I/O, Data processing, Control

Слайд 21


Characteristics of a Hypothetical Machine
Описание слайда:
Characteristics of a Hypothetical Machine

Слайд 22


Example of Program Execution
Описание слайда:
Example of Program Execution

Слайд 23


Roadmap Basic Elements Processor Registers Instruction Execution Interrupts The Memory Hierarchy Cache Memory I/O Communication Techniques
Описание слайда:
Roadmap Basic Elements Processor Registers Instruction Execution Interrupts The Memory Hierarchy Cache Memory I/O Communication Techniques

Слайд 24


Interrupts Interrupt the normal sequencing of the processor Provided to improve processor utilization Most I/O devices are slower than the processor Processor must pause to wait for device
Описание слайда:
Interrupts Interrupt the normal sequencing of the processor Provided to improve processor utilization Most I/O devices are slower than the processor Processor must pause to wait for device

Слайд 25


Common Classes of Interrupts
Описание слайда:
Common Classes of Interrupts

Слайд 26


Flow of Control without Interrupts
Описание слайда:
Flow of Control without Interrupts

Слайд 27


Interrupts and the Instruction Cycle
Описание слайда:
Interrupts and the Instruction Cycle

Слайд 28


Transfer of Control via Interrupts
Описание слайда:
Transfer of Control via Interrupts

Слайд 29


Instruction Cycle with Interrupts
Описание слайда:
Instruction Cycle with Interrupts

Слайд 30


Short I/O Wait
Описание слайда:
Short I/O Wait

Слайд 31


Long I/O wait
Описание слайда:
Long I/O wait

Слайд 32


Simple Interrupt Processing
Описание слайда:
Simple Interrupt Processing

Слайд 33


Changes in Memory and Registers for an Interrupt
Описание слайда:
Changes in Memory and Registers for an Interrupt

Слайд 34


Multiple Interrupts Suppose an interrupt occurs while another interrupt is being processed. E.g. printing data being received via communications line. Two approaches: Disable interrupts during interrupt processing Use a priority scheme.
Описание слайда:
Multiple Interrupts Suppose an interrupt occurs while another interrupt is being processed. E.g. printing data being received via communications line. Two approaches: Disable interrupts during interrupt processing Use a priority scheme.

Слайд 35


Sequential Interrupt Processing
Описание слайда:
Sequential Interrupt Processing

Слайд 36


Nested Interrupt Processing
Описание слайда:
Nested Interrupt Processing

Слайд 37


Example of Nested Interrupts
Описание слайда:
Example of Nested Interrupts

Слайд 38


Multiprogramming Processor has more than one program to execute The sequence the programs are executed depend on their relative priority and whether they are waiting for I/O After an interrupt handler completes, control may not return to the program that was executing at the time of the interrupt
Описание слайда:
Multiprogramming Processor has more than one program to execute The sequence the programs are executed depend on their relative priority and whether they are waiting for I/O After an interrupt handler completes, control may not return to the program that was executing at the time of the interrupt

Слайд 39


Roadmap Basic Elements Processor Registers Instruction Execution Interrupts The Memory Hierarchy Cache Memory I/O Communication Techniques
Описание слайда:
Roadmap Basic Elements Processor Registers Instruction Execution Interrupts The Memory Hierarchy Cache Memory I/O Communication Techniques

Слайд 40


Memory Hierarchy Major constraints in memory Amount Speed Expense Faster access time, greater cost per bit Greater capacity, smaller cost per bit Greater capacity, slower access speed
Описание слайда:
Memory Hierarchy Major constraints in memory Amount Speed Expense Faster access time, greater cost per bit Greater capacity, smaller cost per bit Greater capacity, slower access speed

Слайд 41


The Memory Hierarchy Going down the hierarchy Decreasing cost per bit Increasing capacity Increasing access time Decreasing frequency of access to the memory by the processor
Описание слайда:
The Memory Hierarchy Going down the hierarchy Decreasing cost per bit Increasing capacity Increasing access time Decreasing frequency of access to the memory by the processor

Слайд 42


Secondary Memory Auxiliary memory External Nonvolatile Used to store program and data files
Описание слайда:
Secondary Memory Auxiliary memory External Nonvolatile Used to store program and data files

Слайд 43


Roadmap Basic Elements Processor Registers Instruction Execution Interrupts The Memory Hierarchy Cache Memory I/O Communication Techniques
Описание слайда:
Roadmap Basic Elements Processor Registers Instruction Execution Interrupts The Memory Hierarchy Cache Memory I/O Communication Techniques

Слайд 44


Cache Memory Invisible to the OS Interacts with other memory management hardware Processor must access memory at least once per instruction cycle Processor speed faster than memory access speed Exploit the principle of locality with a small fast memory
Описание слайда:
Cache Memory Invisible to the OS Interacts with other memory management hardware Processor must access memory at least once per instruction cycle Processor speed faster than memory access speed Exploit the principle of locality with a small fast memory

Слайд 45


Principal of Locality More details later but in short … Data which is required soon is often close to the current data If data is referenced, then it’s neighbour might be needed soon.
Описание слайда:
Principal of Locality More details later but in short … Data which is required soon is often close to the current data If data is referenced, then it’s neighbour might be needed soon.

Слайд 46


Cache and Main Memory
Описание слайда:
Cache and Main Memory

Слайд 47


Cache Principles Contains copy of a portion of main memory Processor first checks cache If not found, block of memory read into cache Because of locality of reference, likely future memory references are in that block
Описание слайда:
Cache Principles Contains copy of a portion of main memory Processor first checks cache If not found, block of memory read into cache Because of locality of reference, likely future memory references are in that block

Слайд 48


Cache/Main-Memory Structure
Описание слайда:
Cache/Main-Memory Structure

Слайд 49


Cache Read Operation
Описание слайда:
Cache Read Operation

Слайд 50


Cache Design Issues Main categories are: Cache size Block size Mapping function Replacement algorithm Write policy
Описание слайда:
Cache Design Issues Main categories are: Cache size Block size Mapping function Replacement algorithm Write policy

Слайд 51


Size issues Cache size Small caches have significant impact on performance Block size The unit of data exchanged between cache and main memory Larger block size means more hits But too large reduces chance of reuse.
Описание слайда:
Size issues Cache size Small caches have significant impact on performance Block size The unit of data exchanged between cache and main memory Larger block size means more hits But too large reduces chance of reuse.

Слайд 52


Mapping function Determines which cache location the block will occupy Two constraints: When one block read in, another may need replaced Complexity of mapping function increases circuitry costs for searching.
Описание слайда:
Mapping function Determines which cache location the block will occupy Two constraints: When one block read in, another may need replaced Complexity of mapping function increases circuitry costs for searching.

Слайд 53


Replacement Algorithm Chooses which block to replace when a new block is to be loaded into the cache. Ideally replacing a block that isn’t likely to be needed again Impossible to guarantee Effective strategy is to replace a block that has been used less than others Least Recently Used (LRU)
Описание слайда:
Replacement Algorithm Chooses which block to replace when a new block is to be loaded into the cache. Ideally replacing a block that isn’t likely to be needed again Impossible to guarantee Effective strategy is to replace a block that has been used less than others Least Recently Used (LRU)

Слайд 54


Write policy Dictates when the memory write operation takes place Can occur every time the block is updated Can occur when the block is replaced Minimize write operations Leave main memory in an obsolete state
Описание слайда:
Write policy Dictates when the memory write operation takes place Can occur every time the block is updated Can occur when the block is replaced Minimize write operations Leave main memory in an obsolete state

Слайд 55


Roadmap Basic Elements Processor Registers Instruction Execution Interrupts The Memory Hierarchy Cache Memory I/O Communication Techniques
Описание слайда:
Roadmap Basic Elements Processor Registers Instruction Execution Interrupts The Memory Hierarchy Cache Memory I/O Communication Techniques

Слайд 56


I/O Techniques When the processor encounters an instruction relating to I/O, it executes that instruction by issuing a command to the appropriate I/O module. Three techniques are possible for I/O operations: Programmed I/O Interrupt-driven I/O Direct memory access (DMA)
Описание слайда:
I/O Techniques When the processor encounters an instruction relating to I/O, it executes that instruction by issuing a command to the appropriate I/O module. Three techniques are possible for I/O operations: Programmed I/O Interrupt-driven I/O Direct memory access (DMA)

Слайд 57


Programmed I/O The I/O module performs the requested action then sets the appropriate bits in the I/O status register but takes no further action to alert the processor. As there are no interrupts, the processor must determine when the instruction is complete
Описание слайда:
Programmed I/O The I/O module performs the requested action then sets the appropriate bits in the I/O status register but takes no further action to alert the processor. As there are no interrupts, the processor must determine when the instruction is complete

Слайд 58


Programmed I/O Instruction Set Control Used to activate and instruct device Status Tests status conditions Transfer Read/write between process register and device
Описание слайда:
Programmed I/O Instruction Set Control Used to activate and instruct device Status Tests status conditions Transfer Read/write between process register and device

Слайд 59


Programmed I/O Example Data read in a word at a time Processor remains in status-checking look while reading
Описание слайда:
Programmed I/O Example Data read in a word at a time Processor remains in status-checking look while reading

Слайд 60


Interrupt-Driven I/O Processor issues an I/O command to a module and then goes on to do some other useful work. The I/O module will then interrupt the processor to request service when it is ready to exchange data with the processor.
Описание слайда:
Interrupt-Driven I/O Processor issues an I/O command to a module and then goes on to do some other useful work. The I/O module will then interrupt the processor to request service when it is ready to exchange data with the processor.

Слайд 61


Interrupt- Driven I/O Eliminates needless waiting But everything passes through processor.
Описание слайда:
Interrupt- Driven I/O Eliminates needless waiting But everything passes through processor.

Слайд 62


Direct Memory Access Performed by a separate module on the system When needing to read/write processor issues a command to DMA module with: Whether a read or write is requested The address of the I/O device involved The starting location in memory to read/write The number of words to be read/written
Описание слайда:
Direct Memory Access Performed by a separate module on the system When needing to read/write processor issues a command to DMA module with: Whether a read or write is requested The address of the I/O device involved The starting location in memory to read/write The number of words to be read/written

Слайд 63


Direct Memory Access I/O operation delegated to DMA module Processor only involved when beginning and ending transfer. Much more efficient.
Описание слайда:
Direct Memory Access I/O operation delegated to DMA module Processor only involved when beginning and ending transfer. Much more efficient.

Скачать

Похожие презентации
Mypresentation.ru
Загрузить презентацию