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

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)

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.

Recommendations

Cites work

Cited in

(4)

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)