2 Replies - 974 Views - Last Post: 09 October 2012 - 03:05 PM

#1 koricha  Icon User is offline

  • D.I.C Head

Reputation: 0
  • View blog
  • Posts: 85
  • Joined: 08-February 12

operating system algorithm

Posted 09 October 2012 - 01:49 PM

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?
Is This A Good Question/Topic? 0
  • +

Replies To: operating system algorithm

#2 blackcompe  Icon User is offline

  • D.I.C Lover
  • member icon

Reputation: 1155
  • View blog
  • Posts: 2,533
  • Joined: 05-May 05

Re: operating system algorithm

Posted 09 October 2012 - 02:54 PM

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

Was This Post Helpful? 1
  • +
  • -

#3 koricha  Icon User is offline

  • D.I.C Head

Reputation: 0
  • View blog
  • Posts: 85
  • Joined: 08-February 12

Re: operating system algorithm

Posted 09 October 2012 - 03:05 PM

thank you blackcompe very helpful
Was This Post Helpful? 0
  • +
  • -

Page 1 of 1