Stochastic bounds in Fork-Join queueing systems under full and partial mapping

DOI10.1007/S11134-016-9486-XMaRDI QIDQ335902zbMATH OpenOpenAlexFDO

Authors Amr Rizk, Felix Poloczek, Florin Ciucu

Publication date 10 November 2016

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11134-016-9486-x

zbMATH Keywords

performance evaluationMapReduceparallel systemsFork-Join queuemultipath

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Communication networks in operations research (90B18)

Recommendations

• The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
• Stochastic comparisons for fork-join queues with exponential processing times
• Large fork-join queues with nearly deterministic arrival and service times
• On the Diffusion Approximation to a Fork and Join Queueing Model
• A fork-join queueing model: Diffusion approximation, integral representations and asymptotics
• A note on stochastic bounds for queueing networks
• scientific article; zbMATH DE number 2032442

Cites work

• scientific article; zbMATH DE number 765034 (Why is no real title available?)
• scientific article; zbMATH DE number 932428 (Why is no real title available?)
• scientific article; zbMATH DE number 1393308 (Why is no real title available?)
• scientific article; zbMATH DE number 3316606 (Why is no real title available?)
• An End-to-End Approach to the Resequencing Problem
• Big queues.
• Exponential Approximations for Tail Probabilities in Queues, I: Waiting Times
• Exponential bounds for queues with Markovian arrivals
• Exponential upper bounds via martingales for multiplexers with Markovian arrivals
• Gaussian limits for a fork-join network with nonexchangeable synchronization in heavy traffic
• Mean sojourn times in two-queue fork-join systems: bounds and approximations
• On the Large Deviations of Resequencing Queue Size: 2-M/M/1 Case
• On the theory of order statistics
• Queueing Analysis of a Reordering Issue
• Sojourn times in G/M/1 fork-join networks
• Stochastic network calculus.
• 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

Cited in

(8)

• Dynamic control of the join-queue lengths in saturated fork-join stations
• Delay asymptotics and bounds for multitask parallel jobs
• Nonlinear approximation of characteristics of a fork-join queueing system with Pareto service as a model of parallel structure of data processing
• Stochastic comparisons for fork-join queues with exponential processing times
• Open problems in queueing theory inspired by datacenter computing
• Biased Processor Sharing in Fork-Join Queues
• ON THE PROBABILITY DISTRIBUTION OF JOIN QUEUE LENGTH IN A FORK-JOIN MODEL
• The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds

Describes a project that uses

Uses Software

• MapReduce
• Hadoop
• Amazon EC2

This page was built for publication: Stochastic bounds in Fork-Join queueing systems under full and partial mapping

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