Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
M/G/1 queue
open-in-new
<p>In <a href="/facts/Queueing_theory/8NDl56EM">queueing theory</a>, a discipline within the mathematical <a href="/facts/Probability_theory/mFBn51rE">theory of probability</a>, an M/G/1 queue is a queue model where arrivals are Markovian (modulated by a <a href="/facts/Poisson_process/8uphjAUc">Poisson process</a>), service times have a General <a href="/facts/Probability_distribution/EpsKKVRu">distribution</a> and there is a single server. The model name is written in <a href="/facts/Kendall%2527s_notation/zz5PJ7vs">Kendall's notation</a>, and is an extension of the <a href="/facts/M%2fM%2f1_queue/eTkKX6Ro">M/M/1 queue</a>, where service times must be <a href="/facts/Exponential_distribution/yY3EdV0u">exponentially distributed</a>. The classic application of the M/G/1 queue is to model performance of a fixed head <a href="/facts/Hard_disk/kekLSGSE">hard disk</a>. </p>