On the control of fork-join networks
From MaRDI portal
Publication:5219729
Abstract: Networks in which the processing of jobs occurs both sequentially and in parallel are prevalent in many application domains, such as computer systems, healthcare, manufacturing, and project management. The parallel processing of jobs gives rise to synchronization constraints that can be a main reason for job delay. In comparison with feedforward queueing networks that have only sequential processing of jobs, the approximation and control of networks that have synchronization constraints is less understood. One well-known modeling framework in which synchronization constraints are prominent is the fork-join processing network. Our objective is to find scheduling rules for fork-join processing networks with multiple job types in which there is first a fork operation, then activities that can be performed in parallel, and then a join operation. The difficulty is that some of the activities that can be performed in parallel require a shared resource. We solve the scheduling problem for that shared server (that is, which type of job to prioritize each time the server becomes available) when that server is in heavy traffic and prove an asymptotic optimality result.
Recommendations
- Control of fork-join processing networks with multiple job types and parallel shared resources
- Heavy-traffic limits for a fork-join networkin the Halfin-Whitt regime
- On the optimal control of parallel processing networks with resource collaboration and multitasking
- Analysis of the fork-join queue
- Gaussian limits for a fork-join network with nonexchangeable synchronization in heavy traffic
Cites work
- An invariance principle for semimartingale reflecting Brownian motions in an orthant
- Asymptotic optimality of maximum pressure policies in stochastic processing networks
- Continuous-review tracking policies for dynamic control of stochastic networks
- Correction: Brownian models of open processing networks: canonical representation of workload
- Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- Dynamic scheduling of a two-server parallel server system with complete resource pooling and reneging in heavy traffic: asymptotic optimality of a two-threshold policy
- From Project to Process Management: An Empirically-Based Framework for Analyzing Product Development Time
- Gaussian limits for a fork-join network with nonexchangeable synchronization in heavy traffic
- Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
- Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies
- Heavy traffic resource pooling in parallel-server systems
- Heavy-traffic limits for a fork-join networkin the Halfin-Whitt regime
- Heavy-traffic limits for an infinite-server fork-join queueing system with dependent and disruptive services
- scientific article; zbMATH DE number 1631026 (Why is no real title available?)
- scientific article; zbMATH DE number 1354815 (Why is no real title available?)
- scientific article; zbMATH DE number 932423 (Why is no real title available?)
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Manufacturing flow line systems: A review of models and analytical results
- On patient flow in hospitals: a data-based queueing-science perspective
- On the dynamic control of matching queues
- Processing networks with parallel and sequential tasks: Heavy traffic analysis and Brownian limits
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
- Sequencing and Routing in Multiclass Queueing Networks Part II: Workload Relaxations
- Some Useful Functions for Functional Limit Theorems
- Stochastic discrete flow networks: Diffusion approximations and bottlenecks
- Stochastic-Process Limits
- The trouble with diversity: Fork-join networks with heterogeneous customer population
Cited in
(8)- The trouble with diversity: Fork-join networks with heterogeneous customer population
- On the asymptotic optimality of the \(c\mu\)-rule in queueing networks
- Heavy-traffic limits for an infinite-server fork-join queueing system with dependent and disruptive services
- Gaussian limits for a fork-join network with nonexchangeable synchronization in heavy traffic
- Heavy-traffic limits for a fork-join networkin the Halfin-Whitt regime
- On the optimal control of parallel processing networks with resource collaboration and multitasking
- Control of fork-join processing networks with multiple job types and parallel shared resources
- Admission control of parallel queues with fork types of jobs
This page was built for publication: On the control of fork-join networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5219729)
