SearcharxivSearch

arXiv subjects

Evgeny Shindin

Publications and source records attributed to Evgeny Shindin.

8 recordsLinked to original sources

WVA: A Global Optimization Control Plane for llmd

As Large Language Models (LLMs) scale to handle massive concurrent traffic, optimizing the infrastructure required for inference has become a primary challenge. To manage the high cost of GPU resources while ensuring strict service-level objectives (SLOs), operators increasingly deploy models across heterogeneous hardware clusters that multiplex latency-sensitive online requests and throughput-oriented offline requests. However, traditional resource-centric autoscalers like the Kubernetes horizontal pod autoscaler (HPA) do not consider application-specific SLOs, hardware heterogeneity, or internal engine state (like KV cache utilization) globally. This leads to unnecessary scaling, severe resource underutilization, and disrupted stateful inference. To address these limitations, we introduce the Workload Variant Autoscaler (WVA), a specialized control plane co-designed with \texttt{llmd} that tightly couples scaling decisions with the inference server's internal saturation state. By utilizing proactive headroom-based scaling and fragmentation-aware scale-down, our experiments demonstrate that WVA achieves a \textbf{37\% improvement in effective throughput} and a \textbf{10x reduction in request failures} compared to HPA. Furthermore, WVA's cost-aware tiering intrinsically reduces overall power consumption by prioritizing lower-cost, energy-efficient hardware variants over homogeneous scaling on high-end accelerators.

cs.ET

SCLP-Simplex Algorithm for Robust Fluid Processing Networks

Fluid models provide a tractable approach to approximate multiclass processing networks. This tractability is a due to the fact that optimal control for such models is a solution of a Separated Continuous Linear Programming (SCLP) problem. Recently developed revised SCLP-simplex algorithm allows to exactly solve very large instances of SCLPs in a reasonable time. Furthermore, to deal with the inherent stochasticity in arrival and service rates in processing networks, robust optimization approach is applied to SCLP models. However, a robust counterpart of SCLP problem has two important drawbacks limiting its tractability. First, the robust counterpart of SCLP problem is a huge SCLP problem itself, that can be in several orders of magnitude bigger then the nominal SCLP problem. Second, robust counterpart of SCLP is a degenerate optimization problem, that is not suitable for revised SCLP-simplex algorithm. In this paper we develop theoretical results and a corresponding algorithm that allows to preserve dimensions of nominal SCLP problem and avoid degeneracy issues during solution of its robust counterpart.

math.OC

Optimizing simultaneous autoscaling for serverless cloud computing

This paper explores resource allocation in serverless cloud computing platforms and proposes an optimization approach for autoscaling systems. Serverless computing relieves users from resource management tasks, enabling focus on application functions. However, dynamic resource allocation and function replication based on changing loads remain crucial. Typically, autoscalers in these platforms utilize threshold-based mechanisms to adjust function replicas independently. We model applications as interconnected graphs of functions, where requests probabilistically traverse the graph, triggering associated function execution. Our objective is to develop a control policy that optimally allocates resources on servers, minimizing failed requests and response time in reaction to load changes. Using a fluid approximation model and Separated Continuous Linear Programming (SCLP), we derive an optimal control policy that determines the number of resources per replica and the required number of replicas over time. We evaluate our approach using a simulation framework built with Python and simpy. Comparing against threshold-based autoscaling, our approach demonstrates significant improvements in average response times and failed requests, ranging from 15% to over 300% in most cases. We also explore the impact of system and workload parameters on performance, providing insights into the behavior of our optimization approach under different conditions. Overall, our study contributes to advancing resource allocation strategies, enhancing efficiency and reliability in serverless cloud computing platforms.

cs.DC

A Robust Server-Effort Policy for Fluid Processing Networks

