Fork–join queue
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.
Wikipage disambiguates
sameAs
primaryTopic
Fork–join queue
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.
has abstract
Fork join — метод, применяемый ...... задач происходит параллельно.
@ru
In queueing theory, a discipli ...... ahn–Wright model or FHW model.
@en
thumbnail
Wikipage page ID
22,173,188
Wikipage revision ID
729,413,374
subject
hypernym
type
comment
Fork join — метод, применяемый ...... араллельно на разных серверах.
@ru
In queueing theory, a discipli ...... ious approximations are known.
@en
label
Fork join
@ru
Fork–join queue
@en
