Slide 1-1

Computer Systems II
Gordon College

Operating System Overview

 Slide 1-2
Class Intro

• Operating System Class

• Two Directions:
– Practical
• Linux+ Guide to Linux Certification and Lab Manual
• Lab Experience

– Theoretical
• Operating Systems (3rd Edition Gary Nutt)
• Lecture and Projects
 Slide 1-3
Why Study Operating Systems?
• Understand the model of operation
– Easier to see how to use the system
– Enables you to write efficient code
• Learn to design an OS
• Even so, OS is pure overhead of real work
• Application programs have the real value to
person who buys the computer
 Slide 1-4

Perspectives of the Computer

print open() start-printer

cut malloc() read-disk
save send fork() track-mouse

Application Application Application

Software Software Software
System System System
Software Software Software

Hardware Hardware Hardware

(a) End User (b) Application (c) OS Programmer

View Programmer View
View
 Slide 1-5
System Software
•Independent of individual applications, but
common to all of them
•Examples
–C library functions
–A window system
–A database management system
–Resource management functions
–The OS
 Slide 1-6

Using the System Software

Application
Programmer

Software
SoftwareAPI
API
Command
Command
Line Loader
Loader
System Software

Line Window
Interpreter
Interpreter Window
System
System
Libraries
Libraries
Libraries
Libraries
Compiler
Compiler Libraries
Libraries

Database
Database OS
OS
Management
Management
System
System

Hardware
 Slide 1-7
Application Software, System Software, and the OS

Human-Computer Interface

Application Software
API
System Software
(More Abstract Resources)
OS Interface
Trusted OS
(Abstract Resources)

Software-Hardware Interface

Hardware Resources
 Slide 1-8
The OS as Resource Manager
•Process: An executing program
•Resource: Anything that is needed for a
process to run
–Memory
–Space on a disk
–The CPU

•“An OS creates resource abstractions”

•“An OS manages resource sharing”
 Slide 1-9
Resource Abstraction
load(block, length, device);
seek(device, 236);
out(device, 9)

write(char *block, int len, int device,

int track, int sector) {
...
load(block, length, device);
seek(device, 236);
out(device, 9);
...
}

write(char *block, int len, int device,int addr);

fprintf(fileID, “%d”, datum);

 Disk Abstractions Slide 1-10

Application
Programmer
OS Programmer

int fprintf(…) {
...
void write() { write(…)
load(…); …
seek(…) }
load(…);
seek(…); out(…)
out(…); }

(a) Direct Control (b) write() (c) fprintf()

abstraction abstraction
 Slide 1-11
Abstract Resources

User Interface

Application

Abstract Resources (API)

Middleware

OS Resources (OS Interface)

OS

Hardware Resources
 Slide 1-12

Abstract Machines
Abstract
Machines
Idea
Program
Program Result
Result
Physical
Machine
Idea

Program
Program Result
Result

…
…
…

Idea

Program
Program Result
Result
 Slide 1-13
Resource Sharing

• Space- vs time-multiplexed sharing

• To control sharing, must be able to isolate
resources
• OS usually provides mechanism to isolate,
then selectively allows sharing
– How to isolate resources
– How to be sure that sharing is acceptable
• Concurrency
 The OS as a Conductor Slide 1-14

The OS coordinates the sharing and use of all the

components in the computer
 Multiprogramming Slide 1-15

Abstract Abstract Abstract

Machine Pi Machine Pj Machine Pk

OS Resource Sharing

PPi Memory
i Memory

PPk Memory
k Memory

…
Time-multiplexed PPj Memory
j Memory
Physical Processor
Space-multiplexed
Physical Memory
 Slide 1-16

Multiprogramming(2)
• Technique for sharing the CPU among
runnable processes
– Process may be blocked on I/O
– Process may be blocked waiting for other
resource, including the CPU
• While one process is blocked, another
might be able to run
• Multiprogramming OS accomplishes CPU
sharing “automatically” – scheduling
• Reduces time to run all processes
 Slide 1-17
How Multiprogramming Works

Process 1

Process 2

Process 3

Time-multiplexed CPU
Process 4

Space-multiplexed Memory
Speeding Up the Car Wash Slide 1-18

Vacuum
Wash Dry
Inside

(a) The Sequential Car Wash

