.png){kind=icon}
返回
A load balance oriented cost efficient scheduling method for parallel tasks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jnca.2016.12.032.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
With the development of Internet technology, distributed task processing has become the key to solve the problems in big data computing, cloud computing, and collaborative computing. At the aspect of distributed task scheduling optimization, it is needed to establish the scheduling architecture with multiple schedulers, to meet the requirement of minimizing the cost of large scale parallel tasks. However the schedulers would give rise to the issue of high device load, intensive resource competition, and the inefficient collaboration. For this, we proposed the CESM (Cost Efficient Scheduling Method) method, which utilizes the weighted random schedule policy to assign the devices to the tasks, to reduce the competition of the task on the efficient low-cost devices. The weights in the random schedule process dependent on the scheduling environment, such as communication time, the busy state, the execution time and the cost. The efficient low-cost device tends to get a higher weight, implying it has a higher possibility to be assigned. That makes the scheduling results have a better rationality on execution time and cost. For this reason, we designed the weight model based on the communication time, the busy state, the execution time and the cost, and adopted the experimental method to analyze the values of the parameters. Finally, we gave four experiments on the arrival time test, device dependence test, task structure test, device set test, respectively, to verify the effectiveness and rationality of the proposed CESM.
Keyword:
Load balance
Scheduling method
Multiple schedulers
Execution cost
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8
论文数:
3.6K
被引数:
1.1W
机构
引用论文
Clear, crashing, turbid and back – long‐term changes in macrophyte assemblages in a shallow lake
OAAI
.png){kind=icon}
OAAI分享收藏
Performance-effective and low-complexity task scheduling for heterogeneous computing面向异构计算的高性能低复杂度任务调度
PREAI
分享收藏
查看更多内容