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

Determine the minimum number of units of resource, An operating system invo...

An operating system involves 3 user processes each one requiring 2 units of resource R .The minimum number of units of R like no deadlocks will ever take place is The minimum

Total physical memory and total virtual memory , A practical task specified...

A practical task specified in the Study Guide, Computer architecture, was to record your computer's specifications. Submit the data you recorded, which will contain the following d

Describe two segment-replacement algorithms, Q. Segmentation is alike to p...

Q. Segmentation is alike to paging but uses variable-sized "pages". Describe two segment-replacement algorithms based on FIFO and LRU page replacement schemes. Remember that since

Algorithm for reconstructing a logical ring, Q. Present an algorithm for re...

Q. Present an algorithm for reconstructing a logical ring after a process in the ring fails? Answer: Typically distributed systems utilize a coordinator process that performs

Describe the possible rmi invocation semantics, Question: (a) Explain t...

Question: (a) Explain the similarities and differences between two different threads running in the same process and two independent processes. When would you want to use two t

Deadlock-avoidance algorithm, Regard as a computer system that runs 5000 jo...

Regard as a computer system that runs 5000 jobs per month with no deadlock-prevention or deadlock-avoidance scheme. Deadlocks take place about twice per month and the operator must

Page-table lookups, How exactly is a page table used to look up an address?...

How exactly is a page table used to look up an address? The CPU has a page table base register (PTBR)which points to the base (entry 0) of the level-0 page table. Each process h

Disk scheduling algorithms-first come, FCFS (First Come, First Served) Per...

FCFS (First Come, First Served) Perform operations in order requested No reordering of work queue No starvation every demand is serviced Poor performance

Keeping track of free memory, How do we keep track of where the free pieces...

How do we keep track of where the free pieces of memory are? One idea is to maintain a set of linked-lists of free space; each linked-list will store free chunks of some given size

Principles of operating systems, Objective - Tiny Shell (tish) In this...

Objective - Tiny Shell (tish) In this exercise you will write a small shell program to run different programs in foreground and background mode. Background Usually when

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