Novel Approaches for Scheduling Task Graphs in Heterogeneous Distributed Computing Environment
Journal: The International Arab Journal of Information Technology (Vol.12, No. 3)Publication Date: 2015-05-01
Authors : Ehsan Munir; Saima Ijaz; Sheraz Anjum; Ali Khan; Waqas Anwar; Wasif Nisar;
Page : 270-277
Keywords : Heterogeneous distributed computing systems; directed acyclic graphs; task scheduling; task prioritization; makespan.;
Abstract
Distributed heterogeneous computing environment comprises of diverse set of interconnected resources that are capable of performing computationally complex tasks efficiently. In order to exploit the high performance of such a system, the task scheduling problem demands for the efficient mapping of the tasks. Because of its fundamental importance, the problem has been studied extensively and several algorithms have been proposed. In this paper, we propose two novel approaches for
the task scheduling problem and compare the proposed work on the basis of randomly generated task graphs with the wellknown existing algorithms. The simulation results elucidate on the basis of different cost and performance metrics that for most of the scenarios, the proposed approaches outperform the existing ones considerably.
Other Latest Articles
- Multi Dimensional Taxonomy of Bio-inspired Systems Based on Model Driven Architecture
- Anomaly Traffic Detection Based on PCA and SFAM
- Efficient English Auction Scheme without a Secure Channel
- Arabic Phonemes Transcription using Data Driven Approach
- An Efficient Content Based Image Retrieval using Advanced Filter Approaches
Last modified: 2019-11-17 18:10:38