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

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

Ask questiWhat is dispatcheron #Minimum 100 words accepted#

Explain the tlsalloc (void) - tls function call, Explain the TlsAlloc (VOID...

Explain the TlsAlloc (VOID) This function is used to allocate a TLS index.Any subsequent TLS function calls will require  the handle returned  from TlsAlloc to be passed. The i

Tlb replacement algorithm, Suppose a logical address space is 1KB, and the ...

Suppose a logical address space is 1KB, and the page-size is 16 bytes. Assume no page is in the main memory for this process initially and the pure demand paging is used. Current f

What is thrashing, What is thrashing? It is a method in virtual memory...

What is thrashing? It is a method in virtual memory schemes when the processor spends most of its time swapping pages, rather than implementing instructions. This is because o

Prepare gantt charts and determine the average waiting time, Prepare Gantt ...

Prepare Gantt Charts and Determine the Average Waiting Time 1. Classify the interaction among the processes on the basis if degree to which they are aware of each  other's exi

Demand paging, Demand paging With demand paging, a page is called into...

Demand paging With demand paging, a page is called into memory only when a location on that page is actually indexed during run time. With pre-paging, pages other than the one

Principles of informtiona tecnologu, i need to complete project on lan arch...

i need to complete project on lan architceture RAIDs etc

Explain two-phase locking protocol, Q. Show that a few schedules are possib...

Q. Show that a few schedules are possible under the two-phase locking protocol however not possible under the timestamp protocol and vice versa. Answer: A schedule that is auth

State critical section problem, State critical section problem? Discuss thr...

State critical section problem? Discuss three solutions to solve the critical section problem. C-S Problem:- n processes all competing to use some shared data Every

Bankers algorithm, p0A B C D A B C D A B C D 2 0 12 2012 1000 1354 0632 ...

p0A B C D A B C D A B C D 2 0 12 2012 1000 1354 0632 0014

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