...
首页> 外文期刊>Concurrency, practice and experience >Co-scheduling of data intensive jobs and processor redistribution under temperature constraints
【24h】

Co-scheduling of data intensive jobs and processor redistribution under temperature constraints

机译:在温度限制下共同调度数据密集型作业和处理器重新分配

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

获取外文期刊封面封底 >>

       

摘要

With the congregation of more and more data intensive computational task in cloud environment, the distributive paradigm of data processing acquire the state of being more cost-sensitive in commercial cloud computing environment. Also, the rise in power density from physical machines and memory systems has caused the development of mechanisms to cater efficient thermal management system. Owing to the reactive nature, these methods usually suffer from poor predictability; hence, there lies a dearth of availability of such mechanism to efficiently co-schedule data intensive jobs and thermal management of physical computational cores in order to establish a workflow which guarantee in managing scheduling operations under time critical situations and thermal constraints. In this study, we present a reinforcement learning inspired heuristic reduction to co-schedule such operations in near real-time scenario. While this problem is, in general sense, corresponding to NP-Hard problem, but the pluggable co-scheduler so presented in this study can provide significant savings in affordable computational time under temperature constraints.
机译:随着云环境中越来越多的数据密集型计算任务的聚集,数据处理的分布式范例在商业云计算环境中获得了对成本更加敏感的状态。而且,物理机器和存储系统的功率密度的上升已经引起了满足高效热管理系统的机制的发展。由于反应性,这些方法通常具有较差的可预测性。因此,缺乏这样一种机制来有效地共同调度数据密集型作业和物理计算核心的热管理,以建立一种保证在时间紧迫的情况和热约束下管理调度操作的工作流程的可用性。在这项研究中,我们提出了一种强化学习启发式启发式归约方法,以在近实时场景中共同安排此类操作。虽然从一般意义上讲,此问题与NP-Hard问题相对应,但是在此研究中如此提出的可插拔协同调度程序可以在温度限制下显着节省可负担的计算时间。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号