Operating

Systems:
Internals Chapter 2
and Design
Principles Operating System
Overview
Eighth Edition
By William Stallings
 Operating System
A program that controls the execution of
application programs
 An interface between applications and hardware
Main objectives of an OS:

• convenience
• efficiency
• ability to evolve
 Application programs
Application
programming interface
Application Libraries/utilities Software
binary interface
Operating system
Instruction Set
Architecture
Execution hardware

Memory
System interconnect
translation Hardware
(bus)

I/O devices
Main
and
memory
networking

Figure 2.1 Computer Hardware and Software Structure

 Operating System Services

 Program development
 Program execution
 Access I/O devices
 Controlled access to files
 System access
 Error detection and response
 Accounting
 Key Interfaces

 Instruction set architecture (ISA)

 Application binary interface (ABI)
 Application programming interface (API)
 The Role of an OS

A computer is a set of resources for the

movement, storage, and processing of
data
 TheOS is responsible for managing
these resources
 Operating System
as Software
 Functionsin the same way as ordinary
computer software
 Program, or suite of programs, executed
by the processor
 Frequentlyrelinquishes control and must
depend on the processor to allow it to
regain control
 Computer System
I/O Devices
Memory
Operating I/O Controller Printers,
System keyboards,
Software digital camera,
I/O Controller etc.

Programs
and Data

I/O Controller

Processor Processor

Storage
OS
Programs

Data

Figure 2.2 The Operating System as Resource Manager

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:

Time
Sharing
Multiprogrammed Systems
Batch Systems
Simple Batch
Systems
Serial
Processing
 Serial Processing
Earliest Computers: Problems:
 Scheduling:
 No operating system
 most installations used a
 programmers interacted
hardcopy sign-up sheet to
directly with the computer
reserve computer time
hardware
 time allocations could
 Computers ran from a console run short or long,
with display lights, toggle resulting in wasted
switches, some form of input computer time
device, and a printer
 Setup time
 Users have access to the
computer in “series”  a considerable amount of
time was spent just on setting
up the program to run
 Simple Batch Systems

 Early computers were very expensive

 important to maximize processor utilization

 Monitor
 user no longer has direct access to processor
 job is submitted to computer operator who batches
them together and places them on an input device
 program branches back to the monitor when finished
 Monitor Point of View
Interrupt
Processing

 Monitor controls the sequence Device

Drivers
of events Monitor
Job
Sequencing
Control Language
 Resident Monitor is software Boundary
Interpreter

always in memory
 Monitor reads in job and gives User
Program
control Area

 Job returns control to monitor

Figure 2.3 Memory Layout for a Resident Monitor

 Processor Point of View
 Processor executes instruction from the memory
containing the monitor
 Executes the instructions in the user program until it
encounters an ending or error condition
 “control is passed to a job” means processor is fetching and
executing instructions in a user program
 “control is returned to the monitor” means that the processor
is fetching and executing instructions from the monitor
program
Job Control Language
(JCL)
Special type of programming
language used to provide
instructions to the monitor

what compiler to use

what data to use

Desirable Hardware
Features
Memory protection for monitor

• while the user program is executing, it must not alter the memory area
containing the monitor

Timer

• prevents a job from monopolizing the system

Privileged instructions

• can only be executed by the monitor

Interrupts

• gives OS more flexibility in controlling user programs

 Modes of Operation

User Mode Kernel Mode

• user program executes in • monitor executes in kernel
user mode mode
• certain areas of memory are • privileged instructions may
protected from user access be executed
• certain instructions may not • protected areas of memory
be executed may be accessed
Simple Batch System
Overhead
 Processor time alternates between execution of user
programs and execution of the monitor
 Sacrifices:
 some main memory is now given over to the monitor
 some processor time is consumed by the monitor

 Despite overhead, the simple batch system improves

utilization of the computer
Multiprogrammed
Batch Systems
 Processor is
