最大亏损优先的效率和最优性：实时的应用的资源分配
Efficiency and Optimality of Largest Deficit First Prioritization: Resource Allocation for Real-Time Applications
摘要：
越来越多的具有计算和/或通信截止日期的实时的【形】应用程序正在共享基础设施上得到支持。这样的应用程序通常可以容忍偶尔的最后期限违反，而不会实质上影响其服务质量（QoS）。在这样的系统中的一个基本问题是决定如何分配共享资源，以满足应用的QoS要求。解决这个问题的一个简单的框架是，（1）动态地优先用户作为他们的赤字可能复杂的函数（实现与所需的QoS的差异），以及（2）分配资源，以加快用户具有较高的优先级。本文重点讨论了一类使用这种基于优先级的资源分配的系统。我们首先描述了一组可行的QoS要求，并显示了最大权重优先级的最优性。然后，我们考虑简单的加权最大赤字第一（W-LDF）优先级的政策，其中具有较高权重的QoS赤字的用户被赋予更高的优先级。本文给出了w-LDF策略下可行集的一个内界，并在一个额外的单调性假设下，刻画了它的几何特征，从而得到了最优性的一个充分条件。此外，还讨论了W-LDF策略的效率比、分层LDF的最优性和故障聚类的特征。
英文摘要：
An increasing number of real-time applications with compute and/or communication deadlines are being supported on shared infrastructure. Such applications can often tolerate occasional deadline violations without substantially impacting their Quality of Service (QoS). A fundamental problem in such systems is deciding how to allocate shared resources so as to meet applications' QoS requirements. A simple framework to address this problem is to, (1) dynamically prioritize users as a possibly complex function of their deficits (difference of achieved vs required QoS), and (2) allocate resources so to expedite users with higher priority. This paper focuses on a general class of systems using such priority-based resource allocation. We first characterize the set of feasible QoS requirements and show the optimality of max weight-like prioritization. We then consider simple weighted Largest Deficit First (w-LDF) prioritization policies, where users with higher weighted QoS deficits are given higher priority. The paper gives an inner bound for the feasible set under w-LDF policies, and, under an additional monotonicity assumption, characterizes its geometry leading to a sufficient condition for optimality. Additional insights on the efficiency ratio of w-LDF policies, the optimality of hierarchical-LDF and characterization of clustering of failures are also discussed.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
