Unit 1
Unit 1
Unit 1
Operating System
Unit – 1
Introduction of
Operating System
Functions
• By process management OS
manages many kinds of
activities:
1. Process • All process from start to
Management shut down i.e. open, save,
copy, install, print.
• Creation and deletion of
user and system processes.
• By security management
OS manages many tasks
such as:-
4. Security • Alert messages
Management • Virus protection
• Dialogue boxes
• Firewall
• Passwords
• To manage Resources, OS
perform many tasks such as:
5.Resource • Install drivers required for
input and output, memory,
Management power.
• Coordination among
peripherals.
Views of OS
OS as a User/Computer OS as a Resource
Interface manager
Programmer
Application
Programs
Utilities Operating-
System
Designer
Operating-System
Computer Hardware
Unit- 1 Introduction (Prof. Aanchal Phutela) 20
Different views of OS
First Generation
Second Generation
Third Generation
Fourth Generation
Unit- 1 Introduction (Prof. Aanchal Phutela) 28
History of OS (First generation)
▪ First generation (1945-1955)
• Vacuum tubes and plug-boards are used in these systems.
Vacuum tubes
Plug board
Mechanical
Components are
replaced by Electronic
Components (Vacuum
Tubes)
Vacuum Tubes
Problem
Programmers 1401
bringreads
cards batch
to 1401
Operator
of jobscarries
onto tape
7094
inputdoes
Operator
tapecomputing
to 7094 1401
carries output prints
tape output
to 1401
• Technology : Transistors
• Operating system : Present
• Language : Assembly and High level
language
Batch system
• To reduce the time new methodology is
adopted know as batch system.
• To execute the program two computers
were used IBM 1401 for reading cards,
copying tapes, and printing output, and
IBM 7094 for real computing (numerical
calculation).
Third Generation(1965-80)
44
Job 3
Job 2
Multiprogramming
Memory
partitions Job 1 • Partition the memory into several pieces
with different job in each partition.
Operating • While one job was waiting for I/O to
system complete, another job could use CPU.
• whenever running job finished, the OS
load new job from the disk into the
empty partition of memory. This is know
as SPOOLING (Simultaneous
Peripheral Operation On Line).
Fourth Generation(1980-90)
• Technology : LSI
• Operating systems : Present
• Language : High level language
48
Fourth generation:
Third generation:
• 1980 – present
• 1965 – 1980 • Large scale integration,
• Integrated circuits,
Second generation: Personal computers
Multiprogramming
• 1955 – 1965
• Transistors, Batch
Firstgeneration:systems
• 1945 – 1955
• Vacuum tubes, Plug
boards
Multi-programming OS
Multi-Tasking OS
Types
Multi-processing OS
Distributed OS
Real Time OS
Multiprocessing Multitasking
Multiprogramming
Communication
Network
Feature Description
Kernel 7 8
Sys call
Dispatch
handler
space
▪ Step-4 Then comes the actual call to the library procedure. This
instruction is the normal procedure call instruction.
System Call
• pid = fork()
• pid = waitpid(pid, &statloc, options)
• s = execve(name, argv, environp)
• exit(status)
s = close(fd)
• Close an open file.
s = stat(name, &buf)
• Get a file’s status information such as type of file, size,
time of last modification and other information.
• Name is the file name
• Pointer to structure where this needs to be put.
s = mkdir(name, mode)
s = rmdir(name)
s = unlink(name)
s = chmod(name, mode)
seconds = time(&seconds)
c
Unit- 1 Introduction (Prof. Aanchal Phutela) 80
Layered Structure
A layered system consists of a series of layers, each of which depends
only on the correct operation of the layer immediately beneath it.
The lowest layer represents the hardware interface, and the highest
layer the application interface.
All the layers can be defined separately and interact with each other as
required. Also, it is easier to create, maintain and update the system if it
is done in the form of layers.
Change in one layer specification does not affect the rest of the layers.
A key problem in a layered system is deciding on the ordering of the
layers. (This is critical because of the requirement that each layer can
ultimately only use services provided by layers below it - so the ordering
cannot have anycycles.)
In a strictly-layered structure, efficiency can also become a problem
because when a higher-level layer requires a lower-level operation the
request must work its way down layer by layer.
Examples OS/2, window NT