Download Introduction to Object Technology

Operating System Overview
Chapter 2
Announcements
• Homework 0 will be posted today, due
next Wednesday (September 17) at noon
• Project requires the following book
– OSP An Environment for Operating System
Project by Kifer and Smolka, Addison
Wesley, 1991
– first project assignment will be posted next
week
Basic computer structure
CPU
Memory
memory bus
I/O bus
disk
Net interface
Memory caches
• motivated by the mismatch between processor and
memory speed
• closer to the processor than the main memory
• smaller and faster than the main memory
• act as “attraction memory”: contains the value of main
memory locations which were recently accessed
(temporal locality)
• transfer between caches and main memory is performed
in units called cache blocks/lines
• caches contain also the value of memory locations which
are close to locations which were recently accessed
(spatial locality)
Cache design issues
cpu
word transfer
cache
block transfer
main
memory
•
•
•
•
cache size and cache block size
mapping: physical/virtual caches, associativity
replacement algorithm: LRU
write policy: write through/write back
Memory Hierarchy
cpu
word transfer
cache
block transfer
main memory
page transfer
disks
• decrease cost per bit
• decrease frequency of
access
• increase capacity
• increase access time
• increase size of transfer
unit
Data transfer on the bus
CPU
cache
Memory
memory bus
I/O bus
disk
•
•
•
•
Net interface
cache-memory: cache misses, write-through/write-back
memory-disk: swapping, paging, file accesses
memory-Network Interface : packet send/receive
I/O devices to the processor: interrupts
Direct Memory Access (DMA)
• bulk data transfer between memory and an I/O device (disk,
network interface) initiated by the processor







address of the I/O device
starting location in memory
number of bytes
direction of transfer (read/write from/to
memory)
processor interrupted when the operation completes
bus arbitration between cache-memory and DMA
transfers
memory cache must be consistent with DMA
Multiprocessors
CPU
cache
CPU
cache
Memory
memory bus
I/O bus
disk
•
•
•
•
•
Net interface
simple scheme: more than one processor on the same bus
memory is shared among processors-- cache consistency
bus contention increases -- does not scale
alternative (non-bus) system interconnect -- expensive
single-image operating systems
Multicomputers
CPU
cache
CPU
cache
Memory
Memory
memory bus
memory bus
I/O bus
I/O bus
network
disk
•
•
•
•
Net interface
Net interface
disk
network of computers: “share-nothing” -- cheap
communication through message-passing: difficult to program
challenge: build efficient shared memory abstraction in software
each system runs its own operating system
Operating System
• A program that controls the execution of
application programs
• An interface between applications and
hardware
Operating System Objectives
• Convenience
– Makes the computer more convenient to use
• Efficiency
– Allows computer system resources to be
used in an efficient manner
• Ability to evolve
– Permit effective development, testing, and
introduction of new system functions
without interfering with service
Layers of Computer System
Services Provided by the
Operating System
• Program development
– Editors and debuggers
• Program execution
• Access to I/O devices
• Protected access to files
Services Provided by the
Operating System
• Error detection and response
– internal and external hardware errors
• memory error
• device failure
– software errors
• arithmetic overflow
• access forbidden memory locations
– error recovery
Services Provided by the
Operating System
• Accounting
–
–
–
–
collect statistics
monitor performance
used to anticipate future enhancements
used for billing users
Operating System
• Functions same way as ordinary
computer software
– It is a program that is executed to service
requests coming
• from applications: system calls
• from the hardware: interrupts
• Operating system services the request,
then relinquishes control of the
processor to execute other programs
Kernel
• Portion of operating system that is
resident in main memory
• Contains a machine-independent part
(code for system calls) and a machinedependent part (device drivers)
• Maintains the OS state
• Executes in privileged/supervisor mode
Evolution of Operating
Systems
• Serial Processing
– No operating system
– Machines run from a console with display
lights and toggle switches, input device, and
printer
– Schedule tome
– Setup included loading the compiler, source
program, saving compiled program, and
loading and linking
Evolution of Operating
Systems
• Simple Batch Systems
– Monitors
• Software that controls the running programs
• Batch jobs together
• Program branches back to monitor when
finished
• Resident monitor is in main memory and
available for execution
Job Control Language (JCL)
• Special type of programming language
• Provides instruction to the monitor
– what compiler to use
– what data to use
Hardware Features
• Memory protection
– do not allow the memory area containing
the monitor to be altered
• Timer
– prevents a job from monopolizing the
system
Hardware Features
• Memory protection
– do not allow the memory area containing
the monitor to be altered
• Timer
– prevents a job from monopolizing the
system
Uniprogramming
• Processor must wait for I/O instruction
to complete before preceding
Multiprogramming
• When one job needs to wait for I/O, the
processor can switch to the other job
Multiprogramming
Time Sharing
• Using multiprogramming to handle
multiple interactive jobs
• Processor’s time is shared among
multiple users
• Multiple users simultaneously access the
system through terminals
Batch Multiprogramming
versus Time Sharing
Batch Multiprogramming
Principal objective
Maximize processor use
Job control language
Source of directives
commands provided with
to operating system
the job
Time Sharing
Minimize response
time
Commands entered at
the terminal
Main OS Concepts
•
•
•
•
•
Processes
Memory Management
Information protection and security
Scheduling and resource management
System structure
Processes
• A program in execution
• An instance of a program running on a
computer
• The entity that can be assigned to and
executed on a processor
• A unit of activity characterized by a
single sequential thread of execution, a
current state, and an associated set of
system resources
Difficulties with Designing
System Software
• Improper synchronization
– ensure a process waiting for an I/O device
receives the signal
• Failed mutual exclusion
• Nondeterminate program operation
– program should only depend on input to it,
not relying on common memory areas
• Deadlocks
Process
• Consists of three components
– An executable program
– Associated data needed by the program
– Execution context of the program
• All information the operating system needs to
manage the process
Process
Memory Management
•
•
•
•
•
Process isolation
Automatic allocation and management
Support for modular programming
Protection and access control
Long-term storage
Virtual Memory
• Allows programmers to address memory
from a logical point of view
File System
• Implements long-term store
• Information stored in named objects
called files
Paging
• Allows process to be comprised of a
number of fixed-size blocks, called
pages
• Virtual address is a page number and an
offset within the page
• Each page may be located any where in
main memory
• Real address or physical address in main
memory
Virtual Memory Addressing
Information Protection and
Security
• Access control
– regulate user access to the system
• Information flow control
– regulate flow of data within the system and
its delivery to users
• Certification
– proving that access and flow control
perform according to specifications
Scheduling and Resource
Management
• Fairness
– give equal and fair access to all processes
• Differential responsiveness
– discriminate between different classes of
jobs/users
• Efficiency
– maximize throughput, minimize response
time, and accommodate as many uses as
possible
Major Elements of
Operating System
System Structure
• View the system as a series of levels
• Each level performs a related subset of
functions
• Each level relies on the next lower level
to perform more primitive functions
• This decomposes a problem into a
number of more manageable
subproblems
Operating System Design
Hierarchy
Level Name
Objects
Example Operations
4
Interrupts
retry
programs
Interrupt-handling
Invoke, mask, unmask,
3
Procedures
Procedures, call stack,
display
Mark stack, call, return
2
Instruction Set
Evaluation stack, micro- Load, store, add, subtract
program interpreter,
branch
scalar and array data
1
Electronic circuits
Registers, gates, buses,
etc.
Clear, transfer, activate,
complement
Operating System Design
Hierarchy
Level Name
Objects
Example Operations
7
Virtual Memory
Segments, pages
Read, write, fetch
6
Local secondary
store
Blocks of data, device Read, write, allocate, free
channels
5
Primitive processes Primitive process,
semaphores, ready
list
Suspend, resume, wait, signal
Operating System Design
Hierarchy
Level Name
Objects
Example Operations
13
Shell
User programming
environment
Statements in shell language
12
User processes
User processes
Quit, kill, suspend, resume
11
Directories
Directories
Create, destroy, attach, detach,
search, list
10
Devices
External devices, such Open, close,
as printer, displays
read, write
and keyboards
9
File system
Files
Create, destroy, open, close
read, write
8
Communications
Pipes
Create, destroy, open. close,
read, write
Traditional OS structure
• monolithic/layered systems

