Throughput Scalability Analysis of Fork-Join Queueing Networks

DOI10.1287/opre.2018.1748zbMath1446.90057OpenAlexW2902028526MaRDI QIDQ5131548

Yun Zeng, Augustin Chaintreau, Don Towsley, Cathy H. Xia

Publication date: 8 November 2020

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ba97f888981988a8505c7576e59b2b2b2fe6ead7

zbMATH Keywords

blockinglast passage percolationperformance boundsfork-join queueing networksthroughput scalability

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)

Related Items (2)

Control of Fork-Join Processing Networks with Multiple Job Types and Parallel Shared Resources ⋮ An Overview for Markov Decision Processes in Queues and Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of the minimum cycle mean in a digraph
• Large tandem queueing networks with blocking
• Topological sorting of large networks
• On the stability condition of a precedence-based queueing discipline
• Sharpness: A Tight Condition for Scalability
• Acyclic fork-join queuing networks
• Comparison properties of stochastic decision free Petri nets

This page was built for publication: Throughput Scalability Analysis of Fork-Join Queueing Networks