often idle
 even with
automatic
job
sequencing
 I/O devices
are slow
compared to
processor
 Uniprogramming

Program A Run Wait Run Wait

Time
(a) Uniprogramming

 The processor spends a certain amount of

time executing, until it reaches an I/O
Program A Run
instruction; itWait Rununtil that Wait
must then wait I/O
instruction concludes before proceeding
Program B Wait Run Wait Run Wait
Program A Run Wait Run Wait

Multiprogramming
Time
(a) Uniprogramming

Program A Run Wait Run Wait

Program B Wait Run Wait Run Wait

Run Run Run Run

Combined Wait Wait
A B A B
Time
(b) Multiprogramming with two programs

 There must be enough memory to hold the OS (resident

monitor) and
Program A Run
one user program
Wait Run Wait
 When one job needs to wait for I/O, the processor can switch to
the other job, which is likely not waiting for I/O
Program B Wait Run Wait Run Wait
 Program B Wait Run Wait Run Wait

Run Run Run Run

Multiprogramming
Combined Wait Wait
A B A B
Time
(b) Multiprogramming with two programs

Program A Run Wait Run Wait

Program B Wait Run Wait Run Wait

Program C Wait Run Wait Run Wait

Run Run Run Run Run Run

Combined Wait Wait
A B C A B C
Time
(c) Multiprogramming with three programs

 Multiprogramming
Figure 2.5 Multiprogramming Example
 also known as multitasking
 memory is expanded to hold three, four, or more programs
and switch among all of them
 Multiprogramming
Example

JOB1 JOB2 JOB3

Type of job Heavy compute Heavy I/O Heavy I/O
Duration 5 min 15 min 10 min
Memory required 50 M 100 M 75 M
Need disk? No No Yes
Need terminal? No Yes No
Need printer? No No Yes

Table 2.1 Sample Program Execution Attributes

 Effects on Resource
Utilization
Uniprogramming Multiprogramming
Processor use 20% 40%
Memory use 33% 67%
Disk use 33% 67%
Printer use 33% 67%
Elapsed time 30 min 15 min
Throughput 6 jobs/hr 12 jobs/hr
Mean response time 18 min 10 min

Table 2.2 Effects of Multiprogramming on Resource Utilization

 100% 100%

CPU CPU
0% 0%
100% 100%

Memory Memory
0% 0%
100% 100%

Disk Disk
0% 0%
100% 100%

Terminal Terminal
0% 0%
100% 100%

Printer Printer
0% 0%

Job History Job History JOB1

JOB1 JOB2 JOB3
JOB2
0 5 10 15 20 25 30
minutes JOB3

0 5 10 15
time
minutes
time
(a) Uniprogramming (b) Multiprogramming

Figure 2.6 Utilization Histograms

 Time-Sharing Systems
 Can be used to handle multiple interactive jobs
 Processor time is shared among multiple users
 Multiple users simultaneously access the
system through terminals, with the OS
interleaving the execution of each user
program in a short burst or quantum of
computation
 Batch Multiprogramming
vs. Time Sharing

Batch Multiprogramming Time Sharing

Principal objective Maximize processor use Minimize response time
Source of directives to Job control language Commands entered at the
operating system commands provided with the terminal
job

Table 2.3 Batch Multiprogramming versus Time Sharing

Compatible Time-Sharing
Systems
CTSS Time Slicing
 One of the first time-sharing  System clock generates interrupts at
operating systems a rate of approximately one every
0.2 seconds
 Developed at MIT by a group  At each interrupt OS regained
known as Project MAC control and could assign processor to
another user
 Ran on a computer with 32,000
36-bit words of main memory,  At regular time intervals the current
user would be preempted and
with the resident monitor another user loaded in
consuming 5000 of that
 Old user programs and data were
 To simplify both the monitor and written out to disk
memory management a program
was always loaded to start at the  Old user program code and data
were restored in main memory when
location of the 5000th word that program was next given a turn
 0 0 0