Vacuum
Inside

Wash Dry

(b) The Parallel Car Wash

 Slide 1-19

Multiprogramming Performance
Pi’s Total Execution Time, ti
Time
0 ti
(a) Pi’s Use of Machine Resources

P1
P2
…
Pi
…
PN
Time

(a) All Processes’ Use of Machine Resources

Using the processor
I/O operation
 Slide 1-20
OS Strategies

• Batch processing
• Timesharing
• Personal computer & workstations
• Process control & real-time
• Network
• Distributed
• Small computers
 Slide 1-21

Batch Processing

Job 3
Job 19

Input Spooler Output Spooler

Input Spool Output Spool

 Batch Processing(2) Slide 1-22

• Uses multiprogramming
• Job (file of OS commands) prepared offline
• Batch of jobs given to OS at one time
• OS processes jobs one-after-the-other
• No human-computer interaction
• OS optimizes resource utilization
• Batch processing (as an option) still used
today
 Slide 1-23
A Shell Script Batch File

cc -g -c menu.c
cc -g -o driver driver.c menu.o
driver < test_data > test_out
lpr -PthePrinter test_out
tar cvf driver_test.tar menu.c driver.c test_data test_out
uuencode driver_test.tar driver_test.tar >driver_test.encode
 Slide 1-24

Timesharing Systems
Abstract
Machines

Result
Physical
Command Machine

Result

Command

…
Result

Command
 Timesharing Systems(2) Slide 1-25

Computer Research Corp ‘67

• Uses multiprogramming
• Support interactive computing model
(Illusion of multiple consoles)
• Different scheduling & memory allocation
strategies than batch
• Tends to propagate processes
• Considerable attention to resource isolation
(security & protection)
• Tend to optimize response time
 Slide 1-26
Personal Computers
• CPU sharing among one person’s processes
• Power of computing for personal tasks
– Graphics
– Multimedia
• Trend toward very small OS
• OS focus on resource abstraction
• Rapidly evolved to “personal multitasking”
systems
 Slide 1-27
Process Control & Real-Time
• Computer is dedicated to a single purpose
• Classic embedded system
• Must respond to external stimuli in fixed
time
• Continuous media popularizing real-time
techniques
• An area of growing interest
 Slide 1-28
Networks

• LAN (Local Area Network) evolution

• 3Mbps (1975)  10 Mbps (1980)  100 Mbps
(1990)  1 Gbps (2000)
• High speed communication means new way to do
computing
– Shared files
– Shared memory
– Shared procedures/objects
– ???
 Slide 1-29
Distributed OS

• Wave of the future

App App App

App App App

Distributed OS

Multiple Computers connected by a Network

 Small Computers Slide 1-30

• PDAs, STBs, embedded systems became

commercially significant
• Have an OS, but
– Not general purpose
– Limited hardware resources
– Different kinds of devices
• Touch screen, no keyboard
• Graffiti
– Evolving & leading to new class of Oses
• PalmOS, Pocket PC (WinCE), VxWorks, …
 Slide 1-31
Evolution of Modern OS

Timesharing
Network OS
Memory Mgmt
Scheduling PC & Wkstation Client-Server Model
Batch Protection
System software
Protocols

Memory Mgmt Human-Computer Real-Time

Protection Interface
Scheduling Scheduling
Files
Devices Small Computer
Network storage,
Modern OS Resource management
 Examples of Modern OS Slide 1-32

• UNIX variants (e.g. Linux) -- have evolved

since 1970
• Windows NT/2K -- has evolved since 1989
(much more modern than UNIX
– Win2K = WinNT, V5
• Research OSes – still evolving …
• Small computer OSes – still evolving …
The Microsoft OS Family Slide 1-33

Win32
Win32API
API
Win32
Win32API
APISubset
Subset
Win32
Win32API
APISubSet
SubSet

Windows
WindowsCE CE
(Pocket
(PocketPC)
PC)

Windows
Windows95/98/Me
95/98/Me

Windows
WindowsNT/2000/XP
NT/2000/XP
 Slide 1-34
Summary

An Operating System must be able to:

• provide functionality to apps
• provide abstraction of hardware to users and apps
• provide the sharing of resources to processes
• provide security and protection
• be as transparent as possible
• be as light as possible