【24h】

Resource Allocation with Stochastic Demands

机译:具有随机需求的资源分配

获取原文
获取原文并翻译 | 示例

摘要

Resources in modern computer systems include not only CPU, but also memory, hard disk, bandwidth, etc. To serve multiple users simultaneously, we need to satisfy their requirements in all resource dimensions. Meanwhile, their demands follow a certain distribution and may change over time. Our goal is then to admit as many users as possible to the system without violating the resource capacity more often than a predefined overflow probability. In this paper, we study the problem of allocating multiple resources among a group of users/tasks with stochastic demands. We model it as a stochastic multi-dimensional knapsack problem. We extend and apply the concept of effective bandwidth in order to solve this problem efficiently. Via numerical experiments, we show that our algorithms achieve near-optimal performance with specified overflow probability.
机译:现代计算机系统中的资源不仅包括CPU,还包括内存,硬盘,带宽等。要同时为多个用户提供服务,我们需要在所有资源维度上满足他们的要求。同时,他们的需求遵循一定的分布,并可能随时间变化。然后,我们的目标是允许尽可能多的用户进入系统,而不会比预定义的溢出概率更频繁地破坏资源容量。在本文中,我们研究了在具有随机需求的一组用户/任务之间分配多种资源的问题。我们将其建模为随机多维背包问题。为了有效解决此问题,我们扩展并应用了有效带宽的概念。通过数值实验,我们证明了我们的算法在指定的溢出概率下达到了近乎最佳的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号