Modified Hierarchical Method for Task Scheduling in Grid Systems
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2017, Vol 8, Issue 3
Abstract
This study aims to increase the productivity of grid systems by an improved scheduling method. A brief overview and analysis of the main scheduling methods in grid systems are presented. A method for increasing efficiency by optimizing the task graph structure considering the grid system node structure is proposed. Task granularity (the ratio between the amount of computation and transferred data) is considered to increase the efficiency of planning. An analysis of the impact on task scheduling efficiency in a grid system is presented. A correspondence of the task graph structure considering the node structure (in which the task is immersed) to the effectiveness of scheduling in a grid system is shown. A modified method for scheduling tasks while considering their granularity is proposed. The relevant algorithm for task scheduling in a grid system is developed. Simulation of the proposed algorithm using the modeling system GridSim is conducted. A comparative analysis between the modified algorithm and the algorithm of the hierarchical scheduler Maui is shown. The general advantages and disadvantages of the proposed algorithm are discussed.
Authors and Affiliations
Ahmad Ali AlZubi
Keywords
Related Articles
- EP ID EP249539
- DOI 10.14569/IJACSA.2017.080311
- Views 141
- Downloads 0
Algorithm to Match Ontologies on the Semantic Web
It has been recognized that semantic data and knowledge extraction will significantly improve the capability of natural language interfaces to the semantic search engine. Semantic Web technology offers a vast scale of sh...
Survey of Wireless MANET Application in Battlefield Operations
In this paper, we present a framework for performance analysis of wireless MANET in combat/battle field environment. The framework uses a cross-layer design approach where four different kinds of routing protocols are co...
Enhancing Elasticity of SaaS Applications using Queuing Theory
Elasticity is one of key features of cloud computing. Elasticity allows Software as a Service (SaaS) applications’ provider to reduce cost of running applications. In large SaaS applications that are developed using serv...
Efficient K-Nearest Neighbor Searches for Multiple-Face Recognition in the Classroom based on Three Levels DWT-PCA
The main weakness of the k-Nearest Neighbor algorithm in face recognition is calculating the distance and sort all training data on each prediction which can be slow if there are a large number of training instances. Thi...
Automated Periodontal Diseases Classification System
This paper presents an efficient and innovative system for automated classification of periodontal diseases, The strength of our technique lies in the fact that it incorporates knowledge from the patients' clinical data,...