• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Efficient Data Center Flow Scheduling Without Starvation Using Expansion Ratio
【24h】

Efficient Data Center Flow Scheduling Without Starvation Using Expansion Ratio

机译：使用扩展比率的无饥饿高效数据中心流调度

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Existing data center transport protocols are usually based on the Processor Sharing (PS) policy and/or the Shortest Remaining Processing Time (SRPT) policy. PS divides link bandwidth equally between competing flows, thus it fails to achieve optimal average flow completion time (FCT). SRPT prioritizes flows that have the shortest remaining processing time and provides near-optimal average FCT, but it may cause long flows to suffer unfair delays, or even starve them. In fact, these two types of policies represent two directions in the design space: PS prefers fairness (in terms of starvation freedom) while SRPT favors efficiency (in terms of average FCT). In this paper, we propose a novel metric, expansion ratio, which enables us to strike a balance between SRPT and PS. We design MERP that achieves efficient flow scheduling without starvation. MERP takes care of both average and tail FCTs by minimizing the expansion ratio of competing flows in a lexicographically manner. MERP controls the sending rate of competing flows via synchronized virtual deadlines and routes flows in a downstream-aware manner that reacts quickly to link failures. We evaluate MERP using extensive NS2-based simulations. Results show that, under various traffic loads, MERP reduces the tail FCT significantly with a negligible increase of average FCT compared with pFabric, and MERP reduces the average FCT notably compared with ECMP and CONGA when link failures occur.
机译：现有的数据中心传输协议通常基于处理器共享（PS）策略和/或最短剩余处理时间（SRPT）策略。 PS在竞争流之间平均分配链路带宽，因此无法实现最佳平均流完成时间（FCT）。 SRPT优先处理剩余处理时间最短的流，并提供接近最佳的平均FCT，但它可能导致长流遭受不公平的延迟，甚至使它们饿死。实际上，这两种类型的策略代表了设计空间中的两个方向：PS偏爱公平（就饥饿自由而言），而SRPT偏爱效率（就平均FCT而言）。在本文中，我们提出了一种新颖的指标，扩展率，使我们能够在SRPT和PS之间取得平衡。我们设计的MERP可以实现高效的流量调度而不会出现饥饿。 MERP通过按词典顺序最小化竞争流的扩展率来处理平均FCT和尾部FCT。 MERP通过同步的虚拟截止期限来控制竞争流的发送速率，并以下游感知的方式路由流，从而对链路故障做出快速反应。我们使用广泛的基于NS2的模拟评估MERP。结果表明，在各种流量负载下，与pFabric相比，MERP显着降低了尾部FCT，而平均FCT却可忽略不计；当发生链路故障时，与ECMP和CONGA相比，MERP显着降低了平均FCT。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号