It 480:informationtechnology Essentials: Vineetha Jain Dept. of Cse Ase, Bangalore
It 480:informationtechnology Essentials: Vineetha Jain Dept. of Cse Ase, Bangalore
Essentials
Vineetha Jain
Dept. of CSE
ASE, Bangalore
Lecture 05&06&07
Operating System
ASE, Bangalore2
Jan 28, 2010 Vineetha Jain
Introduction
Operating System is an interface between computer
and user
Its program manages computer hardware.
Its an environment helps to execute programs
It acts as a government.
ASE, Bangalore3
Jan 28, 2010 Vineetha Jain
Introduction
Memory management
Process management
Device management
File management
ASE, Bangalore4
Jan 28, 2010 Vineetha Jain
Views
It has system view
ASE, Bangalore5
Jan 28, 2010 Vineetha Jain
Address
Logical address:Address generated by CPU
ASE, Bangalore6
Jan 28, 2010 Vineetha Jain
Memory allocation Techniques
Single Contiguous Memory allocation:
ASE, Bangalore8
Jan 28, 2010 Vineetha Jain
Variable partition allocation:
Allocate exact amount required for each job
Supports multiprogramming
Prevents internal fragmentation
But still cause external fragmentation
Hole: Leave the job and empty the space
Merge the hole is known as Coalescene
ASE, Bangalore9
Jan 28, 2010 Vineetha Jain
Relocatable Partition memory allocation:
Reloacte the currently executing program
Merging the holes
Compaction:get a large block of free memory
Supports multiprogramming
Prevents internal and external fragmentation
ASE, Bangalore10
Jan 28, 2010 Vineetha Jain
Simple paged allocation:
Overcome external fragmentation
Address space
Logical address space
Physical address space
Divide job address space in to pages
Main memory address space in to frames or
blocks.
Mapping
ASE, Bangalore11
Jan 28, 2010 Vineetha Jain
Simple paged allocation
Page table and address translation
Internal fragmentation due to simple page
allocation.
Supports multiprogramming
Jobs need not occupy contiguous allocation
Prevents external fragmentation
ASE, Bangalore12
Jan 28, 2010 Vineetha Jain
Demand paging
Pages are loaded based on demand
Based on the requirement
Works based on virtual memory concept
Jobs need not occupy contiguous memory
location
Supports multiprogramming
Prevents external fragmentation
Status field: whether is in memory or secondary.
Modified: modification done or not
ASE, Bangalore13
Jan 28, 2010 Vineetha Jain
Demand paging
Demand paging leads to page fault.
Page fault: try access the page which is not there
in main memory.
Swapping
Page Replacement algorithm
FIFO
LRU
MFU
LFU
NRU
ASE, Bangalore14
Jan 28, 2010 Vineetha Jain
Segmentation
Divide jobs address space in to segments
Size of segments can vary.
Segment table and translation.
Does not support virtual memory concept.
Supports multiprogramming
Jobs need not occupy contiguous memory
location.
Prevents internal fragmentation
ASE, Bangalore15
Jan 28, 2010 Vineetha Jain
Process management
Program
Process
Structure of process
Process consists of 3 regions
Stack region :It is a data structure, where data
removed in the reverse order.
Code region: It has program code
Data region :holds the global variables
ASE, Bangalore16
Jan 28, 2010 Vineetha Jain
Multiple process
Independent process:
Cooperating process
ASE, Bangalore17
Jan 28, 2010 Vineetha Jain
Process State
New state:
Ready:
Running:
Waiting:
Terminated
ASE, Bangalore18
Jan 28, 2010 Vineetha Jain
Process state diagram
Terminate
New
READY RUNNING
WAITING
ASE, Bangalore19
Jan 30 2010 Vineetha Jain
Inter process communication
Shared memory
Message passing
ASE, Bangalore20
Jan 30, 2010 Vineetha Jain
Multiprogramming :Uniprocessor executes
more than one program
ASE, Bangalore21
Jan 28, 2010 Vineetha Jain
Threads
Single threads
Multithreads
Thread structure
example
ASE, Bangalore22
Jan 28, 2010 Vineetha Jain
Process scheduling
CPU Utilization
Throughput
Turnaround time
Waiting time
Response Time
ASE, Bangalore23
Jan 21, 2010 Vineetha Jain
Types of scheduling
Preemptive
Nonpreemtive
ASE, Bangalore24
Jan 21, 2010 Vineetha Jain
Scheduling algorithms
FCFS
SJF
Preemptive
Non-preemptive
Priority
Round Robin(RR)
Examples
ASE, Bangalore25
Jan 21, 2010 Vineetha Jain
File management
Storage unit
File system:information management and part of OS.
MS DOS file system:
Tree structure
Path
Hard disk in MS DOS
Hard disk structure
Data access –File allocation table gives the
information about where the file is allocated in the
disk
ASE, Bangalore26
Jan 21, 2010 Vineetha Jain
File management
Volume :Storage size
Hard disk can have volumes
MS DOS Booting
Bootstrap loader :Program
ASE, Bangalore27
Jan 21, 2010 Vineetha Jain
File system mangement
UNIX file system
UNIX OS hard disk can be divided in to
multiple file systems.
Unix allocates disk space in terms of blocks
File organization
Directory Entry Table
Inode block
Data Block
Data access
ASE, Bangalore28
Jan 21, 2010 Vineetha Jain
File permissions
Owner ,Group ,Others
Read( R)
Write(W)
Execute(X)
ASE, Bangalore29
Jan 21, 2010 Vineetha Jain
NTFS
New technology file system
Windows NT
Features: Reliability,performance,security and
optimal disk space utilization.
Security and access control:
Size of the files/no.of files
Recovery/Reliabilty:
Long file names
Limitations:file encryption is not built, formatting
floppy disk
ASE, Bangalore30
Jan 21, 2010 Vineetha Jain
Device management
I/O devices
I/O channel or I/O bus
Interrupts
Interrupt handling
Software interrupts
Hardware interrupts
ASE, Bangalore31
Jan 21, 2010 Vineetha Jain
DMA
Direct Memory Access
DMA controller
ASE, Bangalore32
Jan 21, 2010 Vineetha Jain
Structure of I/O System
Device allocation
ASE, Bangalore33
Jan 21, 2010 Vineetha Jain
Summary
Introduction to OS
Memory management
Process management
Process states
Process scheduling algorithms
Storage management
Device management
DMA
ASE, Bangalore34
Jan 21, 2010 Vineetha Jain
Reference:
Operating System concepts
Galvin and Silber Schatz(6th edition)
ASE, Bangalore35
Jan 30, 2010 Vineetha Jain
Thank U
ASE, Bangalore36
Jan 30, 2010 Vineetha Jain