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

Shortest Job First Scheduling (SJF)

  Shortest Job First Scheduling (SJF) ·          SJF ia also known as shortest-job-next(SJN) algorithm and is faster than FCFS. ·          In SJF, the process with the least estimated execution time is selected from the ready queue for   execution. ·          For this, SJF algorithm associates with each process, the length of its next CPU burst. When the CPU is available, it is assigned to the process that has the smallest next CPU burst. ·          If tow processes have the same length of next CPU burst ,FCFS scheduling algorithm is used to break the tie. ·          SJF algorithm can be preemptive or non-preemptive.     Non-preeptive SJF ·          In non-preemptive SJF, scheduling, CPU is always assigned to the ...
Post a Comment
Read more

Monolithic Architecture

  Monolithic Architecture Monolith means composed all in one piece. The  Monolithic  application describes a single-tiered  software  application in which different components combined into a single program from a single platform. Components can be: Authorization — responsible for authorizing a user Presentation — responsible for handling HTTP requests and responding with either HTML or JSON/XML (for web services APIs). Business logic — the application’s business logic. Database layer — data access objects responsible for accessing the database. Application integration — integration with other services (e.g. via messaging or REST API). Or integration with any other Data sources. Notification module — responsible for sending email notifications whenever needed. Example for Monolithic Approach Consider an example of Ecommerce application, that authorizes customer, takes an order, check products inventory, authorize payment and ships ordered products. This applicat...
Post a Comment
Read more

Micro kernel architecture

  Micro kernel  architecture What is Kernel? A kernel is an important part of an OS that manages system resources. It also acts as a bridge between the software and hardware of the computer. It is one of the first program which is loaded on start-up after the bootloader. The Kernel is also responsible for offering secure access to the machine's hardware for various programs. It also decides when and how long a certain application uses specific hardware. What is Microkernel? Microkernel  is a software or code which contains the required minimum amount of functions, data, and features to implement an operating system. It provides a minimal number of mechanisms, which is good enough to run the most basic functions of an operating system. It allows other parts of the operating system to be implemented as it does not impose a lot of policies. Microkernels and their user environments are usually implemented in the C++ or C programming languages with a little bit of assembly. Ho...
Post a Comment
Read more