Transcript Introduction to Object Technology

Operating System
Overview
Chapter 2
Operating System Objectives

Convenience


Efficiency


Makes the computer more convenient to use
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 (open system architectures)
API
ABI
Figure 2.1 Computer Hardware and Software Infrastructure
Key Interfaces

Instruction set architecture (ISA)
includes a specification of the set of opcodes (machine
language) implemented by a particular processor

Application binary interface (ABI)
the interface between a library and the operating system
at machine code level

Application programming interface (API)
set of subroutine definitions, protocols, and tools
for building software and applications.Make it easier
for developers to use certain technologies in building
applications by abstracting the underlying implementation
(e.g. POSIX, Windows API, and Java API)
Evolution of Operating Systems
 A major OS will evolve over time for a number of
reasons:
Hardware upgrades
+
New types of hardware
New services
Fixes
Evolution of Operating Systems
 Stages include:
Multiprogrammed
Batch Systems
Simple Batch
Systems
Serial
Processing
Time
Sharing
Systems
Serial Processing
Earliest Computers:

No operating system


Problems:

programmers interacted
directly with the computer
hardware

Computers ran from a console
with display lights, toggle
switches, some form of input
device, and a printer
Users have access to the
computer in “series”
most installations used a
hardcopy sign-up sheet to
reserve computer time



Scheduling:
time allocations could run short or
long, resulting in wasted computer
time
Setup time:

a considerable amount of time
was spent just on setting up
the program to run
Early Operating Systems (cont.)

Simple Batch Systems

Monitor: controls the running programs (always resident in
memory)

Batch jobs together
Program branches back to monitor when finished
Job Control Language (JCL)



Multiprogrammed Batch Systems

Timesharing systems
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 another job
Uniprogramming Multiprogramming
Processor use
22%
43%
Memory use
30%
67%
Disk use
33%
67%
Printer use
33%
67%
Elapsed time
30 min.
15 min.
Throughput rate
6 jobs/hr
12 jobs/hr
Mean response time
18 min.
10 min.
Time Sharing

Using multiprogramming to handle multiple interactive jobs

Processor’s time is shared among multiple users who simultaneously
access the system through terminals in short time intervals
They get the feeling of virtual ownership of the computer
Batch Multiprogramming vs. Time Sharing
Batch Multiprogramming
Time Sharing
Principal
objective
Maximize processor use
Minimize
response time
Source of
directives to OS
Job control language commands
provided with the job
Commands entered
at the terminal
Basic OS Organization
File
Manager
Process &
Resource
Manager
Processor(s)
Memory
Manager
Device
Manager
Main Memory
Devices
Kernel

Portion of operating system that is in main memory

Contains most-frequently used functions

Also called the nucleus
Typical UNIX Organization
Process
U
s
e
r
S
u
p
e
r
v
I
s
o
r
Libraries
Process
Kernel
Processor(s)
Process
Device Drivers
Main Memory
Devices
Unix Organization
Process
Process
Libraries
Process
File
Manager
System Call Interface
Deadlock
Protection
Process
Description
Synchronization
Device
Manager
Memory
Manager
Scheduler
Monolithic Kernel
Devices
Memory
CPU
Resource
Resource
Resource
Manager
Manager
Manager
Other H/W
Road Leading to Modern OS

Monolithic kernel



Microkernel architecture



a process divided into threads executing concurrently
Symmetric Multiprocessing (SMP)



small OS core containing only essential OS functions.
most services are implemented as external servers
Multithreading


large kernel including scheduling, file system,
networking, device drivers, memory management
single process with all elements sharing the same
address space
multiple, interconnected, homogeneous processors
using a shared memory
Threads can be scheduled across all of the processors
Distributed OS
Layered
vs.
Microkernel
Microkernels



Modern OS s use microkernel approach
Small operating system core
Contains only essential OS functions




memory management
interprocess communication (IPC)
basic scheduling
Many services traditionally included in the
operating system are now external subsystems
(sometimes called servers)
 device drivers
 file server
 windowing system
 security services

Examples: Mach ( Mac OS X), Minix, ChorusOS (SUN)
Technique in which a process, executing an application, is
divided into threads that can run concurrently
Thread



dispatchable unit of work
includes a processor context and its own data area to enable
subroutine branching
executes sequentially and is interruptible
Process


a collection of one or more threads and associated system resources
programmer has greater control over the modularity of the application
and the timing of application related events
Symmetric Multiprocessing (SMP)

Refers to a computer hardware architecture and also to the
OS behavior that exploits that architecture

Several processes can run in parallel

Multiple processors are transparent to the user



these processors share same main memory and I/O facilities
all processors can perform the same functions
The OS takes care of scheduling of threads or processes
on individual processors and of synchronization among
processors
SMP Advantages
Performance
more than one process can be running
simultaneously, each on a different
processor
Availability
failure of a single processor does not
halt the system
Incremental
Growth
performance of a system can be
enhanced by adding an additional
processor
Scaling
vendors can offer a range of products
based on the number of processors
configured in the system
Symmetric Multiprocessor OS
Considerations

A multiprocessor OS must provide all the functionality of a
multiprogramming system plus additional features to accommodate
multiple processors

Key design issues:
Simultaneous
concurrent
processes or
threads
kernel routines
need to be
reentrant to
allow several
processors to
execute the
same kernel
code
simultaneously
Synchronization
Memory
management
Scheduling
any processor
may perform
scheduling,
which
complicates
the task of
enforcing a
scheduling
policy
with multiple
active processes
having potential
access to shared
address spaces
or shared I/O
resources, care
must be taken to
provide effective
synchronization
the reuse of
physical
pages is the
biggest
problem of
concern
Reliability
and fault
tolerance
the OS should
provide
graceful
degradation in
the face of
processor
failure
Multicore OS Considerations


