首页> 外文会议>International workshop on job scheduling strategies for parallel processing >Choosing Optimal Maintenance Time for Stateless Data-Processing Clusters A Case Study of Hadoop Cluster
【24h】

Choosing Optimal Maintenance Time for Stateless Data-Processing Clusters A Case Study of Hadoop Cluster

机译:为无状态数据处理集群选择最佳维护时间—以Hadoop集群为例

获取原文

摘要

Stateless clusters such as Hadoop clusters are widely deployed to drive the business data analysis. When a cluster needs to be restarted for cluster-wide maintenance, it is desired for the administrators to choose a maintenance window that results in: (1) least disturbance to the cluster operation; and (2) maximized job processing throughput. A straightforward but naive approach is to choose maintenance time that has the least number of running jobs, but such an approach is suboptimal. In this work, we use Hadoop as an use case and propose to determine the optimal cluster maintenance time based on the accumulated job progress, as opposed the number of running jobs. The approach can maximize the job throughput of a stateless cluster by minimizing the amount of lost works due to maintenance. Compared to the straightforward approach, the proposed approach can save up to 50% of wasted cluster resources caused by maintenance according to production cluster traces.
机译:诸如Hadoop集群之类的无状态集群被广泛部署以驱动业务数据分析。当需要重新启动集群以进行集群范围的维护时,管理员需要选择一个维护窗口,该窗口将导致:(1)对集群操作的干扰最小; (2)使作业处理吞吐量最大化。一种简单但幼稚的方法是选择运行作业数量最少的维护时间,但是这种方法不是最佳的。在这项工作中,我们将Hadoop作为用例,并建议根据累积的作业进度(而不是正在运行的作业数)来确定最佳的集群维护时间。通过最小化由于维护而造成的工作损失量,该方法可以最大化无状态群集的工作吞吐量。与直接方法相比,根据生产集群跟踪,所提出的方法最多可以节省50%的维护造成的集群资源浪费。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号