返回
Task scheduling using Bayesian optimization algorithm for heterogeneous computing environments
DOI:10.1016/j.asoc.2010.11.029.png)
摘要
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总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
Asymptotics of reaction–diffusion fronts with one static and one diffusing reactant具有一个静态和一个扩散反应物的反应扩散前沿的渐近性
Compaction of Schedules and a Two-Stage Approach for Duplication-Based DAG Scheduling时间表的压缩和基于重复的DAG调度的两阶段方法
A novel state transition method for metaheuristic-based scheduling in heterogeneous computing systems异构计算系统中元启发式调度的一种新的状态转移方法
Efficient techniques for clustering and scheduling onto embedded multiprocessors用于在嵌入式多处理器上进行群集和调度的有效技术

