An Optimal Locality-Aware Task Scheduling Algorithm Based on Bipartite Graph Modelling for Spark Applications.

IEEE Transactions on Parallel and Distributed Systems(2020)

引用 29|浏览12
暂无评分
摘要
In the distributed computing framework of Spark, cross-node/rack data transfer produced by map tasks and reduce tasks are common problems resulting in performance degradation, such as prolonging of entire execution time and network congestion. To address these problems, this article utilizes the bipartite graph modelling to propose an optimal locality-aware task scheduling algorithm. By considerin...
更多
查看译文
关键词
Task analysis,Optimal scheduling,Sparks,Scheduling,Scheduling algorithms,Data transfer
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要