Explain about time sharing systems, Operating System

Assignment Help:

Q. Explain about Time Sharing Systems?

Time Sharing Systems

  • Multi-programmed batched systems provide an environment where various system resources (for illustration CPU, memory, peripheral devices) are utilized effectively.
  • Time sharing or multitasking is a logical extension of multiprogramming. Multiple jobsare executed by CPU switching between them however the switches takes place so frequently that users may interact with every program while it is running.
  • An interactive or hands-on computer system provides on-line communication between user and system. The user gives instructions to operating system or to a program directly and receives an immediate response. Typically a keyboard is used to provide input and a display screen (like a cathode-ray tube (CRT) or monitor) is used to provide output.
  • If users are to be able to access both code and data conveniently, an on-line file system should be available. A file is a collection of related information defined by its creator. Batch systems are applicable for executing large jobs which need little interaction.
  • Time-sharing systems were created to provide interactive use of a computer system at a reasonable cost. A time-shared operating system employs CPU scheduling and multiprogramming to provide every user with a small part of a time-shared computer. Every user has at least one separate program in memory. A program which is loaded into memory and is executing is usually referred to as a process. When a process executes it characteristically executes for only a short time before it either completes or needs to perform I/O. I/O can be interactive; which is, output is to a display for user and input is from a user keyboard. Because interactive I/O typically runs at people speeds, it can take a long time to complete.
  • A time-shared operating system enables many users to share the computer simultaneously. Because every command or action in a time-shared system tends to be short, only a little CPU time is required for each user. As the system switches rapidly from one user to next, every user is given the impression that she has her own computer while actually one computer is being shared among many users.
  • Time-sharing operating systems are even more complicated than are multi-programmed operating systems. As in multiprogramming various jobs should be kept simultaneously in memory that requires some form of memory management and protection.

Related Discussions:- Explain about time sharing systems

Calculate the maximum file size , A UNIX file system has 1-KB blocks and 4-...

A UNIX file system has 1-KB blocks and 4-byte disk addresses. What is the maximum file size if i-nodes contains 10 direct entries, and one single, double, and triple indirect entry

How can the deadlock be prevented-safe state, How can the deadlock be preve...

How can the deadlock be prevented-Safe State Safe state : A state is safe if the system is able to allocate resources to each process in some order and still avoid deadlock.

Explain lru approximation page replacement in detail, LRU approximation pag...

LRU approximation page replacement In this we utilize the reference bit associated with the page entry to choose a page to be removed. The various algorithms used for the imp

Batch system, what is a batch system give me answer in simple words so that...

what is a batch system give me answer in simple words so that i can understand

Multiprogramming., In a multiprogramming and time sharing environment sever...

In a multiprogramming and time sharing environment several users share the system simultaneously .what are two such problems?

Race condition, list the prevention of mechanism for race condition with op...

list the prevention of mechanism for race condition with operating system

What inference does recovery in distributed systems, Q. Consider a distrib...

Q. Consider a distributed system with two sites A and B. Consider whether site A can distinguish among the following: a. B goes down. b. The link between A and B goes down.

Enforce memory protection at compile time?, Why is it not possible to enfor...

Why is it not possible to enforce memory protection at compile time?   Every process should be protected against unwanted interference by other process, whether intentional or

Deadlock, Suppose we have 3 processes running at the same time as shown in ...

Suppose we have 3 processes running at the same time as shown in the following table. Each resource only has one instance. Show a possible scenario of resource allocation that r

Write a short note about schedulers, Write a short note about schedulers. ...

Write a short note about schedulers. Processes migrate between the various scheduling queues throughout its life time. The operating system should select for scheduling purpose

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd