Simulated annealing algorithm for scheduling divisible load in large scale data grids

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 sol...

Full description

Bibliographic Details
Main Author:	Tuan Norhafizah binti Tuan Zakaria
Other Authors:	Monir Abdullah
Format:	Journal
Published:	IIUM Engineering Journal, International Islamic University Malaysia 2009
Subjects:	Engineering
Online Access:	http://www.myjurnal.my/public/article-view.php?id=64790

id	oai:www.myjurnal.my:64790
recordtype	eprints
spelling	oai:www.myjurnal.my:647902018-09-20T00:00:00Z Simulated annealing algorithm for scheduling divisible load in large scale data grids Tuan Norhafizah binti Tuan Zakaria Engineering 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. IIUM Engineering Journal, International Islamic University Malaysia Monir Abdullah 2009-00-00 Journal application/pdf 64790 www.myjurnal.my/filebank/published_article/17161IIUMEJ_2009_Monir.pdf www.myjurnal.my/public/article-view.php?id=64790
repository_type	Digital Repository
institution_category	Local Institution
institution	MyJournal
building	MyJournal Repository
collection	Online Access
topic	Engineering
spellingShingle	Engineering Tuan Norhafizah binti Tuan Zakaria Simulated annealing algorithm for scheduling divisible load in large scale data grids
description	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.
author2	Monir Abdullah
author_facet	Monir Abdullah Tuan Norhafizah binti Tuan Zakaria
format	Journal
author	Tuan Norhafizah binti Tuan Zakaria
author_sort	Tuan Norhafizah binti Tuan Zakaria
title	Simulated annealing algorithm for scheduling divisible load in large scale data grids
title_short	Simulated annealing algorithm for scheduling divisible load in large scale data grids
title_full	Simulated annealing algorithm for scheduling divisible load in large scale data grids
title_fullStr	Simulated annealing algorithm for scheduling divisible load in large scale data grids
title_full_unstemmed	Simulated annealing algorithm for scheduling divisible load in large scale data grids
title_sort	simulated annealing algorithm for scheduling divisible load in large scale data grids
publisher	IIUM Engineering Journal, International Islamic University Malaysia
publishDate	2009
url	http://www.myjurnal.my/public/article-view.php?id=64790
first_indexed	2018-09-20T09:21:39Z
last_indexed	2018-09-20T09:21:39Z
_version_	1612225537769472000

Simulated annealing algorithm for scheduling divisible load in large scale data grids

Similar Items