On the optimal control of parallel processing networks with resource collaboration and multitasking

DOI10.1287/STSY.2021.0075zbMATH Open1492.90028arXiv2012.13708OpenAlexW3184303008MaRDI QIDQ5084491FDOQ5084491

Authors: Erhun Özkan 

Publication date: 24 June 2022

Published in: Stochastic Systems (Search for Journal in Brave)

Abstract: We study scheduling control of parallel processing networks in which some resources need to simultaneously collaborate to perform some activities and some resources multitask. Resource collaboration and multitasking give rise to synchronization constraints in resource scheduling when the resources are not divisible, that is, when the resources cannot be split. The synchronization constraints affect the system performance significantly. For example, because of those constraints, the system capacity can be strictly less than the capacity of the bottleneck resource. Furthermore, the resource scheduling decisions are not trivial under those constraints. For example, not all static prioritization policies retain the maximum system capacity and the ones that retain the maximum system capacity do not necessarily minimize the delay (or in general the holding cost). We study optimal scheduling control of a class of parallel networks and propose a dynamic prioritization policy that retains the maximum system capacity and is asymptotically optimal in diffusion scale and conventional heavy-traffic regime with respect to the expected discounted total holding cost objective.

Full work available at URL: https://arxiv.org/abs/2012.13708

Recommendations

• On the control of fork-join networks
• Control of fork-join processing networks with multiple job types and parallel shared resources
• Optimal dynamic scheduling of a general class of parallel-processing queueing systems
• Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: asymptotic optimality of a threshold policy
• Optimal control of multiclass parallel service systems

zbMATH Keywords

asymptotic optimalityscheduling controlmultitaskingindivisible resourcesresource collaboration

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Queues and service in operations research (90B22) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Markov and semi-Markov decision processes (90C40) Stochastic scheduling theory in operations research (90B36)

Cites Work

• Title not available (Why is that?)
• Stochastic-Process Limits
• Title not available (Why is that?)
• Title not available (Why is that?)
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
• Optimal queue-size scaling in switched networks
• Sequencing and Routing in Multiclass Queueing Networks Part II: Workload Relaxations
• An invariance principle for 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
• Title not available (Why is that?)
• Brownian models of open processing networks: Canonical representation of workload.
• Maximum Pressure Policies in Stochastic Processing Networks
• A unified numerical scheme for linear-quadratic optimal control problems with joint control and state constraints
• Optimal control of a queueing system with simultaneous service requirements
• Continuous-review tracking policies for dynamic control of stochastic networks
• Resource sharing networks: Overview and an open problem
• Dynamic scheduling for parallel server systems in heavy traffic: Graphical structure, decoupled workload matrix and some sufficient conditions for solvability of the Brownian control problem
• On the Control of Fork-Join Networks
• Control Policies Approaching Hierarchical Greedy Ideal Performance in Heavy Traffic for Resource Sharing Networks

This page was built for publication: On the optimal control of parallel processing networks with resource collaboration and multitasking

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