Pedro Arantes
HomeBlogMe

Round-Robin Scheduling

With this algorithm, the system handles low-priority and doesn't get stuck in large jobs with uncertain time to complete.
#computing
#queueing-theory
Zettelkasten, August 13th, 2022.
The Network

Notes

  • It's an algorithm to handle processes and tasks in #computing.

  • It gives time slices, or time quanta, to each process in equal portions and circular order.

  • With this algorithm, the system handles low-priority and doesn't get stuck in large jobs with uncertain time to complete.

References

RecommendationsDo you want to see all posts instead?
At High Utilization Levels, Queues Grow Much Faster than They Can Shrink
At high utilization levels, losing capacity generates a queue much faster than regaining capacity can shrink.
#queueing-theory
Capacity Utilization Increases Queues Exponentially
Each time you halve the amount of excess capacity, you double the queue. You fold the queue as you move from 80 to 90 or 90 to 95 percent.
#queueing-theory
Control WIP by Shedding Requirements
When WIP becomes high, you can purge WIP by decreasing the batch size of your jobs. A way to achieve this is to shed the requirements of your jobs.
#cycle-time
#job-batching
#queueing-theory
#work-in-process
Block All Demand when WIP Reaches Its Upper Limit
You can block queues in two ways: 1. Eject the arriving job from the system. 2. Hold back the job in an upstream queue.
#product-development
#queueing-theory
#work-in-process
Cost of Delay
Cost of delay (COD) determines the financial impact on the company if it releases a product on the market earlier or later. When a product arrives on the market X months earlier, revenues also roll in X months earlier.
#cost-of-delay
#product-development
#queueing-theory