By Topic

Related Task Scheduling Research Based on Virtual Clusters and Partitioning of Task

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
4 Author(s)
Hong Liang ; Coll. of Comput. & Commun. Eng., China Univ. of Pet., Dongying, China ; Chang-zhen Xing ; Xue-dong Qi ; Chang Liu

In the actual grid environment, there are many kinds of task and resource which are different from each other, so the grid scheduling is very difficult. This paper proposes a scheduling algorithm for static batch task based on graph division and resources clustering. The algorithm uses VDAG map to describe the entire task collection and schedules them together. In order to take full advantage of the parallel grid resource, the algorithm takes a method to divide the DAG graph in horizontal and vertical direction to get the job groups relatively independent from each other; at the same time, extracts the resources attributes to build the virtual cluster to reduce the resources search time spent in the scheduling process. The algorithm obtains better scheduling results.

Published in:

Scalable Computing and Communications; Eighth International Conference on Embedded Computing, 2009. SCALCOM-EMBEDDEDCOM'09. International Conference on

Date of Conference:

25-27 Sept. 2009