The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
- 1 September 1989
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 21 (3), 629-660
- https://doi.org/10.2307/1427640
Abstract
A simple queueing system, known as the fork-join queue, is considered with basic performance measure defined as the delay between the fork and join dates. Simpl...Keywords
This publication has 10 references indexed in Scilit:
- Multidimensional Stochastic Ordering and Associated Random VariablesOperations Research, 1989
- Approximate analysis of fork/join synchronization in parallel queuesIEEE Transactions on Computers, 1988
- Stability and bounds for single server queues in random environmentCommunications in Statistics. Stochastic Models, 1986
- Two Parallel Queues Created by Arrivals with Two Demands ISIAM Journal on Applied Mathematics, 1984
- Minimizing Delays in the GI/G/1 QueueOperations Research, 1984
- The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in NetworksJournal of the ACM, 1983
- A class of dependent random variables and their maximaProbability Theory and Related Fields, 1978
- Stochastic Processes in Queueing TheoryPublished by Springer Nature ,1976
- Some Extremal Problems in the Theory of Mass ServiceTheory of Probability and Its Applications, 1966
- The stability of a queue with non-independent inter-arrival and service timesMathematical Proceedings of the Cambridge Philosophical Society, 1962