The design challenge for
a many-core multicore
system is to efficiently
harness the multicore
processing power and
intelligently manage the
substantial on-chip
resources efficiently
Potential for parallelism
exists at three levels:
hardware parallelism within each
core processor, known as
instruction level parallelism
potential for multiprogramming
and multithreaded execution
within each processor
potential for a single application
to execute in concurrent
processes or threads across
multiple cores

enables a single PC or server to simultaneously run multiple operating
systems or multiple sessions of a single OS

a machine can host numerous applications, including those that run on
different operating systems, on a single platform

host operating system can support a number of virtual machines (VM)
 each has the characteristics of a particular OS and, in some
versions of virtualization, the characteristics of a particular
hardware platform
Virtual
Machine
Concept
Major Achievements

Processes

Memory Management

Scheduling and resource management

System structure

Information protection and security
Process




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
Characterized by a single
sequential thread of execution,
a current state, and an
associated set of system
resources
Consists of three components
 executable program
 associated data
 execution context

The OS has five principal storage management
responsibilities:
process
isolation
automatic
allocation
and
management
support of
modular
programming
protection
and access
control
long-term
storage
Virtual Memory Addressing
Paging

process is divided into
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 anywhere
in main memory


The nature of the threat that
concerns an organization will
vary greatly depending on the
circumstances
The problem involves controlling
access to computer systems and
the information stored in them
Main
issues
availability
confidentiality
authenticity
data
integrity
Scheduling and Resource Management


Key responsibility of an OS is managing resources
Resource allocation policies must consider:

Fairness

give equal and fair access to
efficiency
fairness
all processes in the same class

Differential responsiveness


discriminate between
different classes of jobs
differential
responsiveness
Efficiency

maximize throughput, minimize response time, and accommodate as many
users/processes as possible
UNIX System Structure

Layered architecture - design the OS as a series of
levels where each level is performing a related subset
of functions

Each layer provides services to the layer above and
relies on the functions provided by the layer below

A change in one layer should not effect other layers
(hopefully!)

Modular design - decomposes a problem into a
number of more manageable sub problems

Ideally, lower levels deal with a far shorter time scale
Model of a Hierarchical OS
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
4
Interrupts
Interrupt-handling
Invoke, mask, unmask,
retry programs
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, buses, etc.
* Shaded area  Hardware
Suspend, resume, wait, signal
Clear, transfer, activate
Model of a Hierarchical OS
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
Layered vs. Microkernel
Benefits of a Microkernel
Organization

Uniform interface
All services are provided by means of message passing

Extensibility and Flexibility
New features can be added and existing feature
subtracted with minimal disruption.

Portability
Changes needed to port the system to a new processor is
mostly in the microkernel - not in the other services
(new compilation would be sufficient)

Reliability
Modular design allows rigorous testing

A microkernel interacts with local and remote server
processes in the same way, facilitating construction
of distributed systems.
UNIX
 Hardware
is surrounded
by the OS kernel
 Comes
with a number of
user services and
interfaces

Shell , C compiler, vi editor
 System

V Release 4 (SVR4)
New features: real-time
processing support,
process scheduling
classes, dynamically
allocated data structures,
virtual memory
management, and a
preemptive kernel
History




UNIX beginnings in 1969
AT & T Bell Laboratories (Ken Thompson & Dennis Richie)
Working version (in 1970) on a DEC PDP 11/70
UNIX and C Relationship

June 81: Berkeley UNIX 4.1 BSD (enhanced with vi, csh, and virtual
memory management)

1983: Berkeley UNIX 4.2 BSD (added TCP/IP networking, sockets and
a new file system)

1991  Linux is introduced by Linus B. Torvalds
BSD



Berkeley Software Distribution (BSD) is a UNIX OS derivative
developed at UC-Berkeley
4.xBSD is widely used in academic installations and has served as
the basis of a number of commercial UNIX products
4.4BSD was the final version of BSD released by Berkeley

major upgrade to 4.3BSD and includes



a new virtual memory system
changes in the kernel structure and other feature enhancements
FreeBSD



one of the most widely used and best documented versions
popular for Internet-based servers and firewalls
Mac OS X is based on FreeBSD 5.0 and the Mach 3.0 microkernel
Solaris 10

Sun’s SVR4-based UNIX release

Provides all of the features of SVR4 plus a number of
more advanced features such as:




a fully preemptable, multithreaded kernel
full support for SMP
an object-oriented interface to file systems
Most widely used and most successful commercial
UNIX implementation
LINUX Overview

Started out as a UNIX variant for the IBM PC

Linus Torvalds, a Finnish CS student, wrote the initial version

First posted on the Internet in 1991

Today it is a full-featured UNIX system that runs on several platforms


It is free and the source code is available.
Highly modular and easily configured

Key to success has been the availability of free software packages
Android Operating System

A Linux-based system originally
designed for touchscreen mobile
devices such as smartphones and
tablet computers

The most popular mobile OS

Development was done by
Android Inc., which was bought
by Google in 2005

1st commercial version (Android
1.0) was released in 2008

Most recent versions are
5.0 Lollipop (Nov 2014)
7.1 Nougat (Dec 2016)

The Open Handset Alliance
(OHA) was responsible for the
Android OS releases

The open-source nature of
Android has been the key to its
success