Multi-Class Processing Networks describe a set of servers that perform multiple classes of jobs on different items. A useful and tractable way to find an optimal control for such a network is to approximate it by a fluid model, resulting in a Separated Continuous Linear Programming (SCLP) problem. Clearly, arrival and service rates in such systems suffer from inherent uncertainty. A recent study addressed this issue by formulating a Robust Counterpart for SCLP models with budgeted uncertainty which provides a solution in terms of processing rates. This solution is transformed into a sequencing policy. However, in cases where servers can process several jobs simultaneously, a sequencing policy cannot be implemented. In this paper, we propose to use in these cases a a resource allocation policy, namely, the proportion of server effort per class. We formulate Robust Counterparts of both processing rates and server-effort uncertain models for four types of uncertainty sets: box, budgeted, one-sided budgeted, and polyhedral. We prove that server-effort model provides a better robust solution than any algebraic transformation of the robust solution of the processing rates model. Finally, to get a grasp of how much our new model improves over the processing rates robust model, we provide results of some numerical experiments.

math.OC

Revised SCLP-simplex Algorithm with Application to Large-Scale Fluid Processing Networks

We describe an efficient implementation of a recent simplex-type algorithm for the exact solution of separated continuous linear programs, and compare it with linear programming approximation of these problems obtained via discretization of the time horizon. The implementation overcomes many numerical pitfalls often neglected in theoretical analysis allowing better accuracy or acceleration up to several orders of magnitude both versus previous implementation of the simplex-type algorithms and versus a state-of-the-art LP solver using discretization. Numerical study includes medium, large, and very large examples of scheduling problems and problems of control of fluid processing networks. We discuss online and offline optimization settings for various applications and outline future research directions.

math.OC

A simplex-type algorithm for continuous linear programs with constant coefficients

We consider continuous linear programs over a continuous finite time horizon $T$, with a constant coefficient matrix, linear right hand side functions and linear cost coefficient functions, where we search for optimal solutions in the space of measures or of functions of bounded variation. These models generalize the separated continuous linear programming models and their various duals, as formulated in the past by Anderson, by Pullan, and by Weiss. In previous papers we have shown that these problems possess optimal strongly dual solutions. We also have presented a detailed description of optimal solutions and have defined a combinatorial analogue to basic solutions of standard LP. In this paper we present an algorithm which solves this class of problems in a finite bounded number of steps, using an analogue of the simplex method, in the space of measures.

math.OC

Structure of Solutions for Continuous Linear Programs with Constant Coefficients

We consider Continuous Linear Programs over a continuous finite time horizon $T$, with linear cost coefficient functions, linear right hand side functions, and a constant coefficient matrix, as well as their symmetric dual. We search for optimal solutions in the space of measures or of functions of bounded variation. These models generalize the Separated Continuous Linear Programming models and their various duals, as formulated in the past by Anderson, by Pullan, and by Weiss. In a recent paper we have shown that under a Slater type condition, these problems possess optimal strongly dual solutions. In this paper we give a detailed description of optimal solutions and define a combinatorial analog to basic solutions of standard LP. We also show that feasibility implies existence of strongly dual optimal solutions without requiring the Slater condition. We present several examples to illustrate the richness and complexity of these solutions.

math.OC

Symmetric Strong Duality for a Class of Continuous Linear Programs with Constant Coefficients

We consider Continuous Linear Programs over a continuous finite time horizon $T$, with linear cost coefficient functions and linear right hand side functions and a constant coefficient matrix, where we search for optimal solutions in the space of measures or of functions of bounded variation. These models generalize the Separated Continuous Linear Programming models and their various duals, as formulated in the past by Anderson, by Pullan, and by Weiss. We present simple necessary and sufficient conditions for feasibility. We formulate a symmetric dual and investigate strong duality by considering discrete time approximations. We prove that under a Slater type condition there is no duality gap and there exist optimal solutions which have impulse controls at $0$ and $T$ and have piecewise constant densities in $(0,T)$. Moreover, we show that under non-degeneracy assumptions all optimal solutions are of this form, and are uniquely determined over $(0,T)$.

math.OC