Home/ Questions/Q 6346017
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-24T20:56:10+00:00

I have some clear understanding about Time slicing algorithm for CPU task scheduling.But i

  • 0

I have some clear understanding about Time slicing algorithm for CPU task scheduling.But i have some confusion with Shortest job first algorithm.

For example:

I have two programs.

one program with infinite loop and another with finite loop.In this situation,how CPU determining job for execute by using shortest job first.

CPU only understand this kind of situation while executing those programs(Whether it is infinite or finite).

Please Guide me to get out of this issue…

Thanks & Regards,
Saravanan.P

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    It’s taking the Job with the lowest process burst assumption (intervals with no I/O-Usage). Computers can’t really determine infinite loops or tell if it’s just a long query, but it can determine I/O-usage.

    • 0