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

DOI10.1239/AAP/1386857861MaRDI QIDQ5396595zbMATH OpenOpenAlexFDO

Authors 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 approximationfork-join parallel processing systemheavy traffic analysis

Mathematics Subject Classification ID

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

Recommendations

• Dynamic control of the join-queue lengths in saturated fork-join stations
• Response times in M/M/s fork-join networks
• Fork-join and redundancy systems with heavy-tailed job sizes
• Dynamic load balancing in parallel queueing systems: stability and optimal control
• A load balancing system in the many-server heavy-traffic asymptotics
• Control and recovery from rare congestion events in a large multi-server system
• Throughput scalability analysis of fork-join queueing networks
• Performability Analysis of Fork-join Queueing Systems

Cites work

• Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
• Existence and uniqueness of semimartingale reflecting Brownian motions in an orthant
• Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
• Heavy traffic resource pooling in parallel-server systems
• scientific article; zbMATH DE number 1631027 (Why is no real title available?)
• scientific article; zbMATH DE number 43057 (Why is no real title available?)
• scientific article; zbMATH DE number 53999 (Why is no real title available?)
• scientific article; zbMATH DE number 1354815 (Why is no real title available?)
• scientific article; zbMATH DE number 850352 (Why is no real title available?)
• scientific article; zbMATH DE number 3322598 (Why is no real title available?)
• scientific article; zbMATH DE number 3185400 (Why is no real title available?)
• Mean sojourn times in two-queue fork-join systems: bounds and approximations
• On dynamic scheduling of a parallel server system with complete resource pooling
• Optimal control of assignment of jobs to processors under heavy traffic
• Sojourn times in G/M/1 fork-join networks
• Stochastic-Process Limits
• Two Parallel Queues Created by Arrivals with Two Demands I

Cited in

(3)

• Redundancy scheduling with scaled Bernoulli service requirements
• Redundancy-\(\mathbf{d}\): the power of \(\mathbf{d}\) choices for redundancy
• Optimal allocation of servers and processing time in a load balancing system

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

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