Response Time Approximations in Fork-Join Queues

Abigail S. Lebrecht · William J. Knottenbelt

47 citations0/0 files storedSpiral (Imperial College London)

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Interconnection Networks and Systems Petri Nets in System Modeling

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

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 47 citations exist upstream.

References

1988Approximate analysis of fork/join synchronization in parallel queues 1994Interpolation approximations for symmetric Fork-Join queues 1999Mean value technique for closed fork-join networks

Cited by

2016Stochastic bounds in Fork–Join queueing systems under full and partial mapping 2013Efficient Response Time Approximations for Multiclass Fork and Join Queues in Open and Closed Queuing Networks 2016Non-asymptotic delay bounds for (k, l) fork-join systems and multi-stage fork-join networks 2015Computable Bounds in Fork-Join Queueing Systems 2018Non-Asymptotic Delay Bounds for Multi-Server Systems with Synchronization Constraints

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.