In queueing theory, an M/G/1M/G/1M/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/1M/G/1M/G/1 queue is to model the performance of a fixed head hard disk.
Every Tuesday, I publish my most recent readings and thoughts. Subscribe to my newsletter if you want to follow topics about #startups, #mental-models, #cryptocurrencies, and more. You can also check my past issues on Revue.