首页> 外文期刊>Journal of computational science >Towards accommodating deadline driven jobs on high performance computing platforms in grid computing environment
【24h】

Towards accommodating deadline driven jobs on high performance computing platforms in grid computing environment

机译:在网格计算环境中适应高性能计算平台上的截止日期驱动工作

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

摘要

Grid computing is a connected computing infrastructure that furnishes reliable, stable, ubiquitous, and economic access to high-end computational power. The dynamic nature of the grid brings several challenges to scheduling algorithms that operate in queuing-based scheduling approach. This approach typically performs scheduling based on a certain fixed priority which leads to increase the delay for the running applications. Thus, the overall performance will be deteriorated sharply. The main aim of this study is to minimize the delay in the scheduler for the dynamic jobs. Therefore, this paper tackles dynamic scheduling issues by proposing Swift Gap (SG) mechanism. SG comprises of two stages by applying two mechanisms: A Backfilling Mechanism and Metaheuristic Local Search Optimization Mechanism. In the first stage, the job is placed in the earliest gap available in the local resources' schedules, while the second stage optimizes the performance by checking all available gaps among resources' schedules to find a better gap to place the job in. To further improve the performance, the Completion Time Scheme (CTS) is developed. CTS reduces the delay by placing the job in the gap that guarantees the best start time for the job, and the fastest resource available. The integration between SG and CTS (SG-CTS) is achieved by applying best start time rule in the first stage only, whereas the second stage includes both rules.SGCTS is evaluated through simulation by using real workloads that reflect a real grid system environment. The findings demonstrate that SG-CTS improves the slowdown by 27 %, bounded slowdown by 25 %, tardiness by 21 %, waiting time by 16 % and response time by 7% compared to Conservative backfilling mechanism followed by Gap Search (CONS-GS). Finally, SG-CTS is evaluated against Deadline-Based Backfilling (DBF) algorithm. The evaluation revealed that SG-CTS performs better than DBF for slowdown and waiting time in HPC2N workload.
机译:网格计算是一种连接的计算基础设施,提供对高端计算能力的可靠,稳定,无处不在的和经济的访问。电网的动态性质为在基于排队的调度方法中运行的调度算法带来了几个挑战。该方法通常基于某个固定优先级执行调度,这导致增加运行应用程序的延迟。因此,整体性能将急剧恶化。本研究的主要目的是最大限度地减少动态作业调度程序的延迟。因此,本文通过提出SWIFT间隙(SG)机制来解决动态调度问题。 SG通过应用两个机制包括两个阶段:回填机制和成群质区本地搜索优化机制。在第一阶段,作业被放置在本地资源计划中可用的最早缺口中,而第二阶段通过检查资源计划中的所有可用间隙来优化性能,以找到更好的差距来放置工作。进一步提高性能,开发完成时间方案(CTS)。 CTS通过将作业放在差距中来减少延迟,以保证作业的最佳开始时间,以及可用的最快资源。通过仅在第一阶段应用最佳的开始时间规则,实现了SG和CTS(SG-CTS)之间的集成,而第二阶段包括通过使用反映实际网格系统环境的实际工作负载来通过仿真进行评估。结果表明,与保守回填机制相比,SG-CTS将21%,狭窄的减速将25%,狭窄的放缓,达到速度,降低,响应时间达到7%,与节能回填机制相比,差距搜索(CONS-GS) 。最后,评估SG-CTS以防止基于截止日期的回填(DBF)算法。评估揭示了SG-CTS在HPC2N工作量中的放缓和等待时间更好地执行DBF。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号