Simple Search:

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


Citation

Abdullah, Monir and Othman, Mohamed and Ibrahim, Hamidah and K. Subramaniam, Shamala (2008) Simulated annealing algorithm for scheduling divisible load in large scale data grids. In: International Conference on Computer and Communication Engineering 2008 (ICCCE08), 13-15 May 2008, Kuala Lumpur, Malaysia. (pp. 1032-1036).

Abstract / Synopsis

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.


Download File

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

Download (34kB) | Preview

Additional Metadata

Item Type: Conference or Workshop Item (Paper)
Divisions: Faculty of Computer Science and Information Technology
DOI Number: https://doi.org/10.1109/ICCCE.2008.4580765
Publisher: IEEE
Keywords: Divisible load theory; Data grid; Simulated annealing
Depositing User: Nabilah Mustapa
Date Deposited: 03 Aug 2016 12:36
Last Modified: 03 Aug 2016 12:36
Altmetrics: http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1109/ICCCE.2008.4580765
URI: http://psasir.upm.edu.my/id/eprint/48026
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item