Chapter 1: Introduction Chapter 1: Introduction: 1.1 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts

Chapter 1: Introduction
Operating System Concepts 1.1 Silberschatz, Galvin and Gagne ©2005

Chapter 1: Introduction
What Operating Systems Do
Computer-System Organization
Computer-System Architecture
Operating-System Structure
Operating-System Operations
Process Management
Memory Management
Storage Management
Protection and Security
Distributed Systems
Special-Purpose Systems
Computing Environments

Objectives
To provide a grand tour of the major operating

systems components
To provide coverage of basic computer system
organization

What is an Operating System?
A program that acts as an intermediary between

a user of a computer and the computer
hardware.
A program manages the computer hardware
Operating system goals:
Execute user programs and make solving user
problems easier.
Make the computer system convenient to use.
Use the computer hardware in an efficient
manner.

Computer System Structure
Computer system can be divided into four components

Hardware – provides basic computing resources
CPU, memory, I/O devices
Operating system
Controls and coordinates use of hardware among various
applications and users
Application programs – define the ways in which the system
resources are used to solve the computing problems of the
users
Word processors, compilers, web browsers, database
systems, video games
Users
People, machines, other computers

Four Components of a Computer System

Operating System Definition
OS is a resource allocator
Manages all resources
Decides between conflicting requests for efficient and
fair resource use
OS is a control program
Controls execution of programs to prevent errors and
improper use of the computer

Operating System Definition (Cont.)
No universally accepted definition

“Everything a vendor ships when you order an
operating system” is good approximation
But varies wildly
“The one program running at all times on the
computer” is the kernel. Everything else is either
a system program (ships with the operating
system) or an application program

Computer Startup
Bootstrap program is loaded at power-up or

reboot
Typically stored in ROM or EEPROM, generally known
as firmware
Initializes all aspects of system
Loads operating system kernel and starts execution

Goals of OS
Primary-- convenient
make the computer system convenient to use
Secondary-- efficient
use the computer hardware in an efficient manner
The two goals are contradictory sometimes

In the past, the secondary goal is more important.

Computer System Organization
Computer-system operation
One or more CPUs, device controllers connect through
common bus providing access to shared memory
Concurrent execution of CPUs and devices competing for
memory cycles

Computer--System Operation
Computer
I/O devices and the CPU can execute

concurrently.
Each device controller is in charge of a particular
device type.
Each device controller has a local buffer.
CPU moves data from/to main memory to/from
local buffers
I/O is from the device to local buffer of controller.
Device controller informs CPU that it has finished
its operation by causing an interrupt.

Common Functions of Interrupts
Interrupt transfers control to the interrupt service

routine generally, through the interrupt vector,
which contains the addresses of all the service
routines.
Interrupt architecture must save the address of the
interrupted instruction.
Incoming interrupts are disabled while another
interrupt is being processed to prevent a lost
interrupt.
A trap is a software-generated interrupt caused
either by an error or a user request.
An operating system is interrupt driven.

Interrupt Handling
The operating system preserves the state of the
CPU by storing registers and the program counter.
Determines which type of interrupt has occurred:
polling
vectored interrupt system
Separate segments of code determine what action
should be taken for each type of interrupt

resident monitor
1
interrupt 2
vector
i
2 perform the service
routine for device i
service routine
for device i
return to
1 3
user
an interrupt
from device i a:=b+c
occurs d:=3*c
user program

resident monitor
case n
1 read perform
2
I/O
trap to
monitor
return to
system call n 3
user
d:=3*c
user program

Interrupt Timeline

Direct Memory Access Structure
Used for high-speed I/O devices able to transmit

information at close to memory speeds.
Device controller transfers blocks of data from
buffer storage directly to main memory without
CPU intervention.
Only one interrupt is generated per block, rather
than the one interrupt per byte.
Cycle stealing: Either the DMA controller can use
the data bus when the CPU does not need it, or it
may force the CPU to temporarily suspend
operation. The latter technique is called cycle
stealing.

Storage Structure
Main memory – only large storage media that the

CPU can access directly.
Secondary storage – extension of main memory
that provides large nonvolatile storage capacity.
Magnetic disks – rigid metal or glass platters
covered with magnetic recording material
Disk surface is logically divided into tracks, which are
subdivided into sectors.
The disk controller determines the logical interaction
between the device and the computer.

Moving--Head Disk Mechanism
Moving

Storage Hierarchy
Storage systems organized in hierarchy.
Speed
Cost
Volatility
Caching – copying information into faster storage
system; main memory can be viewed as a last cache
for secondary storage.
storage

Storage--Device Hierarchy
Storage

