The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds

DOI10.2307/1427640zbMATH Open0681.60096OpenAlexW2329656816MaRDI QIDQ4730587FDOQ4730587

Authors: Francois Baccelli, Armand M. Makowski, Adam Shwartz 

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

Recommendations

• Analysis of the fork-join queue
• Stochastic bounds in Fork-Join queueing systems under full and partial mapping
• Mean sojourn times in two-queue fork-join systems: bounds and approximations
• Acyclic fork-join queuing networks
• On the dependence structure and bounds of correlated parallel queues and their applications to synchronized stochastic systems

zbMATH Keywords

stochastic orderingqueueing systemstochastic boundsincreasing convex orderingtransient and steady-state regimes

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25)

Cited In (31)

• Analysis of the fork-join queue
• Acyclic fork-join queuing networks
• A fork-join queueing model: Diffusion approximation, integral representations and asymptotics
• Gaussian limits for a fork-join network with nonexchangeable synchronization in heavy traffic
• A generalized stochastic Petri-net model for performance analysis and allocation optimization of a particular repair system
• Estimating the throughput of a cyclic assembly system
• Moments and tails in monotone-separable stochastic networks.
• Scheduling parallel processors: Structural properties and optimal policies
• Title not available (Why is that?)
• ON THE PROBABILITY DISTRIBUTION OF JOIN QUEUE LENGTH IN A FORK-JOIN MODEL
• Controlling variability in split-merge systems and its impact on performance
• Performance evaluation of fork and join synchronization primitives
• Open problems in queueing theory inspired by datacenter computing
• Characterization of the departure process in a closed fork-join synchronization network
• Queues and risk models with simultaneous arrivals
• Stochastic comparisons for fork-join queues with exponential processing times
• Approximate analysis of a closed fork/join model
• Fork-join and redundancy systems with heavy-tailed job sizes
• Minimizing makespan of stochastic customer orders in cellular manufacturing systems with parallel machines
• Queueing with redundant requests: exact analysis
• Stochastic bounds in Fork-Join queueing systems under full and partial mapping
• Mean sojourn times in two-queue fork-join systems: bounds and approximations
• Robust scheduling for flexible processing networks
• Delay asymptotics and bounds for multitask parallel jobs
• On the dependence structure and bounds of correlated parallel queues and their applications to synchronized stochastic systems
• Generalized parallel-server fork-join queues with dynamic task scheduling
• Sojourn times in G/M/1 fork-join networks
• Performance of static priority rules for shared facilities in a remanufacturing shop with disassembly and reassembly
• Structured buffer-allocation problems
• Synchronized queues with deterministic arrivals
• Response times in M/M/s fork-join networks

This page was built for publication: The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds

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