Monitor Monitor Monitor
5000 5000 5000
JOB 3
10000
JOB 1
JOB 2
(JOB 2)
20000

Free 25000 25000

Free Free
32000 32000 32000
(a) (b) (c)

0 0 0
Monitor Monitor Monitor
5000 5000 5000
JOB 4
JOB 1
15000 JOB 2
(JOB 1)
20000 20000
(JOB 2) (JOB 2)
25000 25000 25000
Free Free Free
32000 32000 32000
(d) (e) (f)

Figure 2.7 CTSS Operation

 Major Achievements
 Operating
Systems are among the most
complex pieces of software ever developed
Major advances in
development include:
• processes
• memory management
• information protection and security
• scheduling and resource
management
• system structure
 Process
 Fundamental to the structure of operating systems

A process can be defined as:

a program in execution
an instance of a running program

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
 Development of the
Process
 Three major lines of computer system development created
problems in timing and synchronization that contributed to
the development:
multiprogramming batch operation
• processor is switched among the various programs residing in main
memory

time sharing
• be responsive to the individual user but be able to support many users
simultaneously

real-time transaction systems

• a number of users are entering queries or updates against a database
 Causes of Errors
 Improper  Nondeterminate
synchronization program operation
 a program must wait until the  program execution is
data are available in a buffer interleaved by the processor
when memory is shared
 improper design of the
signaling mechanism can  the order in which programs
are scheduled may affect their
result in loss or duplication outcome

 Failed mutual exclusion  Deadlocks

 more than one user or  it is possible for two or more
program attempts to make programs to be hung up
use of a shared resource at waiting for each other
the same time
 may depend on the chance
 only one routine at a time
allowed to perform an timing of resource allocation
update against the file and release
 Components of
a Process
 A process contains  Theexecution context is
three components: essential:
 it is the internal data by
 an executable program which the OS is able to
 the associated data supervise and control the
process
needed by the program
 includes the contents of the
(variables, work space, various process registers
buffers, etc.)  includes information such
 the execution context as the priority of the process
(or “process state”) of and whether the process is
waiting for the completion
the program of a particular I/O event
 Main Processor
Memory Registers
Process index i

Process
PC
i
Process Base b
list Limit h
j

Management Other
registers

Context
Process
 The entire state of the A
Data

Program
process at any instant is (code)
contained in its context
b
 New features can be Process
Context

Data
designed and incorporated B h
Program
into the OS by expanding (code)
the context to include any
new information needed to
support the feature
Figure 2.8 Typical Process Implementation
 Memory Management
 The
OS has five principal storage
management responsibilities:

automatic
support of protection
process allocation long-term
modular and access
isolation and storage
programming control
management
 Virtual Memory
A facility that allows programs to address
memory from a logical point of view, without
regard to the amount of main memory
physically available
 Conceived to meet the requirement of having
multiple user jobs reside in main memory
concurrently
Paging
 Allows processes to be comprised of a number of fixed-
size blocks, called pages
 Program references a word by means of a virtual address
 consists of a page number and an offset within the page
 each page may be located anywhere in main memory

 Provides for a dynamic mapping between the virtual

address used in the program and a real (or physical)
address in main memory
 A.1
A.0 A.2
0 0
A.5
1 1
2 2
B.0 B.1 B.2 B.3
3 3
4 4
5 5
6 6
A.7
7 User
A.9
8 program
B
9
A.8
10

User
program
A
B.5 B.6

Main Memory Disk

Main memory consists of a Secondary memory (disk) can
number of fixed-length frames, hold many fixed-length pages. A
each equal to the size of a page. user program consists of some
For a program to execute, some number of pages. Pages for all
or all of its pages must be in programs plus the operating system
main memory. are on disk, as are files.

Figure 2.9 Virtual Memory Concepts

 Real
