Karen Nguyen

Ch 10 Outline
I. Roles of an Operating System
Application software: written to address specific needs
System software: manages a computer system at a more fundamental level
Operating system: the core of a computers system software
A computer could have 2+ operating systems (dual-boot or multi-boot)
Multiprogramming: technique of keeping multiple programs in main memory at the same time
Memory management keeps track of which programs are in memory
Process management carefully tracks the progress of a process
Timesharing system allows multiple users to interact with a computer at the same time
Mainframe: a set of dumb terminals connected to the mainframe
Dumb terminal: a monitor display and keyboard
Real-time system must provide guaranteed minimum response time
II. Memory Management
Logical address is a value that specifies a generic location relative to the program but not the
reality of main memory
Physical address is an actual address in the main memory device
Address binding: the mapping of a logical address to a physical one
Single contiguous memory management is loaded into one large chunk of memory
Fixed-partition technique: main memory is divided into a particular number of partitions
Dynamic-partition technique, the partitions are created to fit the unique needs of the programs
Program stores beginning address into the base register
The length of the partition is stored in the bounds register
Paged memory technique: main memory is divided into small fixed-size blocks of storage called
frames
Page-map table keeps track of the pages
Demand paging takes advantage of the fact that not all parts of a program actually have to be in
memory at the same time
III. Process Management
Operating system must manage the use of the CPU by individual processes
Processes move through specific states as they are managed in a computer system
In the new state, a process is being created, a process with no barriers is in the ready state, the
running state is currently being executed by CPU, the waiting state is waiting for resources,
terminated state has completed its execution no longer active
Large amount of data is stored in process control block
EE
Exchange of information is called context switch
IV. CPU Scheduling
Nonpreemptive scheduling are made when a process switches from the running state to the
waiting state
Preemptive scheduling are made when a process moves from the running state to the ready
state or from the waiting to the ready state
FCFS processes are moved to the CPU in the order in which they arrive in the running state
SJN CPU scheduling system looks at all processes in the ready state and dispatches the one with
the smallest service time
Round-robin distributes the processing time equitably among all ready processes, establishes
time slice (amount of time each process receives before its preempted and returned to the
ready state)