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

What is logical address space and physical address space, What is logical a...

What is logical address space and physical address space? The set of all logical addresses formed by a program is known as a logical address space; the set of all physical addr

Financial objective of corporation, The primary financial objective of corp...

The primary financial objective of corporation is usually taken to be the maximization of shareholder wealth. Discuss:- i. Ways in which the shareholder of a company can encour

Why high level languages need compiler, Q. Why High level languages need Co...

Q. Why High level languages need Compiler? High level languages - illustrations are COBOL, FORTRAN, PL/I andALGOL - are processed by interpreters andcompilers. A compilers is a

Semaphore examples, Ok so i think i got this right by not 100% on this. wha...

Ok so i think i got this right by not 100% on this. what I want to figure out is if there are x visitors that can line up for a ride but only 1 passenger can get on the ride at a t

Explain linked list allocation using index, Linked list allocation using in...

Linked list allocation using index The blocks don't have a fixed size. Pointers are utilized to point to the next block in a file. The pointers are set aside as a separate tabl

What are the differences between process and thread, What are the differenc...

What are the differences between process and thread? The fundamental difference between a process and a thread is that a process has an entire copy of the program to itself and

Explain quick fit algorithams, QUICK FIT ALGORITHAMS Here we keep apart...

QUICK FIT ALGORITHAMS Here we keep apart lists for holes and processes. Therefore this reduces the searching time for holes Hole list and Process list. If we organize the li

Define ufd and mfd, Define UFD and MFD. In the two-level directory stru...

Define UFD and MFD. In the two-level directory structure, every user has her own user file directory (UFD). Every UFD has a similar structure, but lists only the files of a one

Explain briefly the working of semaphore with example ?, Explain briefly th...

Explain briefly the working of semaphore with example ? The E.W. Dijkstra (1965) abstracted the key idea of mutual exclusion in his concepts of semaphores. Definition A s

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.

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