Memory Address
Processor Management
Virtual Unit
Address Main
Memory

Disk
Address

Secondary
Memory

Figure 2.10 Virtual Memory Addressing

 Information Protection
and Security
 The nature of the
threat that concerns
an organization will Main
vary greatly issues availability
depending on the
circumstances
authenticity confidentiality
 The problem involves
controlling access to data
computer systems integrity
and the information
stored in them
 Scheduling and
Resource Management
 Keyresponsibility of
an OS is managing
resources
fairness
efficiency
 Resource allocation
policies must
consider: differential
responsiveness
 Operating System
Service Call Service
from Process Call
Handler (code)

Long- Short- I/O

Interrupt
Term Term Queues
from Process Interrupt
Queue Queue
Interrupt Handler (code)
from I/O
Short-Term
Scheduler
(code)

Pass Control
to Process

Figure 2.11 Key Elements of an Operating System for Multiprogramming

 Different Architectural
Approaches
 Demands on operating systems require new
ways of organizing the OS

Different approaches and design elements have been tried:

• microkernel architecture
• multithreading
• symmetric multiprocessing
• distributed operating systems
• object-oriented design
Microkernel Architecture
 Assigns only a few essential functions to the
kernel:
interprocess
address basic
communication
spaces scheduling
(IPC)

 The approach:

is well suited to a
simplifies provides
distributed
implementation flexibility
environment
 Multithreading
 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)
 Term that 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
more than one process can be
Performance running simultaneously, each on a
different processor

failure of a single process does not

Availability halt the system

Incremental performance of a system can be

enhanced by adding an
Growth additional processor

vendors can offer a range of products

Scaling based on the number of processors
configured in the system
 Time

Process 1

Process 2

Process 3

(a) Interleaving (multiprogramming, one processor)

Process 1

Process 2

Process 3

(b) Interleaving and overlapping (multiprocessing; two processors)

Blocked Running

Figure 2.12 Multiprogramming and Multiprocessing

 OS Design
Distributed Operating Object-Oriented
System Design
 Provides the illusion of  Used for adding modular
 a single main memory space
extensions to a small kernel
 single secondary memory  Enables programmers to
space customize an operating system
 unified access facilities without disrupting system
integrity
 State of the art for distributed
operating systems lags that of
 Eases the development of
uniprocessor and SMP operating
systems distributed tools and full-blown
distributed operating systems
Fault Tolerance
 Refers to the ability of a system or component to continue
normal operation despite the presence of hardware or software
faults

 Typically involves some degree of redundancy

 Intended to increase the reliability of a system

 typically comes with a cost in financial terms or
performance

 The extent adoption of fault tolerance measures must be

determined by how critical the resource is
 Fundamental Concepts
 The basic measures are:
 Reliability
 R(t)
 defined as the probability of its correct operation up to time t given
that the system was operating correctly at time t=o
 Mean time to failure (MTTF)
 mean time to repair (MTTR) is the average time it takes to repair or
replace a faulty element
 Availability
 defined as the fraction of time the system is available to service
users’ requests
Availability Classes

Class Availability Annual Downtime

Continuous 1.0 0
Fault Tolerant 0.99999 5 minutes
Fault Resilient 0.9999 53 minutes
High Availability 0.999 8.3 hours
Normal Availability 0.99 - 0.995 44-87 hours

Table 2.4 Availability Classes

 Fault Categories
 Permanent Spatial (physical) redundancy
 a fault that, after it occurs,
is always present involves the use of multiple components that either perform the same
function simultaneously or are configured so that one component is
 the fault persists until the available as a backup in case of the failure of another component
faulty component is
replaced or repaired
Temporal redundancy
 Temporary
 a fault that is not present involves repeating a function or operation when an error is detected
all the time for all effective with temporary faults but not useful for permanent faults
operating conditions
 can be classified as
 Transient – a fault that
Information redundancy
occurs only once
 Intermittent – a fault provides fault tolerance by replicating or coding data in such a way that
