.png){kind=icon}
返回
Efficient real-time divisible load scheduling
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2012.09.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Providing QoS and performance guarantees to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. While progress is being made in scheduling arbitrarily divisible loads, current approaches are not efficient and do not scale well. In this paper, we propose a linear algorithm for real-time divisible load scheduling. Unlike existing approaches, the new algorithm relaxes the tight coupling between the task admission controller and the task dispatcher. By eliminating the need to generate exact schedules in the admission controller, the algorithm avoids high overheads. We also proposed a hybrid algorithm that combines the best of our efficient algorithm and a previously best-known approach. We experimentally evaluate the new algorithm. Simulation results demonstrate that the algorithm scales well, can schedule large numbers of tasks efficiently, and performs similarly to existing approaches in terms of providing real-time guarantees. (c) 2012 Elsevier Inc. All rights reserved.
Keyword:
Arbitrarily divisible loads
Real-time computing
Scheduling efficiency
Cluster computing
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
.png){kind=icon}
Evidence for a cytoplasmic pathway of oxalate biosynthesis in Aspergillus niger黑曲霉中草酸盐生物合成的细胞质途径的证据
OAAI
OAAI分享收藏
查看更多内容