Question

There is a centralized system which is accessed by multiple groups. The first group accesses the general information for a very short time and there are 15 users in this group. Second group accesses the system for critical computation intensive work and there are only 2 users in this group. Which scheduling algorithm will suit this environment and how?

Answer 1

The scheduling algorithm that would suit this environment is the Shortest Job Next (SJN) algorithm.

Step-by-step explanation:

The scheduling algorithm that would suit this environment is the Shortest Job Next (SJN) algorithm.

The SJN algorithm assigns priority to each job based on its total execution time. In this case, the first group accessing the system for a very short time can be considered as short jobs, while the second group accessing the system for critical computation intensive work can be considered as long jobs.

By using the SJN algorithm, the short jobs of the first group will be executed quickly, allowing the general information to be accessed efficiently. The long jobs of the second group will receive lower priority and may experience longer waiting times, but this is acceptable as they involve critical computation intensive work.