.png){kind=icon}
返回
Towards accommodating deadline driven jobs on high performance computing platforms in grid computing environment
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jocs.2021.101439.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Scheduling jobs
Swift gap
Grid computing
Workloads
Deadlines
HPC
期刊
IF:
18.3
论文数:
3.1K
被引数:
4.0K
机构
引用论文
.png){kind=icon}
Hybrid meta-heuristic algorithms for independent job scheduling in grid computing网格计算中独立作业调度的混合元启发式算法
OAAI
OAAI分享收藏Ultra-wideband Hybrid PICA Terahertz Antenna for High-Resolution Biomedical Imaging超宽带混合PICA太赫兹天线用于高分辨率生物医学成像OAAI
OAAI分享收藏Design and Development of Metamaterial Based High Performance Microstrip Antenna基于超材料的性能优化微带天线的设计与开发
PREAI
分享收藏分享收藏
Mathematical programming and solution approaches for minimizing tardiness and transportation costs in the supply chain scheduling problem供应链调度问题中最小化迟到和运输成本的数学规划和求解方法
PREAI
分享收藏A flexible dispatching rule for minimizing tardiness in job shop scheduling一种灵活的调度规则，可最大程度地减少作业车间调度中的迟到
PREAI
分享收藏
查看更多内容