Optimal workload allocation model for scheduling divisible data grid applications

Authors:
Monir Abdullah;Mohamed Othman;Hamidah Ibrahim;Shamala Subramaniam
Affiliations:
Department of Computer Science, Thamar University, Thamar, Yemen;Department of Communication Technology and Network, University Putra Malaysia, 43400 UPM Serdang, Selangor D.E., Malaysia;Department of Communication Technology and Network, University Putra Malaysia, 43400 UPM Serdang, Selangor D.E., Malaysia;Department of Communication Technology and Network, University Putra Malaysia, 43400 UPM Serdang, Selangor D.E., Malaysia
Venue:
Future Generation Computer Systems
Year:
2010

Citing 8
Cited 0

The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
A data intensive distributed computing architecture for “grid” applications

Future Generation Computer Systems - Special issue on high performance computing and networking Europe 1999
Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems

Cluster Computing
A Genetic Algorithm Based Approach for Scheduling Decomposable Data Grid Applications

ICPP '04 Proceedings of the 2004 International Conference on Parallel Processing
A taxonomy of Data Grids for distributed data sharing, management, and processing

ACM Computing Surveys (CSUR)
Design and analysis of a load balancing strategy in data grids

Future Generation Computer Systems - Special section: Data mining in grid computing environments
Resource-Aware Distributed Scheduling Strategies for Large-Scale Computational Cluster/Grid Systems

IEEE Transactions on Parallel and Distributed Systems
The impact of data replication on job scheduling performance in the Data Grid

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 employed using Divisible Load Theory (DLT), which has been proved a powerful tool for modeling divisible load problems in data-intensive grids. There are some scheduling models that have been studied but no optimal solution has been reached due to the heterogeneity of the grids. This paper proposes a new model called the Iterative DLT (IDLT) for scheduling divisible data grid applications. Recursive numerical closed form solutions are derived to find the optimal workload assigned to the processing nodes. Experimental results show that the proposed IDLT model leads to a better solution than other models (almost optimal) in terms of makespan.