Professional Documents
Culture Documents
OS
OS
1.FATHER OF OS ?
GARY KILDALL
2.TYPES OF OS?
Batch Operating System. ...
Time-Sharing Operating System. ...
Distributed Operating System. ...
Embedded Operating System. ...
Real-time Operating System.
Let's see how CPU scheduling and multiprogramming are used in Timesharing Operating
System.
*When the user performs more than one task, each process's CPU time is divided.
*There is a time quantum fixed for each process to execute at a time. This time
quantum is minimal and in 10-100 milliseconds. Time quantum is also known as time
slot or time slice.
*For example, if there are three processes, P1, P2, and P3, running on the system.
Suppose the time Quantum is fixed to 4 nanoseconds (ns). Let's see further how
these processes will be executed.
*Process P1 will execute first for 4ns and as soon as it gets over, process P2
starts executing for 4ns and when P2 is executed for 4ns then process P3 executes
for 4ns. This process continues till all the processes gets completed.
*In this way, if the process runs for only the fixed time quantum, the switching
between the process is very fast. So, the user thinks that all the processes are
running simultaneously. In this way response time of the CPU is minimized.
The above diagram shows the working of the time-sharing operating system.
The process 4 in the diagram is shown in active state. Process 5 is in ready state
while process 1,2,3 and 6 are in waiting state.
6.Let's understand what these active state, ready state, and waiting for state
mean.
1. Active state - The process currently using the CPU is said to be in an active
state. Only one process can be inactive state as the CPU can be assigned to only
one process at a time for processing. 2. Ready state - The process which is ready
for execution and is waiting for the CPU to get assigned to them is said to be in a
Ready state. More than one process can be in a Ready state at a time, but the CPU
is allocated to only one of them at a time for processing. 3. Waiting State - The
processes that are not ready for execution and are waiting for some input/output
process to be completed is said to be in waiting state. Once the input/output
process is completed, the process jumps to a Ready state and is ready for
execution.
As shown in the diagram above, the process can switch from one state to another.
Once the process executes its one-time quantum, it goes to the Ready state and is
ready for execution again. While if the process gets some input/output operation
while in the active state, it goes to the waiting state and waits there until the
input/output is completed and then goes to the ready state again as soon as the
input/output operation is completed.
UNIX
Multics
Linux
Windows 2000 server
Windows NT server
TOPS-10 (DEC)
TOPS-20 (DEC)
10.Conclusion
*In Time-Sharing Operating System, each process gets equal opportunity, i.e. equal
time quantum for execution.
*Time-Sharing Operating System requires high specification hardware and uses lots
of resources.
*CPU idle time is reduced in Time-sharing operating system.
Reliability, Data mixing, and communication are some problems faced in Time-sharing
operating systems.