Non-preemptive algorithms can be a good choice for interactive systems in scenarios where predictability and simplicity are prioritized, as they allow a running process to complete its execution without interruption. This can enhance user experience by providing consistent response times for tasks. However, they may lead to inefficiencies, particularly if a long-running task blocks shorter, more urgent tasks, potentially causing delays in responsiveness. Overall, the choice depends on the specific requirements and constraints of the interactive system in question.
In preemptive multitasking, when a program does not work properly, the operating system regains control instead of losing it to continue smooth operation. Preemptive multitasking creates reliability of the computer system.
single precision
If a process does not complete before its CPU-time expires, the CPU is preempted and given to the next process waiting in a queue. The preempted process is then placed at the back of the ready list. Round Robin Scheduling is preemptive (at the end of time-slice) therefore it is effective in time-sharing environments in which the system needs to guarantee reasonable response times for interactive users.
Mac OS X is a preemptive multitasking system.
Windows 95
list down some design issues in developing an interactive system?
False. Windows XP is a preemptive multitasking system. All contemporary operating systems are designed to use preemptive multitasking.
An operating system that allows users to run interactive programs. Pretty much all operating systems that are on PCs are interactive OS's
Once the CPU has been allocated to a process, the process keeps the CPU until it releases the CPU either by terminating or by switching to the waiting state. In a general purpose computer system, users share the CPU and care about system responsiveness. If the system uses non-preemptive scheduling, some users may sit before the monitor for several hours without doing anything other than waiting for the set of processes in front of them in the system queue to finish. So, strictly non-preemptive scheduling is unlikely to be used in a general purpose computer system.
time sharing operating system is user interactive, but multiprogramming operating system need not be user interactive
yes but they won't be interactive
Non-preemptive scheduler gives a process control of computer until it gives it up. Preemptive scheduler ensures that all processes are given equal(or different) priority, so they run only for a short amount of time, before control is given to another process. Which means that preemptive system is capable of running many processes 'at once', without crashing when one process refuses to give up CPU control If a bug like infinite loop, or a process refusing to give up control(a virus for example) is encountered, only thing left to do is to reset the system.