Round Robin Scheduler

mediumSave

QueueSimulation

In a Round Robin scheduling algorithm, each process is assigned a fixed time (quantum) in cyclic order, handling all processes without prioritization. Implement a function that calculates the total waiting time for a set of processes. The waiting time is the time a process needs to wait before its turn comes for execution.\n\nGiven: An array of integers where each element represents the time a process takes to execute. The function also takes an integer for the quantum.\n\nOutput: Return the total waiting time for all processes.

Example 1

Input

Output

Explanation. The first cycle allows all processes to execute for up to 3 units of time. First process completes in 1 unit, the second and third need more time. Second cycle: the second process completes, and the third one uses 2 units. Total waiting time is sum of individual waits.

Example 2

Input

Output

Explanation. Each cycle allows for 1 unit per process, requiring several cycles for all to finish. Each process accumulates wait from all preceding cycles until it completes.

Example 3

Input

[
  [
    7
  ],
  5
]

Output

Explanation. Only one process with no need to wait. It completes on the second quantum allocation.

Example 4

Input

Output

Explanation. Processes will complete in multiple cycles, but the wait times accumulate in between cycles as they wait for another turn.

Follow-up: How might the efficiency of this scheduler change as the number of processes increases or the quantum varies?

Constraints:

- The quantum is always a positive integer and less than or equal to the time of the longest process.\n- Process times are positive integers.

Views: 9