bit errors can be both detected and corrected
that occurs at multiple,
unpredictable times
 Operating System
Mechanisms
 A number of techniques can be incorporated into OS
software to support fault tolerance:
 process isolation
 concurrency
 virtual machines
 checkpoints and rollbacks
 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 Scheduling Memory Reliability

concurrent Synchronization
management and fault
processes or tolerance
any
threads with multiple the reuse of
processor
may perform active processes physical
kernel routines having potential pages is the the OS
need to be scheduling,
which access to shared biggest should
reentrant to address spaces problem of provide
allow several complicates
the task of or shared I/O concern graceful
processors to resources, care degradation
execute the enforcing a
scheduling must be taken to in the face of
same kernel provide effective processor
code policy
synchronization failure
simultaneously
 Multicore OS
Considerations
 The design challenge for a
many-core multicore system is
to efficiently harness the hardware parallelism within
multicore processing power each core processor, known as
and intelligently manage the instruction level parallelism

substantial on-chip resources

efficiently potential for multiprogramming
and multithreaded execution
 Potential for parallelism exists within each processor
at three levels:
potential for a single application
to execute in concurrent
processes or threads across
multiple cores
 Grand Central Dispatch
 Developer must decide what pieces can or
should be executed simultaneously or in parallel
Grand Central Dispatch (GCD)

• implemented in Mac Os X 10.6

• helps a developer once something has been identified that
can be split off into a separate task
• thread pool mechanism
• allows anonymous functions as a way of specifying tasks
Virtual Machine Approach
 Allows one or more cores to be dedicated to a
particular process and then leave the processor
alone to devote its efforts to that process
 Multicore OS could then act as a hypervisor that
makes a high-level decision to allocate cores to
applications but does little in the way of resource
allocation beyond that
 Service processes
System support Applications
processes
Service control
SVChost.exe Environment
manager
Task manager subsystems
Lsass Winmgmt.exe Windows
Winlogon Spooler Explorer POSIX
User
Session Services.exe application
manager Win32
Subsytem DLLs

Ntdll.dll
System
threads User mode

Kernel mode
System service dispatcher
(Kernel-mode callable interfaces)
Win32 USER,
I/O manager GDI

manager (registry)
Security reference
File system cache

Local procedure
Object manager

Virtual memory
Power manager

Configuration
Processes and
Plug and play
manager

monitor

threads

call
Device
and file Graphics
system drivers
drivers
Kernel
Hardware abstraction layer (HAL)

Lsass = local security authentication server Colored area indicates Executive

POSIX = portable operating system interface
GDI = graphics device interface
DLL = dynamic link libraries

Figure 2.14 Windows Architecture

 Kernel-Mode Components
of Windows
 Executive
 contains the core OS services

 Kernel
 controls execution of the processors

 Hardware Abstraction Layer (HAL)

 maps between generic hardware commands and responses and those
unique to a specific platform

 Device Drivers
 dynamic libraries that extend the functionality of the Executive

 Windowing and Graphics System

 implements the GUI functions
 User-Mode Processes
 Four basic types are supported by Windows:
Special System • user-mode services needed to manage the system
Processes
• the printer spooler, event logger, and user-mode components that
Service Processes cooperate with device drivers, and various network services

Environment • provide different OS personalities (environments)

Subsystems
• executables (EXEs) and DLLs that provide the functionality users
User Applications run to make use of the system
 Client/Server Model
 Windows OS services,  Advantages:
environmental subsystems,
and applications are all  it simplifies the Executive
structured using the  it improves reliability
client/server model
 it provides a uniform
 Common in distributed means for applications to
systems, but can be used communicate with
internal to a single system services via RPCs
without restricting
 Processes communicate flexibility
via RPC  it provides a suitable base
for distributed computing
 Threads and SMP
 Two important characteristics of Windows are its support for
