Question

Explain the trade-offs involved in choosing the size of a time slice for a round robin algorithm\

Answer 1

Round-robin algorithms are for computation by network and process schedulers.

Each process is assigned a time slice for its completion. The time slice is the time required to complete a process. In a round-robin algorithm, the time slice for each process or task is the same. Moreover, since the time slice is assigned in a circular order, there is no priority for any task.

However, the trade off is that since both big and small tasks are assigned the same time slices, there are instances of a smaller task getting completed before the time allocated. In such cases, the next task does not commence until the allotted time period is over. This, in turn, leads to delay in completion of the overall process.