Load Allocation Model for Scheduling Divisible Data Grid Applications
Monir Abdullah, Mohamed Othman, Hamidah Ibrahim & Shamala Subramaniam
Journal of Computer Science, Volume 5, Issue 10, pp. 760–763 · doi.org/10.3844/jcssp.2009.760.763
Abstract
Problem statement: In many data grid applications, data can be decomposed into multiple independent sub-datasets and distributed for parallel execution and analysis. Approach: This property had been successfully employed by using Divisible Load Theory (DLT), which had been proved as a powerful tool for modeling divisible load problems in data-intensive grid. Results: There were some scheduling models had been studied but no optimal solution has been reached due to the heterogeneity of the grids. This study proposed a new optimal load allocation based on DLT model recursive numerical closed form solutions are derived to find the optimal workload assigned to the processing nodes. Conclusion/Recommendations: Experimental results showed that the proposed model obtained better solution than other models (almost optimal) in terms of Makespan.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2009 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
Abdullah, M., Othman, M., Ibrahim, H. & Subramaniam, S. (2009). Load Allocation Model for Scheduling Divisible Data Grid Applications. Journal of Computer Science, 5(10), 760–763. https://doi.org/10.3844/jcssp.2009.760.763
- Licence
- © Science Publications
- Issue
- Volume 5, Issue 10
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
