The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
From MaRDI portal
Publication:4730587
DOI10.2307/1427640zbMath0681.60096OpenAlexW2329656816MaRDI QIDQ4730587
François Baccelli, Adam Shwartz, Armand M. Makowski
Publication date: 1989
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1427640
stochastic boundsstochastic orderingqueueing systemincreasing convex orderingtransient and steady-state regimes
Related Items (24)
Moments and tails in monotone-separable stochastic networks. ⋮ Controlling variability in split-merge systems and its impact on performance ⋮ Performance of static priority rules for shared facilities in a remanufacturing shop with disassembly and reassembly ⋮ Queueing with redundant requests: exact analysis ⋮ Stochastic bounds in Fork-Join queueing systems under full and partial mapping ⋮ Queues and Risk Models with Simultaneous Arrivals ⋮ Structured buffer-allocation problems ⋮ Minimizing makespan of stochastic customer orders in cellular manufacturing systems with parallel machines ⋮ Scheduling parallel processors: Structural properties and optimal policies ⋮ Fork-join and redundancy systems with heavy-tailed job sizes ⋮ Mean sojourn times in two-queue fork-join systems: bounds and approximations ⋮ Generalized parallel-server fork-join queues with dynamic task scheduling ⋮ Sojourn times in G/M/1 fork‐join networks ⋮ A GENERALIZED STOCHASTIC PETRI-NET MODEL FOR PERFORMANCE ANALYSIS AND ALLOCATION OPTIMIZATION OF A PARTICULAR REPAIR SYSTEM ⋮ Response times in M/M/s fork-join networks ⋮ Estimating the throughput of a cyclic assembly system ⋮ Gaussian Limits for a Fork-Join Network with Nonexchangeable Synchronization in Heavy Traffic ⋮ Open problems in queueing theory inspired by datacenter computing ⋮ ON THE PROBABILITY DISTRIBUTION OF JOIN QUEUE LENGTH IN A FORK-JOIN MODEL ⋮ Robust scheduling for flexible processing networks ⋮ A fork-join queueing model: Diffusion approximation, integral representations and asymptotics ⋮ Delay asymptotics and bounds for multitask parallel jobs ⋮ Approximate analysis of a closed fork/join model ⋮ Synchronized queues with deterministic arrivals
This page was built for publication: The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
