Response Time Approximations in Fork-Join Queues
Abigail S. Lebrecht, William J. Knottenbelt · Spiral (Imperial College London) · 2007
Fork-join queueing networks model a network of parallel servers in which an arriving job splits into a number of subtasks that are serviced in parallel. Fork-join queues can be used to model disk arrays. A response time approximation of the fork-join queue is presented that attempts to comply with the additional constraints of modelling a disk array. This approximation is compared with existing analytical approximations of the fork-join queueing network. 1