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

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

Thread

Thread What is Thread? A thread is a flow of execution through the process code, with its own program counter that keeps track of which instruction to execute next, system registers which hold its current working variables, and a stack which contains the execution history. A thread shares with its peer threads few information like code segment, data segment and open files. When one thread alters a code segment memory item, all other threads see that. A thread is also called a  lightweight process . Threads provide a way to improve application performance through parallelism. Threads represent a software approach to improving performance of operating system by reducing the overhead thread is equivalent to a classical process. Each thread belongs to exactly one process and no thread can exist outside a process. Each thread represents a separate flow of control. Threads have been successfully used in implementing network servers and web server. They also provide a suitable foundation ...
Post a Comment
Read more

Distributed system

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

Multitasking System

  Multitasking system ·           Technically , multitasking is same as multi programming ·           In a multitasking operating system, s single user can execute multiple programs at the same time ·           We can also say, multitasking is the system capability to work on more than one job or process at the same time. ·           It means that whenever a job needs to perform I/O operation, the cpu can be used for execting some other job                                                        diagram of multi tasking     ·           There are two type of multitasking : 1.       ...
Post a Comment
Read more

Multi Programming Operating System

  Multi programming  system ·           Multi programming operating system allows multiple users to execute multiple programs using a single CPU concurrently i.e. at the same time. ·           In multiprogramming several process are kept in the main memory and CPU execute all these processes concurrently. It means, the CPU immediately switches from one process to next that are ready to get executed ·           In such an operating system when one process start process start performing the instructions from several programs at the same time. ·           Rather, it means that there are number program available to CPU and that portion of one is executed, then segment of another and so on                                 ...
Post a Comment
Read more