UPM Institutional Repository

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


Citation

Abdullah, Monir and Othman, Mohamad and Ibrahim, Hamidah and Subramaniam, Shamala (2009) Simulated annealing algorithm for scheduling divisible load in large scale data grids. IIUM Engineering Journal, 10 (1). 59- 68. ISSN 1511-788X

Abstract

In many data grid applications, data can be decomposed into multiple independent sub data sets 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 make span.


Download File

[img]
Preview
PDF (Abstract)
Simulated annealing algorithm for scheduling divisible load in large scale data grids.pdf

Download (84kB) | Preview

Additional Metadata

Item Type: Article
Divisions: Faculty of Computer Science and Information Technology
Publisher: International Islamic University Malaysia (IIUM)
Keywords: Divisible load theory; Data grid; Simulated annealing.
Depositing User: Nida Hidayati Ghazali
Date Deposited: 15 Jul 2013 02:02
Last Modified: 26 Nov 2015 08:46
URI: http://psasir.upm.edu.my/id/eprint/16718
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item