Optimization of the fluid model of scheduling: local predictions

09/10/2022
by   Tikhon Bogachev, et al.
0

In this research a continuous model for resource allocations in a queuing system is considered and a local prediction on the system behavior is developed. As a result we obtain a set of possible cases, some of which lead to quite clear optimization problems. Currently, the main result of this research direction is an algorithm delivering an explicit solution to the problem of minimization of the sum of all queues mean delays (which is not the overall mean delay) in the case of the so-called uniform steadiness. Basically, in this case we deal with convex optimization on a polytope.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/16/2020

Convex Optimization on Functionals of Probability Densities

In information theory, some optimization problems result in convex optim...
research
12/03/2021

Push-sum Distributed Dual Averaging for Convex Optimization in Multi-agent Systems with Communication Delays

The distributed convex optimization problem over the multi-agent system ...
research
06/09/2023

Faster Discrete Convex Function Minimization with Predictions: The M-Convex Case

Recent years have seen a growing interest in accelerating optimization a...
research
08/01/2020

Analysis and Optimization of Cache-Enabled Networks with Random DTX Scheme

In this paper, we focus on the meta distribution for the cache-enabled n...
research
10/19/2020

Nearly sharp structured sketching for constrained optimization

In this work, we study a tensor-structured random sketching matrix to pr...
research
08/23/2023

Network Navigation with Online Delays is PSPACE-complete

In public transport networks disruptions may occur and lead to travel de...
research
08/20/2015

AdaDelay: Delay Adaptive Distributed Stochastic Convex Optimization

We study distributed stochastic convex optimization under the delayed gr...

Please sign up or login with your details

Forgot password? Click here to reset