Cart (Loading....) | Create Account
Close category search window

Simulated annealing algorithm for scheduling Divisible Load in large scale data grids

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

4 Author(s)
Abdullah, Monir ; Dept. of Commun. Technol. & Network, Univ. Putra Malaysia, Serdang ; Othman, M. ; Ibrahim, H. ; Subramaniam, S.

In many data grid applications, data can be decomposed into multiple independent sub datasets and distributed for parallel execution and analysis. This property has been successfully exploited using divisible load theory (DLT). Many scheduling approaches have been studied but there is no optimal solution. This paper proposes a novel simulated annealing (SA) algorithm for scheduling divisible load in large scale data grids. SA algorithm is integrated with DLT model and compared with the previous approaches. Experimental results show that the proposed model obtains better solution in term of makespan.

Published in:

Computer and Communication Engineering, 2008. ICCCE 2008. International Conference on

Date of Conference:

13-15 May 2008

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.