Introducing
Your new presentation assistant.
Refine, enhance, and tailor your content, source relevant images, and edit visuals quicker than ever before.
Trending searches
Time sharing operating systems
Time sharing operating systems
Take a look!
Time sharing reduces idling of the CPU as most time sharing operations use rounnd robin where each processes is scheduled to a certain amount of time to carry out the process. "In this approach, Programs are executed with rotating priority that increases during waiting and drops after the service is granted. In Order to prevent a program from monopolising the processor, a program executing longer than the system defined as time-slice is interrupted by the operating system and placed at the end of the queue of waiting program." This means that the CPU does not have to to wait for queues as often as the processes are rotated constantly, maximizing it's full potential.
Time sharing operating sytems have very fast response times . According to tutorialpoint.com "Multiple jobs are executed by the CPU by switching between them, but the switches occur so frequently. Thus, the user can receive an immediate response. For example, in a transaction processing, processor execute each user program in a short burst or quantum of computation. That is if n users are present, each user can get time quantum. When the user submits the command, the response time is in few seconds at most." Hence, time sharing focuses on the minimizing of response times by simultaneously switching between processes.
Duplication can be avoided as time sharing is based on the fact that, the oprating system has the capacity to host multiple users. Hence, there is no need for one user to use the resources of the other as the operating system is also responsible for the proper allocation of resources so that processes can be exucuted efficiently with duplication of another as mentoned before.