返回
Network-aware task selection to reduce multi-application makespan in cloud
DOI:10.1016/j.jnca.2020.102889.png)
摘要
En 中文
One new metric that plays a vital role in evaluating the cloud service is the multi-application makespan. There are usually multiple applications without a deadline in the cloud, while the makespan of each application should be minimized, such as parallel applications for training neural networks. However, the previous scheduling rule, called moving the computation tasks of applications closer to data, fails to reduce multi-application makespan. Because it is unknown which application the task belongs to, the number of optimized tasks (close-to-data tasks) is unbalanced among multiple applications, which causes a big gap between the makespan of multiple applications. To address this issue, we propose a cooperative scheduler that considers the application-task relationship, whose goal is reducing the multi-application makespan. Firstly, we propose a cost sharing game model to guide the balance of optimized task selection between multiple applications, in which the cost is referred to as the makespan. Specifically, we develop a network-aware method that can accurately estimate the makespan with a given task selection strategy. In the end, we evaluate the cooperative scheduler in the actual Hadoop cluster with diverse network environments. Experimental results demonstrate that the gap between multi-application makespan decreases. Moreover, compared to the baseline schedulers, the longest makespan decreases by 61.5%, and the network traffic is saved by more than 50%.
Keyword:
Task selection
Network
Multiple applications
Makespan
Cost sharing game
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8
论文数:
3.6K
被引数:
1.1W
机构
引用论文
An Optimal Locality-Aware Task Scheduling Algorithm Based on Bipartite Graph Modelling for Spark Applications基于二分图建模的Spark应用位置感知最优任务调度算法