Caching (1)
Important principle, performed at many levels in a
computer (in hardware, operating system, software)
Information in use copied from slower to faster storage
temporarily
Faster storage (cache) checked first to determine if
information is there
If it is, information used directly from the cache (fast)
If not, data copied to cache and used there
Smaller than storage being cached
Cache management
Cache size and replacement policy

Caching (2)
Use of high-speed memory to hold recently
recently--accessed
data.
data
Caching introduces another level in storage hierarchy.
hierarchy
This requires data that is simultaneously stored in more
than one level to be consistent.

Performance of Various Levels of
Storage
Movement between levels of storage hierarchy
can be explicit or implicit

Migration of Integer A from Disk to
Register
Multitasking environments must be careful to use
most recent value, not matter where it is stored in
the storage hierarchy
Multiprocessor environment must provide cache

coherency in hardware such that all CPUs have
the most recent value in their cache
Distributed environment situation even more
complex
Several copies of a datum can exist
Various solutions covered in Chapter 16
Coherency and Consistency
In a hierarchical storage system, the same data may appear in
different levels.
Change the copy in register make it inconsistent with other copies
No problem for single task accessing (Highest
Highest level is used)
Multi-task accessing: need to ensure each access obtain the most
recent value
Multiprocessor environment
Each CPU has a local cache.
Cache coherency problem: make sure that an update to a copy in one
cache is immediately reflected in all copies of other caches.
Distributed environment
Several copies of the same file can be kept on different computers

Computer--System Architecture
Computer
Single-Processor Systems: one main CPU +

device-specific processors such as disk,
keyboard, and graphic controllers
Multiprocessor Systems (parallel systems or
tightly coupled systems): two or more processors
in close communication, sharing the bus, clock,
memory, disks…
Increased throughput
Economy of scale: can share peripherals
Increased reliability: fault tolerant
Asymmetric and Symmetric multiprocessing

Computer--System Architecture
Computer
Clustered Systems: clustered computers share

storage and closely linked via local-area
network(LAN) or a faster interconnect network
such as InfiniBand
Asymmetric and Symmetric cluster systems
Grid Computing: the creation of a "virtual
supercomputer" by using a network of
geographically dispersed computers.

Operating System Structure
Historical Review
Mainframe: Batch
Mainframe: Multiprogramming
Mainframe: Time-Sharing
Desktop Systems, PC
Parallel Systems

Mainframe: Batch Systems
Main job of early OS: automatically transfer control from
one job to the next. (resident in memory)
To speed up processing, jobs with similar needs were
batched together and were running through the
computer as a group.
A batch operating system
Programmers submit jobs (program, data, control cards)
Operator sort jobs into batches with similar requirements
(FORTRAN, COBOL)
OS transfers control from one job to the next.

$END
$RUN
$LOAD
$FNT
$JOB
data for the program
program to be compiled

Memory Layout for a Simple Batch
System

Mainframe: Multiprogramming
Multiprogramming needed for efficiency

Single user cannot keep CPU and I/O devices busy at all
times
Multiprogramming organizes jobs (code and data) so
CPU always has one to execute
A subset of total jobs in system is kept in memory
One job selected and run via job scheduling
When it has to wait (for I/O for example), OS switches to
another job

Memory Layout for
Multiprogrammed System

Job Scheduling
Operating System
CPU Scheduling
Job 1
CPU
Job 2
Job 3
Job pool
Job 4

Mainframe: Time-
Time-Sharing Systems
Disadvantages of a multiprogrammed batched systems
No interaction with users: users must set up control cards for all
possible outcomes.
Statically debugging: long turnaround time inhibits experimentation.
(But, it instills good discipline of writing/testing)
An interactive (or hand-on) system: allows on-line
communication between users and the system. (Usually,
keyboard/screen are used. Users can see results
immediately.)

Mainframe: Time-
Time-Sharing Systems
Timesharing (multitasking) is logical extension
in which CPU switches jobs so frequently that
users can interact with each job while it is running,
creating interactive computing
Response time should be < 1 second
Each user has at least one program executing in
memory process
If several jobs ready to run at the same time CPU
scheduling
If processes don’t fit in memory, swapping moves them
in and out to run
Virtual memory allows execution of processes not
completely in memory

Operating--System Operations
Operating
Interrupt driven by hardware
Software error or request creates exception or trap
Division by zero, request for operating system service
Other process problems include infinite loop, processes
modifying each other or the operating system
Dual-mode operation allows OS to protect itself and other
system components
User mode and kernel mode
Mode bit provided by hardware
Provides ability to distinguish when system is running user
code or kernel code
Some instructions designated as privileged, only
executable in kernel mode
System call changes mode to kernel, return from call resets
it to user

