Open AccessSIMULATED ANNEALING ALGORITHM FOR SCHEDULING DIVISIBLE LOAD IN LARGE SCALE DATA GRIDS
Author(s) -
M.K. Abdullah,
Мohamed Othman,
Hamidah Ibrahim,
Shamala Subramaniam
Publication year - 2010
Publication title -
iium engineering journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.141
H-Index - 6
eISSN - 2289-7860
pISSN - 1511-788X
DOI - 10.31436/iiumej.v10i1.105
Subject(s) - computer science , grid , simulated annealing , scheduling (production processes) , distributed computing , job shop scheduling , parallel computing , algorithm , mathematical optimization , mathematics , embedded system , geometry , routing (electronic design automation)
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.