one/N layers all executed in “kernel-mode”

good performance but rigid
user
user
process
system calls
OS kernel
hardware
file
system
memory
system
Characteristics of Modern
Operating Systems
• Microkernel architecture
– assigns only a few essential functions to the
kernel
• address space
• interprocess communication (IPC)
• basic scheduling
Micro-kernel OS
user mode
micro-kernel
client
process
file
server
memory
server
IPC
hardware





client-server model, IPC between clients and servers
the micro-kernel provides protected communication
OS functions implemented as user-level servers
flexible but efficiency is the problem
easy to extend for distributed systems
Extensible OS kernel
process
process
my
memory
service
default
memory
service
user mode
extensible kernel


hardware
user processes can load customized OS services into
the kernel
good performance but protection and scalability
become problems
Characteristics of Modern
Operating Systems
• Multithreading
– process is divided into threads that can run
simultaneously
• Thread
– dispatchable unit of work
– executes sequentially and is interruptable
• Process is a collection of one or more
threads and associated system resources
Characteristics of Modern
Operating Systems
• Symmetric multiprocessing
– there are multiple processors
– these processors share same main memory
and I/O facilities
– All processors can perform the same
functions
Characteristics of Modern
Operating Systems
• Distributed operating systems
– provides the illusion of a single main
memory and single secondary memory
space
– used for distributed file system
UNIX
• Hardware is surrounded by the
operating-system
• Operating system is called the kernel
• Comes with a number of user services
and interfaces
– shell
– C compiler
UNIX
Modern UNIX Systems
•
•
•
•
System V Release 4 (SVR4)
Solaris 2.x
4.4BSD
Linux