Capacity Provisioning Motivated Online Non-Convex Optimization Problem with Memory and Switching Cost
arxiv(2024)
摘要
An online non-convex optimization problem is considered where the goal is to
minimize the flow time (total delay) of a set of jobs by modulating the number
of active servers, but with a switching cost associated with changing the
number of active servers over time. Each job can be processed by at most one
fixed speed server at any time. Compared to the usual online convex
optimization (OCO) problem with switching cost, the objective function
considered is non-convex and more importantly, at each time, it depends on all
past decisions and not just the present one. Both worst-case and stochastic
inputs are considered; for both cases, competitive algorithms are derived.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要