Transition from User to Kernel
Mode
Timer to prevent infinite loop / process hogging
resources
Set interrupt after specific period
Operating system decrements counter
When counter zero generate an interrupt
Set up before scheduling process to regain control or terminate
program that exceeds allotted time

Process Management
A process is a program in execution. It is a unit of work within the

system. Program is a passive entity, process is an active entity.
Process needs resources to accomplish its task
CPU, memory, I/O, files
Initialization data
Process termination requires reclaim of any reusable resources
Single-threaded process has one program counter specifying
location of next instruction to execute
Process executes instructions sequentially, one at a time, until
completion
Multi-threaded process has one program counter per thread
Typically system has many processes, some user, some operating
system running concurrently on one or more CPUs
Concurrency by multiplexing the CPUs among the processes / threads

Process Management Activities
The operating system is responsible for the

following activities in connection with process
management:
Creating and deleting both user and system processes
Suspending and resuming processes
Providing mechanisms for process synchronization
Providing mechanisms for process communication
Providing mechanisms for deadlock handling

Memory Management
All data in memory before and after processing

All instructions in memory in order to execute
Memory management determines what is in
memory when
Optimizing CPU utilization and computer response to users
Memory management activities

Keeping track of which parts of memory are currently being
used and by whom
Deciding which processes (or parts thereof) and data to move
into and out of memory
Allocating and deallocating memory space as needed

Storage Management
OS provides uniform, logical view of information storage
Abstracts physical properties to logical storage unit - file
Each medium is controlled by device (i.e., disk drive, tape drive)
Varying properties include access speed, capacity, data-
transfer rate, access method (sequential or random)
File-System management
Files usually organized into directories
Access control on most systems to determine who can access
what
OS activities include
Creating and deleting files and directories
Supporting primitives to manipulate files and dirs
Mapping files onto secondary storage
Backup files onto stable (non-volatile) storage media

Mass--Storage Management
Mass
Usually disks used to store data that does not fit in main memory or
data that must be kept for a “long” period of time.
Proper management is of central importance
Entire speed of computer operation may hinge on disk subsystem
and its algorithms
OS activities
Free-space management
Storage allocation
Disk access scheduling
Some storage need not be fast
Tertiary storage includes optical storage, magnetic tape
Still must be managed
Varies between WORM (write-once, read-many-times) and RW (read-
write)

I/O Subsystems
One purpose of OS is to hide peculiarities of

hardware devices from the user
I/O subsystem responsible for
Memory management of I/O including buffering (storing data
temporarily while it is being transferred), caching (storing parts
of data in faster storage for performance), spooling (the
overlapping of output of one job with input of other jobs)
General device-driver interface
Drivers for specific hardware devices

Protection and Security (1)
Protection – any mechanism for controlling
access of processes or users to resources defined
by the OS
Security – defense of the system against internal
and external attacks
Huge range, including denial-of-service, worms, viruses,
identity theft, theft of service

Protection and Security (2)
Systems generally first distinguish among users,
to determine who can do what
User identities (user IDs, security IDs) include name and
associated number, one per user
User ID then associated with all files, processes of that
user to determine access control
Group identifier (group ID) allows set of users to be
defined and controls managed, then also associated with
each process, file
Privilege escalation allows user to change to effective
ID with more rights

Special--Purpose Systems
Special
Real-Time Embedded Systems: have well-defined

and fixed time constraints
Multimedia Systems: to handle multimedia data
including data, audio, and video
Handheld Systems: include PDAs and cellular
phones

Computing Environments
Traditional computing
Blurring over time
Office environment
PCs connected to a network, terminals attached to
mainframe or minicomputers providing batch and
timesharing
Now portals allowing networked and remote systems
access to same resources
Home networks
Used to be single system, then modems
Now firewalled, networked

Computing Environments (Cont.)
Client-Server Computing
Dumb terminals supplanted by smart PCs
Many systems now servers, responding to requests generated
by clients
Compute-server provides an interface to client to request
services (i.e. database)
File-server provides interface for clients to store and
retrieve files

Peer--to
Peer to--Peer Computing
Another model of distributed system

P2P does not distinguish clients and servers
Instead all nodes are considered peers
May each act as client, server or both
Node must join P2P network
Registers its service with central lookup service on network, or
Broadcast request for service and respond to requests for
service via discovery protocol
Examples include Napster and Gnutella

Web--Based Computing
Web
Web has become ubiquitous

PCs most prevalent devices
More devices becoming networked to allow web
access
New category of devices to manage web traffic
among similar servers: load balancers
Use of operating systems like Windows 95, client-
side, have evolved into Linux and Windows XP,
which can be clients and servers