threads and for symmetric multiprocessing (SMP)
 OS routines can run on any available processor, and different routines can
execute simultaneously on different processors

 Windows supports the use of multiple threads of execution within a single

process. Multiple threads within the same process may execute on different
processors simultaneously

 server processes may use multiple threads to process requests from more
than one client simultaneously

 Windows provides mechanisms for sharing data and resources between

processes and flexible interprocess communication capabilities
Windows Objects
 Windows draws heavily on the concepts of object-
oriented design
 Key object-oriented concepts used by Windows
are:
Object
Encapsulation class and Inheritance Polymorphism
instance
Asynchronous Procedure Call Used to break into the execution of a specified thread and to
cause a procedure to be called in a specified processor mode.

Deferred Procedure Call Used to postpone interrupt processing to avoid delaying

hardware interrupts. Also used to implement timers and inter-
processor communication

Interrupt Used to connect an interrupt source to an interrupt service

routine by means of an entry in an Interrupt Dispatch Table
(IDT). Each processor has an IDT that is used to dispatch
interrupts that occur on that processor.

Process Represents the virtual address space and control information

necessary for the execution of a set of thread objects. A process
contains a pointer to an address map, a list of ready threads
containing thread objects, a list of threads belonging to the
process, the total accumulated time for all threads executing
within the process, and a base priority.

Thread Represents thread objects, including scheduling priority and

quantum, and which processors the thread may run on.

Profile Used to measure the distribution of run time within a block of

code. Both user and system code can be profiled.

Table 2.5 Windows Kernel Control Objects

 Traditional UNIX Systems
 Were developed at Bell Labs and became operational on a PDP-7 in 1970

 Incorporated many ideas from Multics

 PDP-11was a milestone because it first showed that UNIX would be an OS for all
computers

 Next milestone was rewriting UNIX in the programming language C

 demonstrated the advantages of using a high-level language for system code

 Was described in a technical journal for the first time in 1974

 First widely available version outside Bell Labs was Version 6 in 1976

 Version 7, released in 1978 is the ancestor of most modern UNIX systems

 Most important of the non-AT&T systems was UNIX BSD (Berkeley Software
Distribution)
 UNIX Commands
and Libraries
System Call
Interface

Kernel

Hardware

User-written
Applications

Figure 2.15 General UNIX Architecture

 User Programs

Trap
Libraries
User Level
Kernel Level
System Call Interface

Inter-process
communication
File Subsystem
Process
Control Scheduler
Subsystem
Memory
Buffer Cache
management

character block
Device Drivers

Hardware Control
Kernel Level
Hardware Level
Hardware

Figure 2.16 Traditional UNIX Kernel

 coff
a.out elf

exec
switch
NFS
file mappings
FFS
virtual
device memory vnode/vfs
mappings framework interface
s5fs

anonymous
RFS
mappings

Common
Facilities

disk driver time-sharing

block processes
device scheduler
switch framework

tape driver system

processes
STREAMS

network tty
driver driver

Figure 2.17 Modern UNIX Kernel [VAHA96]

 System V Release 4
(SVR4)
 Developed jointly by AT&T and Sun Microsystems

 Combines features from SVR3, 4.3BSD, Microsoft Xenix System V, and

SunOS

 New features in the release include:

 real-time processing support
 process scheduling classes
 dynamically allocated data structures
 virtual memory management
 virtual file system
 preemptive kernel
 BSD
 Berkeley Software Distribution

 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 to be released by Berkeley

 major upgrade to 4.3BSD
 includes
 a new virtual memory system
 changes in the kernel structure
 several other feature enhancements

 FreeBSD
 one of the most widely used and best documented versions
 popular for Internet-based servers and firewalls
 used in a number of embedded systems
 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 student of computer science, wrote the initial

version

 Linux was first posted on the Internet in 1991

 Today it is a full-featured UNIX system that runs on several platforms

 Is free and the source code is available

 Key to success has been the availability of free software packages

 Highly modular and easily configured

 Modular
