Reducing Response Time in Fork-Join Systems under Heavy Traffic Via Imbalance Control

DOI10.1239/aap/1386857861zbMath1290.60091OpenAlexW1976989328MaRDI QIDQ5396595

Saul C. Leite, Marcelo Dutra Fragoso

Publication date: 31 January 2014

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/aap/1386857861

zbMATH Keywords

diffusion approximationheavy traffic analysisfork-join parallel processing system

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Optimal stochastic control (93E20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mean sojourn times in two-queue fork-join systems: bounds and approximations
• Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
• Existence and uniqueness of semimartingale reflecting Brownian motions in an orthant
• Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
• Heavy traffic resource pooling in parallel-server systems
• Stochastic-Process Limits
• Two Parallel Queues Created by Arrivals with Two Demands I
• Optimal control of assignment of jobs to processors under heavy traffic
• Sojourn times in G/M/1 fork‐join networks

This page was built for publication: Reducing Response Time in Fork-Join Systems under Heavy Traffic Via Imbalance Control