PDF Document
PDF Document
5. Resource Allocation: The Operating System ensures the proper use of all
the resources available by deciding which resource to be used by whom for
how much time. All the decisions are taken by the Operating System.
6. Accounting: The Operating System tracks an account of all the
functionalities taking place in the computer system at a time. All the details
such as the types of errors that occurred are recorded by the Operating
System.
9. User interface. Almost all operating systems have a user interface (UI). This
interface can take several forms. Most commonly, a graphical user interface
(GUI) is used. Here, the interface is a window system with a mouse that
serves as a pointing device to direct I/O, choose from menus, and make
selections and a keyboard to enter text. Mobile systems such as phones and
tablets provide a touch-screen interface, enabling users to slide their fingers
across the screen or press buttons on the screen to select choices. Another
option is a command-line interface (CLI), which uses text commands and a
method for entering them (say, a keyboard for typing in commands in a
specific format with specific options). Some systems provide two or all three
of these variations.
There are several ways for users to interface with the operating system.
Here, we discuss three fundamental approaches. One provides a command-
line interface, or command interpreter, that allows users to directly enter
commands to be performed by the operating system. The other two allow
users to interface with the operating system via a graphical user interface, or
GUI.
a. Command Interpreters: Most operating systems, including Linux,
UNIX, and Windows, treat the command interpreter as a special program
that is running when a process is initiated or when a user first logs on (on
interactive systems). On systems with multiple command interpreters to
choose from, the interpreters are known as shells.
History of Operating system: The operating system has been evolving through
the years. The following table shows the history of OS.
Generation Year Electronic device used Types of OS Devices
First 1945-55 Vacuum Tubes Plug Boards
Second 1955-65 Transistors Batch Systems
Third 1965-80 Integrated Circuits(IC) Multiprogramming
Fourth Since 1980 Large Scale Integration PC
Types of Operating Systems
Examples of Time-Sharing OS
These systems run on a server and provide the capability to manage data,
users, groups, security, applications, and other networking functions. These
types of operating systems allow shared access of files, printers, security,
applications, and other networking functions over a small private network.
One more important aspect of Network Operating Systems is that all the
users are well aware of the underlying configuration, of all other users
within the network, their individual connections, etc. and that’s why these
computers are popularly known as tightly coupled systems.
Real-time systems are used when there are time requirements that are very
strict like missile systems, air traffic control systems, robots, etc.
Disadvantages of RTOS:
• Limited Tasks: Very few tasks run at the same time and their
concentration is very less on few applications to avoid errors.
• Use heavy system resources: Sometimes the system resources are not so
good and they are expensive as well.
• Complex Algorithms: The algorithms are very complex and difficult for
the designer to write on.
• Device driver and interrupt signals: It needs specific device drivers and
interrupts signals to respond earliest to interrupts.
• Thread Priority: It is not good to set thread priority as these systems are
very less prone to switching tasks.
Examples of Real-Time Operating Systems are: Scientific experiments,
medical imaging systems, industrial control systems, weapon systems, robots,
air traffic control systems, etc.
Where,
• Φ – is the phase of the task. Phase is the release time of the first
i
job in the task. If the phase is not mentioned then the release time
of the first job is assumed to be zero.
• P – is the period of the task i.e. the time interval between the
i
For example: Consider the task T with period = 5 and execution time = 3
i
Phase is not given so, assume the release time of the first job as zero. So the
job of this task is first released at t = 0 then it executes for 3s and then the next
job is released at t = 5 which executes for 3s and then the next job is released
at t = 10. So, jobs are released at t = 5k where k = 0, 1, . . ., n
• Dynamic Tasks: It is a sequential program that is invoked by the
occurrence of an event. An event may be generated by the processes
external to the system or by processes internal to the system. Dynamically
arriving tasks can be categorized on their criticality and knowledge about
their occurrence times.
1. Aperiodic Tasks: In this type of task, jobs are released at arbitrary time
intervals i.e. randomly. Aperiodic tasks have soft deadlines or no
deadlines.
2. Sporadic Tasks: They are similar to aperiodic tasks i.e. they repeat at
random instances. The only difference is that sporadic tasks have hard
deadlines. A sporadic task is denoted by three tuples: T =(e , g , D )
i i i i
Where
e – the execution time of the task.
i