arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1112.1229math.OCcs.DScs.SYeess.SY
收藏

关于独立、对称和时间敏感任务的最优调度

On the Optimal Scheduling of Independent, Symmetric and Time-Sensitive Tasks

Politecnico di Milano(米兰理工大学);New Jersey Institute of Technology(新泽西理工学院)

Fabio Iannello, Osvaldo Simeone, Umberto Spagnolini

AI总结:

针对中央控制器无法直接获取任务队列状态且任务具有时间敏感性的调度问题,通过马尔可夫建模转化为RMAB问题,证明了容量为1时贪婪策略(即Whittle指数策略)的最优性,并分析了任意容量下贪婪策略的性能上界。

摘要:

考虑一个离散时间系统,其中中央控制器(CC)负责在每个时间间隔(或时隙)将K个资源(或服务器)分配给M≥K个节点中的K个。当分配到一个服务器时,节点可以执行一个任务。任务由每个节点通过随机对称且无记忆的随机过程独立生成,并存储在有限容量的任务队列中。此外,任务具有时间敏感性,即在每个时隙内,任务有非零概率在调度之前过期。调度问题的目标是在CC无法直接访问任务队列状态的假设下,最大化随时间完成的任务数量(或任务吞吐量)。CC的调度决策基于先前调度命令的结果以及任务生成和过期过程的已知统计特性。基于任务生成和过期过程的马尔可夫建模,CC调度问题被表述为一个部分可观测马尔可夫决策过程(POMDP),该过程可以纳入多臂赌博机(RMAB)问题的框架中。当任务队列容量为1时,证明了近视(或贪婪)策略的最优性。还证明了该策略与Whittle指数策略一致。对于任意容量的任务队列,近视策略通常是次优的,其性能与通过松弛原始问题获得的上界进行了比较。总体而言,本文的设置提供了一个罕见的例子,其中RMAB问题可以显式求解,并且Whittle指数策略被证明是最优的。

英文摘要:

Consider a discrete-time system in which a centralized controller (CC) is tasked with assigning at each time interval (or slot) K resources (or servers) to K out of M>=K nodes. When assigned a server, a node can execute a task. The tasks are independently generated at each node by stochastically symmetric and memoryless random processes and stored in a finite-capacity task queue. Moreover, they are time-sensitive in the sense that within each slot there is a non-zero probability that a task expires before being scheduled. The scheduling problem is tackled with the aim of maximizing the number of tasks completed over time (or the task-throughput) under the assumption that the CC has no direct access to the state of the task queues. The scheduling decisions at the CC are based on the outcomes of previous scheduling commands, and on the known statistical properties of the task generation and expiration processes. Based on a Markovian modeling of the task generation and expiration processes, the CC scheduling problem is formulated as a partially observable Markov decision process (POMDP) that can be cast into the framework of restless multi-armed bandit (RMAB) problems. When the task queues are of capacity one, the optimality of a myopic (or greedy) policy is proved. It is also demonstrated that the MP coincides with the Whittle index policy. For task queues of arbitrary capacity instead, the myopic policy is generally suboptimal, and its performance is compared with an upper bound obtained through a relaxation of the original problem. Overall, the settings in this paper provide a rare example where a RMAB problem can be explicitly solved, and in which the Whittle index policy is proved to be optimal.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