Skip to main content

Time Sharing System and its Requirements

 

Time sharing system

·         Time sharing refers to the allocation of computer resources in a time dependent fashion to several program simultaneously

·         A time sharing system has many user terminals that are connected to same computer simultaneously. Using these terminal, different users can work on a system at the same time

·         Thus, it uses multi programming with a special CPU scheduling among all the last one, and then again beginning from the first one

·         In time sharing system, the CPU time is divided among all the users on schedule basis.

·         It release the CPU under any of the following three conditions:

1.       When the allotted time slice expires.

2.       When the program needs to perform I/O operation.

3.       When the execution of the program is over during the time slice

·         Thus the time sharing, when the CPU is allocated to user program, the user uses the CPU for the period of time slot.

             single user operating system  

2.      Multi user operating system 

3.       Batch processing operating system

4.      Multi programming operating system 

5.     Multi tasking operating system 

6.       Multiprocessing operating system

7.       Time sharing operating system

8.     Real time system  

Time sharing system

 

·         In time sharing system the various program can be in one of the following three stses

1.       Running: the users program currently has control of the CPU, only one user will be active at a time.

2.       Ready : the user program is ready to execute but is waiting for its turn to get the CPU. More than one user can be in ready state at a time.

3.       Blocked : the user’s program is waiting for some I/O operation. More than one user can be wait state at a time.

 

·       Requirement of time sharing system

 

Time sharing system typically the following additional hardware and software features:

 

1.       A number of terminals simultaneously connected to the system, so that multiple users can simultaneously use the system in interactive mode.

 

2.       A relatively large memory to support multi programming.

 

3.       Memory protection mechanism to prevent mechanism to prevent one jobs complete status information when the CPU is taken away from it, and restoring this information back, before the CPU is given back to it again.

 

4.       An alarm clock mechanism to send an interrupt signal to the CPU after every time slice.3.

 

5.       A special CPU scheduling algorithm, which allocates the CPU for  a very short periods, to each user process in a circular fashain.

Advantage and Disadvantage of time sharing system

1.       Reduces CPU idle time . time sharing reduce idle time of CPU and increase the utilization of CPU by switching from one program to another in rapid succession.

2.       Provides advantages of quick response time. The special CPU scheduling algorithm used in time sharing system ensure quick response time to all users.


Distributed system

·         A distributed system is a collection of processor located in geographical dispersal physical location.

·         In this system, the workhold is distributed or divided between two or more computers that are linked together by communication network . that is the different processors communicate using communication links, such as telephone lines and buses3

·         The various processors do not share memory, clock ,or peripheral devices instead each processors has its local memory.

·         The purpose of distributed system is to provide an efficient and convenient environment for sharing of resources.

·         Some example of distributed operating system are amoeba, angle, chorus, much, alpha kernel.

·         The processors in a distributed system vary in size and function. They may include small microprocessors, workstations microcomputers, mainframe computers and large general purpose computers.

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 ·      ...
Post a Comment
Read more

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 ·      ...
Post a Comment
Read more

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. ...
Post a Comment
Read more

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.   ...
Post a Comment
Read more

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...
Post a Comment
Read more