| http://dbpedia.org/ontology/abstract
|
In queueing theory, a discipline within th … In queueing theory, a discipline within the mathematical theory of probability, an M/G/1 queue is a queue model where arrivals are Markovian (modulated by a Poisson process), service times have a General distribution and there is a single server. The model name is written in Kendall's notation, and is an extension of the M/M/1 queue, where service times must be exponentially distributed. The classic application of the M/G/1 queue is to model performance of a fixed head hard disk.del performance of a fixed head hard disk.
|
| http://dbpedia.org/ontology/wikiPageID
|
33378064
|
| http://dbpedia.org/ontology/wikiPageLength
|
13614
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1108905534
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Random_variable +
, http://dbpedia.org/resource/Expected_value +
, http://dbpedia.org/resource/Arrival_theorem +
, http://dbpedia.org/resource/Pollaczek%E2%80%93Khinchine_transform_equation +
, http://dbpedia.org/resource/Laplace%E2%80%93Stieltjes_transform +
, http://dbpedia.org/resource/Exponential_distribution +
, http://dbpedia.org/resource/M/G/k_queue +
, http://dbpedia.org/resource/Moment-generating_function +
, http://dbpedia.org/resource/Probability_distribution +
, http://dbpedia.org/resource/Mean_sojourn_time +
, http://dbpedia.org/resource/Last-come%2C_first_served +
, http://dbpedia.org/resource/Markov_chain +
, http://dbpedia.org/resource/Processor_sharing +
, http://dbpedia.org/resource/Shortest_remaining_processing_time +
, http://dbpedia.org/resource/State_space +
, http://dbpedia.org/resource/Stochastic_matrix +
, http://dbpedia.org/resource/Probability_density_function +
, http://dbpedia.org/resource/Kendall%27s_notation +
, http://dbpedia.org/resource/Method_of_supplementary_variables +
, http://dbpedia.org/resource/Stationary_process +
, http://dbpedia.org/resource/Poisson_process +
, http://dbpedia.org/resource/Shortest_job_first +
, http://dbpedia.org/resource/M/M/c_queue +
, http://dbpedia.org/resource/Hard_disk +
, http://dbpedia.org/resource/Probability_theory +
, http://dbpedia.org/resource/Embedded_Markov_chain +
, http://dbpedia.org/resource/M/M/1_queue +
, http://dbpedia.org/resource/Pollaczek%E2%80%93Khinchine_formula +
, http://dbpedia.org/resource/Probability-generating_function +
, http://dbpedia.org/resource/Queueing_theory +
, http://dbpedia.org/resource/Generalized_foreground-background +
, http://dbpedia.org/resource/Category:Single_queueing_nodes +
, http://dbpedia.org/resource/First-come%2C_first-served +
, http://dbpedia.org/resource/Probability_generating_function +
, http://dbpedia.org/resource/Statistically_independent +
, http://dbpedia.org/resource/Matrix_analytic_method +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Main +
, http://dbpedia.org/resource/Template:Stochastic_processes +
, http://dbpedia.org/resource/Template:Use_American_English +
, http://dbpedia.org/resource/Template:Short_description +
, http://dbpedia.org/resource/Template:Rp +
, http://dbpedia.org/resource/Template:Queueing_theory +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Single_queueing_nodes +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Model +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/M/G/1_queue?oldid=1108905534&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/M/G/1_queue +
|
| owl:sameAs |
http://rdf.freebase.com/ns/m.0h95pvx +
, https://global.dbpedia.org/id/3ciAo +
, http://hu.dbpedia.org/resource/M/G/1-t%C3%ADpus%C3%BA_sorban%C3%A1ll%C3%A1s +
, http://www.wikidata.org/entity/Q3916814 +
, http://dbpedia.org/resource/M/G/1_queue +
|
| rdf:type |
http://dbpedia.org/class/yago/StochasticProcess113561896 +
, http://dbpedia.org/class/yago/Cognition100023271 +
, http://dbpedia.org/class/yago/Concept105835747 +
, http://dbpedia.org/class/yago/Abstraction100002137 +
, http://dbpedia.org/class/yago/WikicatStochasticProcesses +
, http://dbpedia.org/class/yago/PsychologicalFeature100023100 +
, http://dbpedia.org/ontology/Person +
, http://dbpedia.org/class/yago/Idea105833840 +
, http://dbpedia.org/class/yago/Content105809192 +
, http://dbpedia.org/class/yago/Hypothesis105888929 +
, http://dbpedia.org/class/yago/Model105890249 +
|
| rdfs:comment |
In queueing theory, a discipline within th … In queueing theory, a discipline within the mathematical theory of probability, an M/G/1 queue is a queue model where arrivals are Markovian (modulated by a Poisson process), service times have a General distribution and there is a single server. The model name is written in Kendall's notation, and is an extension of the M/M/1 queue, where service times must be exponentially distributed. The classic application of the M/G/1 queue is to model performance of a fixed head hard disk.del performance of a fixed head hard disk.
|
| rdfs:label |
M/G/1 queue
|
