Fork–join queue (original) (raw)
In queueing theory, a discipline within the mathematical theory of probability, a fork–join queue is a queue where incoming jobs are split on arrival for service by numerous servers and joined before departure. The model is often used for parallel computations or systems where products need to be obtained simultaneously from different suppliers (in a warehouse or manufacturing setting). The key quantity of interest in this model is usually the time taken to service a complete job. The model has been described as a "key model for the performance analysis of parallel and distributed systems." Few analytical results exist for fork–join queues, but various approximations are known.
| Property | Value |
|---|---|
| dbo:abstract | In queueing theory, a discipline within the mathematical theory of probability, a fork–join queue is a queue where incoming jobs are split on arrival for service by numerous servers and joined before departure. The model is often used for parallel computations or systems where products need to be obtained simultaneously from different suppliers (in a warehouse or manufacturing setting). The key quantity of interest in this model is usually the time taken to service a complete job. The model has been described as a "key model for the performance analysis of parallel and distributed systems." Few analytical results exist for fork–join queues, but various approximations are known. The situation where jobs arrive according to a Poisson process and service times are exponentially distributed is sometimes referred to as a Flatto–Hahn–Wright model or FHW model. (en) Fork join — метод, применяемый в коммуникационных и компьютерных системах и служащий для увеличения производительности выполнения большого количества рабочих задач. Метод заключается в том, что каждая задача разбивается на множество более мелких синхронизированных задач, которые обрабатываются параллельно на разных серверах. Суть метода проста: большая задача разбивается на задачи поменьше, те, в свою очередь, на ещё более мелкие задачи, и так до тех пор, пока это имеет смысл. В самом конце получившаяся тривиальная задача выполняется последовательно. Данный этап называется Fork. Результат выполнения последовательных задач объединяется вверх по цепочке, пока не получится решение самой верхней задачи. Данный этап называется Join. Выполнение всех задач происходит параллельно. (ru) |
| dbo:thumbnail | wiki-commons:Special:FilePath/Fork-join-queue.svg?width=300 |
| dbo:wikiPageID | 22173188 (xsd:integer) |
| dbo:wikiPageLength | 15589 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 997959527 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:M/G/1_queue dbr:M/M/1_queue dbr:D/M/1_queue dbr:Deterministic_system dbr:RAID dbr:Moment_(mathematics) dbr:Parallel_computing dbr:Distributed_computing dbr:Probability_theory dbr:Queueing_theory dbr:Range_(statistics) dbr:Reflected_Brownian_motion dbr:Asymptotic_analysis dbc:Single_queueing_nodes dbr:Markov_chain dbr:Mean_value_analysis dbr:Uniformization_(probability_theory) dbr:Phase-type_distribution dbr:Poisson_process dbr:Product_form_solution dbr:File:Fork-join-queue.svg |
| dbp:wikiPageUsesTemplate | dbt:Reflist dbt:Rp dbt:Use_dmy_dates dbt:Queueing_theory |
| dct:subject | dbc:Single_queueing_nodes |
| gold:hypernym | dbr:Queue |
| rdf:type | dbo:Software |
| rdfs:comment | In queueing theory, a discipline within the mathematical theory of probability, a fork–join queue is a queue where incoming jobs are split on arrival for service by numerous servers and joined before departure. The model is often used for parallel computations or systems where products need to be obtained simultaneously from different suppliers (in a warehouse or manufacturing setting). The key quantity of interest in this model is usually the time taken to service a complete job. The model has been described as a "key model for the performance analysis of parallel and distributed systems." Few analytical results exist for fork–join queues, but various approximations are known. (en) Fork join — метод, применяемый в коммуникационных и компьютерных системах и служащий для увеличения производительности выполнения большого количества рабочих задач. Метод заключается в том, что каждая задача разбивается на множество более мелких синхронизированных задач, которые обрабатываются параллельно на разных серверах. (ru) |
| rdfs:label | Fork–join queue (en) Fork join (ru) |
| owl:sameAs | freebase:Fork–join queue wikidata:Fork–join queue dbpedia-fa:Fork–join queue dbpedia-hu:Fork–join queue dbpedia-ru:Fork–join queue https://global.dbpedia.org/id/3iz68 |
| prov:wasDerivedFrom | wikipedia-en:Fork–join_queue?oldid=997959527&ns=0 |
| foaf:depiction | wiki-commons:Special:FilePath/Fork-join-queue.svg |
| foaf:isPrimaryTopicOf | wikipedia-en:Fork–join_queue |
| is dbo:wikiPageDisambiguates of | dbr:Fork–join |
| is dbo:wikiPageRedirects of | dbr:Flatto-Hahn-Wright_model dbr:Fork-join_queue dbr:Flatto–Hahn–Wright_model dbr:Fork-join_network |
| is dbo:wikiPageWikiLink of | dbr:Flatto-Hahn-Wright_model dbr:Fork-join_queue dbr:Fork–join dbr:Flatto–Hahn–Wright_model dbr:Fork-join_network |
| is foaf:primaryTopic of | wikipedia-en:Fork–join_queue |
