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

Multilevel queue scheduling, Explain multilevel queue scheduling and multil...

Explain multilevel queue scheduling and multilevel feedback queue scheduling #Minimum 100 words accepted#

Is there any way to execute truly stable storage, Q. Is there any way to ex...

Q. Is there any way to execute truly stable storage? Describe your answer. Answer: Truly steady storage would never lose data. The fundamental technique for steady storage is

Write an equation for this seek time, Q. The accelerating search for descr...

Q. The accelerating search for described in subsequent exercise is typical of hard-disk drives. By contrast floppy disks and several hard disks manufactured before the mid-1980s t

Assignment, i need the job to be done within 3 days

i need the job to be done within 3 days

Write a short note on disk structure, Write a short note on disk structure ...

Write a short note on disk structure Modern disk drives are initiate as large one dimensional array of logical blocks where the logical block is the smallest unit of transfer.

Describe the file system architecture-device driver, Device Drivers ...

Device Drivers Communicates straight with peripheral devices (disks, tapes, etc.). Responsible for begin physical I/O operations on the device. Pro

Advantages and disadvantages of using circuit switching, Q. What are the ad...

Q. What are the advantages as well as disadvantages of using circuit switching? For what types of applications is circuit switching a viable strategy? Answer: Circuit

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

#title.Kernal, Ask questiWhat is dispatcheron #Minimum 100 words accepted#

Ask questiWhat is dispatcheron #Minimum 100 words accepted#

What are the necessary conditions for deadlocks?, What are the necessary co...

What are the necessary conditions for deadlocks? 1. Mutual exclusion :  Only one process at a time is able to use the resource. 2. Hold and wait :  A process should be holdi

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