Monolithic Kernel
Loadable Modules
 Includes virtually all of the OS  Relatively independent blocks
functionality in one large block
of code that runs as a single  A module is an object file whose
process with a single address code can be linked to and unlinked
space from the kernel at runtime
 All the functional components  A module is executed in kernel
of the kernel have access to all mode on behalf of the current
of its internal data structures process
and routines
 Have two important
 Linux is structured as a characteristics:
collection of modules
 dynamic linking
 stackable modules
 module module
*next *next
*name *name
size size
usecount usecount
flags flags
nysms nysms
ndeps ndeps VFAT
FAT
*syms *syms
*deps *deps
*refs *refs
kernel_symbol symbol_table
value value
*name *name
value value
*name *name

value value
*name *name

Figure 2.18 Example List of Linux Kernel Modules

 user level
processes

signals system calls

processes
& scheduler
file network
systems protocols
virtual

kernel
memory
char device block device network de-
drivers drivers vice drivers

traps & physical

interrupts
faults memory

hardware
system network inter-
CPU terminal disk
memory face controller

Figure 2.19 Linux Kernel Components

 Linux Signals

SIGHUP Terminal hangup SIGCONT Continue

SIGQUIT Keyboard quit SIGTSTP Keyboard stop
SIGTRAP Trace trap SIGTTOU Terminal write
SIGBUS Bus error SIGXCPU CPU limit exceeded
SIGKILL Kill signal SIGVTALRM Virtual alarm clock
SIGSEGV Segmentation violation SIGWINCH Window size unchanged
SIGPIPT Broken pipe SIGPWR Power failure
SIGTERM Termination SIGRTMIN First real-time signal
SIGCHLD Child status unchanged SIGRTMAX Last real-time signal

Table 2.6 Some Linux Signals

 Filesystem related
close Close a file descriptor.
link Make a new name for a file.
open Open and possibly create a file or device.
read Read from file descriptor.
write Write to file descriptor
Process related
execve Execute program.
exit Terminate the calling process.
getpid Get process identification.
setuid Set user identity of the current process.
ptrace Provides a means by which a parent process my observe and control
the execution of another process, and examine and change its core
image and registers.
Scheduling related
sched_getparam Sets the scheduling parameters associated with the scheduling policy
for the process identified by pid.
sched_get_priority_max Returns the maximum priority value that can be used with the
scheduling algorithm identified by policy.
sched_setscheduler Sets both the scheduling policy (e.g., FIFO) and the associated
parameters for the process pid.
sched_rr_get_interval Writes into the timespec structure pointed to by the parameter tp the
round robin time quantum for the process pid.
sched_yield A process can relinquish the processor voluntarily without blocking
via this system call. The process will then be moved to the end of the
queue for its static priority and a new process gets to run.

Table 2.7 Some Linux System Calls (page 1 of 2)

 Interprocess Communication (IPC) related
msgrcv A message buffer structure is allocated to receive a
message. The system call then reads a message from the
message queue specified by msqid into the newly created
message buffer.
semctl Performs the control operation specified by cmd on the
semaphore set semid.
semop Performs operations on selected members of the semaphore
set semid.
shmat Attaches the shared memory segment identified by shmid
to the data segment of the calling process.
shmctl Allows the user to receive information on a shared
memory segment, set the owner, group, and permissions of
a shared memory segment, or destroy a segment.
Socket (networking) related
bind Assigns the local IP address and port for a socket.
Returns 0 for success and –1 for error.
connect Establishes a connection between the given socket and
the remote socket associated with sockaddr.
gethostname Returns local host name.
send Send the bytes contained in buffer pointed to by *msg
over the given socket.
setsockopt Sets the options on a socket
Miscellaneous
fsync Copies all in-core parts of a file to disk, and waits
until the device reports that all parts are on stable
storage.
time Returns the time in seconds since January 1, 1970.
vhangup Simulates a hangup on the current terminal. This call
arranges for other users to have a "clean" tty at login
time.

