Controlling variability in split-merge systems and its impact on performance

DOI10.1007/S10479-014-1560-3MaRDI QIDQ291329zbMATH OpenOpenAlexWikidataFDO

Authors Iryna Tsimashenka, William J. Knottenbelt, Peter G. Harrison

Publication date 7 June 2016

Published in Annals of Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10479-014-1560-3

zbMATH Keywords

optimal subtask delayssplit-merge systemssubtask variability

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Existence of optimal solutions to problems involving randomness (49J55)

Recommendations

• Controlling Variability in Split-Merge Systems
• Trading off subtask dispersion and response time in split-merge systems
• An analysis of the number of tasks in a parallel multi-processor system with task-splitting and feedback.
• Modelling and analysis of split and merge production systems with Bernoulli reliability machines
• OPTIMAL SPLITTING OF RENEWAL INPUT PROCESS TO A QUEUEING SYSTEM AND ITS APPLICATION TO A NETWORK

Cites work

• scientific article; zbMATH DE number 1219577 (Why is no real title available?)
• A Note on Order Statistics for Heterogeneous Distributions
• A Simplex Method for Function Minimization
• A simulated annealing driven multi-start algorithm for bound constrained global optimization
• Acyclic fork-join queuing networks
• An algorithm with guaranteed convergence for finding a zero of a function
• Analysis of the fork-join queue
• Analytic Queueing Models for Programs with Internal Concurrency
• Approximation Theorems of Mathematical Statistics
• Basics of Applied Stochastic Processes
• Computing distributions of order statistics
• Controlling Variability in Split-Merge Systems
• Implementing Generating Set Search Methods for Linearly Constrained Minimization
• Queueing Networks and Markov Chains
• The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
• Two Parallel Queues Created by Arrivals with Two Demands I
• Two Parallel Queues Created by Arrivals with Two Demands II

Cited in

(4)

• Trading off subtask dispersion and response time in split-merge systems
• Controlling Variability in Split-Merge Systems
• Stationary waiting time in parallel queues with synchronization
• Biased Processor Sharing in Fork-Join Queues

Describes a project that uses

Uses Software

• BRENT

This page was built for publication: Controlling variability in split-merge systems and its impact on performance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q291329)