Computer System Overview
Computer System Overview
Computer System Overview
Chapter 1
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
Basic Elements
Processor Main Memory volatile referred to as real memory or primary memory I/O modules secondary memory devices communications equipment terminals System bus communication among processors, memory, and I/O modules
3
Processor
Two internal registers
Memory address register (MAR)
Specifies the address for the next read or write
Top-Level Components
CPU System Bus Main Memory
0 1 2
PC IR
Ins tru ction Ins tru ction Ins tru ction Data Data Data Data
I/O BR
I/O Module
n-2 n-1
Buffers
= = = = = =
Program counter Ins truction regis ter Memory address register Memory buffer register Input/output address register Input/output buffer regis ter
Processor Registers
User-visible registers
Enable programmer to minimize mainmemory references by optimizing register use
User-Visible Registers
May be referenced by machine language Available to all programs - application programs and system programs Types of registers
Data Address
Index Segment pointer Stack pointer
7
User-Visible Registers
Address Registers
Index
Involves adding an index to a base value to get an address
Segment pointer
When memory is divided into segments, memory is referenced by a segment and an offset
Stack pointer
Points to top of stack
8
10
Instruction Execution
Two steps
Processor reads instructions from memory
Fetches
11
Instruction Cycle
12
13
Instruction Register
Fetched instruction is placed in the instruction register Categories
Processor-memory
Transfer data between processor and memory
Processor-I/O
Data transferred to or from a peripheral device
Data processing
Arithmetic or logic operation on data
Control
Alter sequence of execution
14
15
16
17
Interrupts
Interrupt the normal sequencing of the processor Most I/O devices are slower than the processor
Processor must pause to wait for device
18
Classes of Interrupts
19
20
2a
2b
WRITE
3a
3b
21
22
Interrupt Handler
Program to service a particular I/O device Generally part of the operating system
23
Interrupts
Suspends the normal sequence of execution
24
Interrupt Cycle
25
Interrupt Cycle
Processor checks for interrupts If no interrupts fetch the next instruction for the current program If an interrupt is pending, suspend execution of the current program, and execute the interrupt-handler routine
26
27
28
29
30
31
Multiple Interrupts
Disable interrupts while an interrupt is being processed
32
Multiple Interrupts
Define priorities for interrupts
33
Multiple Interrupts
34
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
35
Memory Hierarchy
Faster access time, greater cost per bit Greater capacity, smaller cost per bit Greater capacity, slower access speed
36
Memory Hierarchy
37
38
Secondary Memory
Nonvolatile Auxiliary memory Used to store program and data files
39
Disk Cache
A portion of main memory used as a buffer to temporarily to hold data for the disk Disk writes are clustered Some data written out may be referenced again. The data are retrieved rapidly from the software cache instead of slowly from disk
40
Cache Memory
Invisible to operating system Increase the speed of memory Processor speed is faster than memory speed Exploit the principle of locality
41
Cache Memory
42
Cache Memory
Contains a copy of a portion of main memory Processor first checks cache If not found in cache, the block of memory containing the needed information is moved to the cache and delivered to the processor
43
C-1
Block Length (K Words)
(a) Cache
Block 2n - 1
Word Length
45
Cache Design
Cache size
Small caches have a significant impact on performance
Block size
The unit of data exchanged between cache and main memory Larger block size more hits until probability of using newly fetched data becomes less than the probability of reusing data that have to be moved out of cache
46
Cache Design
Mapping function
Determines which cache location the block will occupy
Replacement algorithm
Determines which block to replace Least-Recently-Used (LRU) algorithm
47
Cache Design
Write policy
When the memory write operation takes place Can occur every time block is updated Can occur only when block is replaced
Minimizes memory write operations Leaves main memory in an obsolete state
48
Programmed I/O
I/O module performs the action, not the processor Sets appropriate bits in the I/O status register No interrupts occur Processor checks status until operation is complete
49
Interrupt-Driven I/O
Processor is interrupted when I/O module ready to exchange data Processor saves context of program executing and begins executing interrupt-handler No needless waiting Consumes a lot of processor time because every word read or written passes through the processor
50
51