A Low-Complexity Task Scheduling Algorithm for Heterogeneous Computing Systems

2009 Third Asia International Conference on Modelling & Simulation Pub Date : 2009-05-25 DOI:10.1109/AMS.2009.77

Foad Lotfifar, H. Shahhoseini

引用次数: 15

Abstract

Scheduling a parallel application on a set of processors is a well-known NP-Complete problem. The problem becomes more complex when the base system is composed of heterogeneous processors. In this paper, we present a low-complexity task scheduling algorithm for heterogeneous computing systems, which we call the Multiple Critical Path Dominator (MCPD) algorithm. This algorithm is based on task duplication and its complexity is. An application for scheduling is represented by a Directed Acyclic Graph (DAG). The MCPD algorithm employs a novel list scheduling algorithm for prioritizing tasks. This list-scheduling algorithm considers the variation of the Critical Paths in the DAG statistically whereby the MCPD algorithm attempts to schedule tasks on the processor according to the importance of the parent. We base our decisions on mean values of computation and communication cost of nodes and edges in the unscheduled DAG.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

异构计算系统的低复杂度任务调度算法

在一组处理器上调度并行应用程序是一个众所周知的np完全问题。当基本系统由异构处理器组成时，问题变得更加复杂。本文提出了一种适用于异构计算系统的低复杂度任务调度算法，称为多关键路径支配算法(Multiple Critical Path Dominator, MCPD)。该算法基于任务复制，复杂度为。调度应用程序由有向无环图(DAG)表示。MCPD算法采用一种新颖的列表调度算法对任务进行优先级排序。这个列表调度算法在统计上考虑了DAG中关键路径的变化，因此MCPD算法试图根据父任务的重要性在处理器上调度任务。我们的决策基于非计划DAG中节点和边的计算和通信成本的平均值。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

2009 Third Asia International Conference on Modelling & Simulation

自引率

0.00%

发文量

期刊最新文献

A Transparent Classification Model Using a Hybrid Soft Computing Method Study on the Performance of Tag-Tag Collision Avoidance Algorithms in RFID Systems Cross Layer Design of Wireless LAN for Telemedicine Application Jawi Character Speech-to-Text Engine Using Linear Predictive and Neural Network for Effective Reading Advances in Supply Chain Simulation