【24h】

Network Speed Scaling

机译:网络速度缩放

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

摘要

Speed scaling for a network of servers represented by a directed acyclic graph is considered. Jobs arrive at a source server, with a specified destination server, and are defined to be complete once they are processed by all servers on any feasible path between the source and the corresponding destination. Each server has variable speed, with power consumption function P, a convex increasing function of the speed. The objective is to minimize the sum of the flow time (summed across jobs) and the energy consumed by all the servers, which depends on how jobs are routed, as well as how server speeds are set. Algorithms are derived for both the worst case and stochastic job arrivals setting, whose competitive ratio depends only on the power functions and path diversity in the network, but is independent of the workload.
机译:考虑由定向非循环图表表示的服务器网络的速度缩放。作业到达源服务器,使用指定的目标服务器,并定义为在源和相应目标之间的任何可行路径上处理它们的所有服务器上的所有服务器处理。每台服务器都具有可变速度,具有功耗函数p,速度升高的速度。目标是最小化流动时间(跨工作阶段的总和)和所有服务器消耗的能量,这取决于作业的路由方式,以及如何设置服务器速度。为最坏情况和随机作业到达算法设置的算法,其竞争比率仅取决于网络中的功率函数和路径分集,而是独立于工作负载。

著录项

  • 来源
    《Performance evaluation review》 |2020年第3期|61-62|共2页
  • 作者

    Rahul Vaze; Jayakrishnan Nair;

  • 作者单位

    School of Technology and Computer Science Tata Institute of Fundamental Research;

    Department of Electrical Engineering IIT Bombay;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号