网格非独立的调度算法
ependent task scheduling in the grid
网格现已被应用到解决大规模以及复杂问题的系统中,而网格调度是网格系统的关键技术之一,是一个NP完全问题,它是用来解决将任务调度到合适的资源节点上。调度算法是要通过最小化调度长度来确保网格高性能,本文提出了一种基于非独立任务优先级的调度算法,该算法是基于每个应用中子任务的优先级,根据优先级顺序进行任务调度。该算法通过与现有的网格调度算法进行调度长度和资源利用率的对比,在现实经典应用的DAG图中表现出很好的性能。。
he grid has been applied to solve the system with a large scale and the complex problem .A key issue in the grid system is mapping the tasks to the appropriate resource, which is also a NP-complete problem. Scheduling algorithm must guarantee high performance by minimizing the scheduling length. This paper proposes dependent task priority-base scheduling (DTPBS) algorithm, which computes the priority value of the tasks and then schedules these tasks according to the priority. Simultaneously this paper issues service move to decrease data transmission time between tasks. Compared to the scheduling time and resource utility of existing algorithms, the algorithm based on randomly generated DAGS and DAGS of two real applications shows good performance.
孙伟峰、朱玉丹、李明楚
计算技术、计算机技术
优先级非独立任务调度网格
prioritydependent taskschedulinggrid
孙伟峰,朱玉丹,李明楚.网格非独立的调度算法[EB/OL].(2010-11-24)[2025-08-18].http://www.paper.edu.cn/releasepaper/content/201011-569.点此复制
评论