arrow
返回

Task scheduling using Bayesian optimization algorithm for heterogeneous computing environments

delete2011-06-01
delete28
PRE
AI
徐
徐华 (Hua Xu) *
L
Li Pan
F
Fei Long
DOI:10.1016/j.asoc.2010.11.029delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Efficient task scheduling, as a crucial step to achieve high performance for multiprocessor platforms, remains one of the challenge problems despite of numerous studies. This paper presents a novel scheduling algorithm based on the Bayesian optimization algorithm (BOA) for heterogeneous computing environments. In the proposed algorithm, scheduling is divided into two phases. First, according to the task graph of multiprocessor scheduling problems, Bayesian networks are initialized and learned to capture the dependencies between different tasks. And the promising solutions assigning tasks to different processors are generated by sampling the Bayesian network. Second, the execution sequence of tasks on the same processor is set by the heuristic-based priority used in the list scheduling approach. The proposed algorithm is evaluated and compared with the related approaches by means of the empirical studies on random task graphs and benchmark applications. The experimental results show that the proposed algorithm is able to deliver more efficient schedules. Further experiments indicate that the proposed algorithm maintains almost the same performance with different parameter settings. (C) 2010 Elsevier B.V. All rights reserved.
Keyword:
Multiprocessor scheduling
Heterogeneous
Parallel computing
Bayesian optimization algorithm
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Applied Soft Computing 封面图
Applied Soft Computing
IF:
6.6
论文数:
1.4W
被引数:
4.8W

机构

T
tsinghua university
学者数:
11.9W
论文数: 10.0W
被引数: 137
S
siemens ag
学者数:
5.6K
论文数: 4.6K
被引数: 3
引用论文

引用论文

学者 查看更多内容