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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
IEEE
2008
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/48026/1/Simulated%20annealing%20algorithm%20for%20scheduling%20divisible%20load%20in%20large%20scale%20data%20grids.pdf http://psasir.upm.edu.my/id/eprint/48026/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Putra Malaysia |
| Language: | English |
| Summary: | 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. |
|---|