Skip to main content

Functions of Operating System

 

Functions of operating system

 

5.                   protection and security :

·                     another important functions of an operating system is to protect itself from the user process and to protect different users processes from one another in a syatem.

·                     In a multi programming environment, where several users process reside in main memory at the same time, the may interface with OS or with each other.

·                     Thus, protection mechanism controls the access of users, programs and processes used by various applications.

·                     A total approach to computer security involves both external and internal security.

 

6.                   Networking:

·         Networking is used for exchanging  information among different computer that are distributed across various location.

·         Distributed system consist of multiple processors and each processor has its own memory and clock

·         This results in computer speedup, increased functionality, increased data availability and better reliability.

·         Thus, a distributed system enables us to share the various resources of the network.

 

7.                   Command interpretation:

·         The command interpreter is the basic interface between the computer and the user.

·         There are to different user interface supported by operating system:

1.       Command line interface

2.       Graphical user interface

·                     Command line interface . it is the textual user interface on which user gives instruction to computer by typing the command.

·                     Graphical user interface . GUI provide the user a screen full of graphical icons or menus and allows the user to make a rapid selection from the displayed icons or menus to give instruction to computer.

·                     The various command supported by command interpretations module are known as system calls.

Comments

Post a Comment

Popular posts from this blog

Multilevel Feedback queue scheduling (MFQ)

  Multilevel Feedback queue scheduling (MFQ) ·          Multilevel feedback queue scheduling is an enhancement of multi-levelqueue scheduling. In this scheme, processes can move between the different queue ·          The various processes are separates in different queue on the basis of their CPU Burst Char characteristics ·          If a process consumes a lot of CPU time , it is placed into a lower priority queue. Thus I/O bound and interactive process are placed in the higher priority queue and CPU bound pricesses are in lower priority ·          If a processes waits too long in a lower priority queue it is moved higher priority queue. Such an aging prevents starvation. ·          The top priority queue is given smallest CPU time Quantum ·      ...

ENTERPROCESS COMMUNICATION AND SYNCHRONIZATION

      ENTERPROCESS COMMUNICATION AND SYNCHRONIZATION ·          In multi programming environment multiple process co-exit . a single   program may be broken into number of processes. ·          The process are classified into two categories : independent processes and cooperating processes. ·          An independent process is a standalone process that does not share any data with any other process. It cannot affect or be affected by the other processes executing   in the system. In other words, the modification made to an independent process does not affect the functioning of other process. ·          A cooperating processes is a process that shares data with other processes in a system it can affect or be affectedly the other processes executing in the system ·      ...

Round Robin

   Round Robin ·          Round robin Scheduling is similar to FCFS but preemption is addede to switch between processes. ·          In RR scheduling, processes are dispatched in FIFO but given a small amount of CPU time. This small amount of CPU time this small amount of time is known as time quantum or time slice. A time quantum is generally from 10 to 100 milliseconds ·          If a process does not complete before its time slice expires, the CPU is time slice and is given to the next waiting process in ready queue. ·          The preempted process in then places at the   tail of the ready queue. ·          If a process is completed before its time slice expires, the process itself release the CPU. The scheduler then proceeds to the next process in ready queue. ...

Multi Level Queue Scheduling (MLQ)

  Multi Level Queue Scheduling (MLQ) ·          Multilevel queue scheduling classifies the processes according to their types for example, a multilevel queue scheduling algorithm makes a common. ·          In this scheduling ready queue is divided into various queue that are called sub queues. A subqueue is a distinct operational queue ·          The process are permanently assigned to subqueues, generally based on some property of the process such as memory size,priority or process type ·          Each subqueue has its process sucheduling algorithm. For example interactive process at the foreground may use round robin scheduling while batch jobs at the background may use the FCFS method ·          For example, consider a system with four different queues 1.   ...

Direct Communicationand Indirect communication

  Direct Communication ·          Direct communication establishes a link between two processes. A communication link is a unidirectional path along which information flows. ·          two processes use single communication link to share information. ·          In this   metod, there cannot be more that one link between two processes                                                     direct communication ·          Send and receive function used in direct communication are given below : ·          Send(process name , message ,(receive(process name , message)             Send(A, message...