M/G/1 Queue

In queueing theory, an M/G/1 queue is a queue in which the arrivals are a Markovian, service has a general distribution, and a single server.

#queueing-theory

Zettelkasten, August 31st, 2021.

Notes

In queueing theory, an $M/G/1$ queue is a queue in which the arrivals are a Markovian, service has a general distribution, and a single server.
The classic application of a $M/G/1$ queue is to model the performance of a fixed head hard disk.

References

Wikipedia. M/G/1 queue

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.

#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

Queueing Theory

It can provide essential insights to product developers because there're similar problems of unpredictable work arrival time and unpredictable task durations.

#agner-krarup-erlang

#kendal-notation

#product-development

#queueing-theory