您的位置:网站首页 > 《中文科技期刊数据库》 > 工程技术 > 自动化计算机 > 摘要

Degree-of-Node Task Scheduling of Fine-Grained Parallel Programs on Heterogeneous Systems

《计算机科学技术学报:英文版》2019年 第5期 | Han Lin Ming-Fan Li Cheng-Fan Jia Jun-Nan Liu Hong An   School of Computer Science and Technology University of Science and Technology of China Hefei 230026 China
购物车 | ★ 收藏 | 分享
论文服务:
摘 要:Processor specialization has become the development trend of modern processor industry. It is quite possible that this will still be the main-stream in the next decades of semiconductor era. As the diversity of heterogeneous systems grows, organizing computation efficiently on systems with multiple kinds of heterogeneous processors is a challenging problem and will be a normality. In this paper, we analyze some state-of-the-art task scheduling algorithms of heterogeneous computing systems and propose a Degree of Node First (DONF) algorithm for task scheduling of fine-grained parallel programs on heterogeneous systems. The major innovations of DONF include: 1) simplifying task priority calculation for directed acyclic graph (DAG) based fine-grained parallel programs which not only reduces the complexity of task selection but also enables the algorithm to solve the scheduling problem for dynamic DAGs;2) building a novel communication model in the processor selection phase that makes the task scheduling much more efficient. They are achieved by exploring finegrained parallelism via a dataflow program execution model, and validated through experimental results with a selected set of benchmarks. The results on synthesized and real-world application DAGs show a very good performance. The proposed DONF algorithm significantly outperforms all the evaluated state-of-the-art heuristic algorithms in terms of scheduling length ratio (SLR) and efficiency.
【分 类】【工业技术】 > 自动化技术、计算机技术
【关键词】 TASK SCHEDULING HETEROGENEOUS system performance parallel program
【出 处】 《计算机科学技术学报:英文版》2019年 第5期 1096-1108页 共13页
【收 录】 中文科技期刊数据库