[koricha]

if i use a non-preemptive scheduling algorithm in a system that had both batch and interactive jobs. How would this algorithm affect response time.

Non-preemptive algorithms are designed so that once a process enters the running state, it is not removed from the processor until it has completed its service time. so i guess the the response time would be slower?

[blackcompe]

Traditionally, in batch processing a job runs to completion, so an interactive program would have to wait until the CPU resources become available. If the OS scheduler was preemptive, it could let the interactive program get some CPU time in-between jobs; but since that's not the case, the program is left starving.

This post has been edited by blackcompe: 09 October 2012 - 02:56 PM

[koricha]

thank you blackcompe very helpful