Table 2.7 Some Linux System Calls (page 2 of 2)

 Android Operating
System
 A Linux-based system originally  Most recent version is Android
designed for touchscreen mobile 4.3 (Jelly Bean)
devices such as smartphones and
tablet computers  The Open Handset Alliance
(OHA) was responsible for the
 The most popular mobile OS Android OS releases as an open
platform
 Development was done by
Android Inc., which was bought  The open-source nature of
by Google in 2005 Android has been the key to its
success
 1st commercial version (Android
1.0) was released in 2008
 Application Framework
 Provides high-level building blocks accessible through standardized API’s
that programmers use to create new apps
 architecture is designed to simplify the reuse of components

 Key components:

Activity Window Package Telephony

Manager Manager Manager Manager
Java abstraction of
Manages lifecycle of
the underlying
applications
Surface Manager
Allows interaction
Installs and removes
with phone, SMS,
applications
and MMS services
Responsible for Allows applications
starting, stopping, to declare their client
and resuming the area and use features
various applications like the status bar
 Application Framework
(cont.)

 Key components: (cont.)

 Content Providers
 these functions encapsulate application data that need to be shared between
applications such as contacts
 Resource Manager
 manages application resources, such as localized strings and bitmaps
 View System
 provides the user interface (UI) primitives as well as UI Events
 Location Manager
 allows developers to tap into location-based services, whether by GPS, cell
tower IDs, or local Wi-Fi databases
 Notification Manager
 manages events, such as arriving messages and appointments
 XMPP
 provides standardized messaging functions between applications
 System Libraries
 Collection of useful system functions written in C or C++ and used by various
components of the Android system

 Called from the application framework and applications through a Java interface

 Exposed to developers through the Android application framework

 Some of the key system libraries include:

 Surface Manager
 OpenGL
 Media Framework
 SQL Database
 Browser Engine
 Bionic LibC
  Every Android application runs in its
own process with its own instance of
the Dalvik virtual machine (DVM)

 DVM executes files in the Dalvik

Android Executable (.dex) format

Component includes a set of core

Runtime 
libraries that provides most of the
functionality available in the core
libraries of the Java programming
language

 To execute an operation the DVM

calls on the corresponding C/C++
library using the Java Native
Interface (JNI)
Activities
 An activity is a single visual user interface component, including things such
as menu selections, icons, and checkboxes

 Every screen in an application is an extension of the Activity class

 Use Views to form graphical user interfaces that display information and
respond to user actions
Power Management
Alarms Wakelocks
 Implemented in the Linux kernel  Prevents an Android system from
and is visible to the app developer entering into sleep mode
through the AlarmManager in the
RunTime core libraries  These locks are requested through
the API whenever an application
 Is implemented in the kernel so requires one of the managed
that an alarm can trigger even if peripherals to remain powered on
the system is in sleep mode
 this allows the system to go
 An application can hold one of
into sleep mode, saving the following wakelocks:
power, even though there is  Full_Wake_Lock
a process that requires a  Partial_Wake_Lock
wake up
 Screen_Dim_Wake_Lock
 Screen_Bright_Wake_Lock
 Summary
 OS design considerations for
 Operating system objectives and multiprocessor and multicore
functions  Microsoft Windows overview
 User/computer interface
 Traditional Unix systems
 Resource manager
 History/description
 Evolution of operating systems  Modern Unix systems
 Serial processing  System V Release 4 (SVR4)
 Simple/multiprogrammed/time-  BSD
sharing batch systems  Solaris 10
 Major achievements  Linux
 Developments leading to modern  History
operating systems  Modular structure
 Fault tolerance  Kernel components
 Fundamental concepts  Android
 Faults  Software/system architecture
 OS mechanisms  Activities
 Power management