Homework
2, 4, 7, 8, 9, 10, 12 (a, c, e, g)
Due: Oct. 10, 2007

End of Chapter 1

Chapter 1: Introduction Chapter 1: Introduction: 1.1 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts

Uploaded by

Copyright:

Available Formats

Chapter 1: Introduction Chapter 1: Introduction: 1.1 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Chapter 1: Introduction Chapter 1: Introduction: 1.1 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts

Uploaded by

Copyright:

Available Formats

Chapter 1: Introduction

Operating System Concepts 1.1 Silberschatz, Galvin and Gagne ©2005

Operating System Concepts 1.2 Silberschatz, Galvin and Gagne ©2005

To provide a grand tour of the major operating

Operating System Concepts 1.3 Silberschatz, Galvin and Gagne ©2005

A program that acts as an intermediary between

Operating System Concepts 1.4 Silberschatz, Galvin and Gagne ©2005

Computer system can be divided into four components

Operating System Concepts 1.5 Silberschatz, Galvin and Gagne ©2005

Operating System Concepts 1.6 Silberschatz, Galvin and Gagne ©2005

Operating System Concepts 1.7 Silberschatz, Galvin and Gagne ©2005

No universally accepted definition

Operating System Concepts 1.8 Silberschatz, Galvin and Gagne ©2005

Bootstrap program is loaded at power-up or

Operating System Concepts 1.9 Silberschatz, Galvin and Gagne ©2005

The two goals are contradictory sometimes

Operating System Concepts 1.10 Silberschatz, Galvin and Gagne ©2005

Operating System Concepts 1.11 Silberschatz, Galvin and Gagne ©2005

I/O devices and the CPU can execute

Operating System Concepts 1.12 Silberschatz, Galvin and Gagne ©2005

Interrupt transfers control to the interrupt service

Operating System Concepts 1.13 Silberschatz, Galvin and Gagne ©2005

Operating System Concepts 1.14 Silberschatz, Galvin and Gagne ©2005

Operating System Concepts 1.15 Silberschatz, Galvin and Gagne ©2005

Operating System Concepts 1.16 Silberschatz, Galvin and Gagne ©2005

Operating System Concepts 1.17 Silberschatz, Galvin and Gagne ©2005

Used for high-speed I/O devices able to transmit

Operating System Concepts 1.18 Silberschatz, Galvin and Gagne ©2005

Main memory – only large storage media that the

Operating System Concepts 1.19 Silberschatz, Galvin and Gagne ©2005

Operating System Concepts 1.20 Silberschatz, Galvin and Gagne ©2005

Operating System Concepts 1.21 Silberschatz, Galvin and Gagne ©2005

Operating System Concepts 1.22 Silberschatz, Galvin and Gagne ©2005

Operating System Concepts 1.23 Silberschatz, Galvin and Gagne ©2005

Operating System Concepts 1.24 Silberschatz, Galvin and Gagne ©2005

Operating System Concepts 1.25 Silberschatz, Galvin and Gagne ©2005

Multiprocessor environment must provide cache

Operating System Concepts 1.27 Silberschatz, Galvin and Gagne ©2005

Single-Processor Systems: one main CPU +

Operating System Concepts 1.28 Silberschatz, Galvin and Gagne ©2005

Clustered Systems: clustered computers share

Operating System Concepts 1.29 Silberschatz, Galvin and Gagne ©2005

Operating System Concepts 1.30 Silberschatz, Galvin and Gagne ©2005

Operating System Concepts 1.31 Silberschatz, Galvin and Gagne ©2005

data for the program

Operating System Concepts 1.32 Silberschatz, Galvin and Gagne ©2005

Operating System Concepts 1.33 Silberschatz, Galvin and Gagne ©2005

Multiprogramming needed for efficiency

Operating System Concepts 1.34 Silberschatz, Galvin and Gagne ©2005

Operating System Concepts 1.35 Silberschatz, Galvin and Gagne ©2005

Operating System Concepts 1.36 Silberschatz, Galvin and Gagne ©2005

Operating System Concepts 1.37 Silberschatz, Galvin and Gagne ©2005

Operating System Concepts 1.38 Silberschatz, Galvin and Gagne ©2005

Operating System Concepts 1.39 Silberschatz, Galvin and Gagne ©2005

Operating System Concepts 1.40 Silberschatz, Galvin and Gagne ©2005

A process is a program in execution. It is a unit of work within the

Operating System Concepts 1.41 Silberschatz, Galvin and Gagne ©2005

The operating system is responsible for the

Operating System Concepts 1.42 Silberschatz, Galvin and Gagne ©2005