System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

NDA-MM: A New Adaptive Task Scheduling Algorithm Based on the Non-dedicated Constraint Grid

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.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yong Hou ; Coll. of Inf. Sci. & Eng., Xinjiang Univ., Urumqi ; Jiong Yu ; Turgun

Task scheduling is a critical design issue for the service grid system. Decreasing the makespan of service and balancing the workload of the service resources are very important problems to be solved. Considering of the autonomous, heterogeneous, and distributed feature of the service grid system, we propose a novel task scheduling algorithm, called the adaptive Min-Min and Max-Min based on the non-dedicated constraint grid (NDA-MM) algorithm for the service grid. The proposed algorithm is provided with the dedicated property for the service resources and the paid property for the tasks, which is merged the high efficiency of the traditional Min-Min scheduling algorithm and the load balance of the traditional Max-Min scheduling algorithm. The experiments show that the algorithm overweighs traditional algorithms a lot in the makespan and the scalability of the scheduling algorithm.

Published in:

Grid and Cooperative Computing, 2007. GCC 2007. Sixth International Conference on

Date of Conference:

16-18 Aug. 2007