Controlling variability in split-merge systems and its impact on performance
From MaRDI portal
Publication:291329
DOI10.1007/s10479-014-1560-3zbMath1346.60133WikidataQ59476025 ScholiaQ59476025MaRDI QIDQ291329
William J. Knottenbelt, Peter G. Harrison, Iryna Tsimashenka
Publication date: 7 June 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-014-1560-3
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
49J55: Existence of optimal solutions to problems involving randomness
Related Items
Stationary Waiting Time in Parallel Queues with Synchronization, Biased Processor Sharing in Fork-Join Queues
Uses Software
Cites Work
- A simulated annealing driven multi-start algorithm for bound constrained global optimization
- Controlling Variability in Split-Merge Systems
- Two Parallel Queues Created by Arrivals with Two Demands I
- Approximation Theorems of Mathematical Statistics
- Implementing Generating Set Search Methods for Linearly Constrained Minimization
- Basics of Applied Stochastic Processes
- Two Parallel Queues Created by Arrivals with Two Demands II
- Analysis of the fork-join queue
- Acyclic fork-join queuing networks
- Analytic Queueing Models for Programs with Internal Concurrency
- Computing distributions of order statistics
- The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
- Queueing Networks and Markov Chains
- A Note on Order Statistics for Heterogeneous Distributions
- A Simplex Method for Function Minimization
- An algorithm with guaranteed convergence for finding a zero of a function
- Unnamed Item
