2007•Spiral (Imperial College London)Open access

Response Time Approximations in Fork-Join Queues

Abigail S. Lebrecht, William J. Knottenbelt

Abstract

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

Open-access reader

About this research paper

What this paper is about

Why it matters

OpenAlex reports 49 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Fork (system call), Fork–join queue, Join (topology), Queueing theory, Computer science, Queue, Server, Parallel computing