An Improved min - min Algorithm for Job Scheduling using Ant Colony Optimization
Journal: International Journal of Computer Science and Mobile Computing - IJCSMC (Vol.3, No. 5)Publication Date: 2014-05-30
Authors : Davinder Kaur; Sarpreet Singh;
Page : 552-556
Keywords : Grid Computing; job scheduling; min-min algorithm; Ant Colony Optimization (ACO);
Abstract
Grid computing is recognized as one of the most powerful vehicles for high performance computing for data-intensive scientific applications. Grid is alternative to traditional distributed computing. It addresses issues such as resource discovery, heterogeneity, fault tolerance and task scheduling. Scheduling is the one of the current issue in the complex heterogeneous environment. Job scheduling is used to schedule the user jobs to appropriate resources in grid environment. The most simple and well known scheduling algorithm is min-min algorithm that is used to minimize the makespan but it has some disadvantages. To remove the disadvantages of the min- min in this paper we proposed an improved min-min algorithm which uses the features of Ant Colony Optimization.
Other Latest Articles
- Fault Tolerance Testing for Crash and Omission Transient Failure during Resource Scheduling of Grid Computing?
- VIRTUALIZATION IN CLOUD COMPUTING?
- Inference Mining using Direct and Indirect Discrimination Prevention in Data Mining
- A Review Report on Secured Encryption in Cloud Computing using Symmetric Cryptography?
- Implementation of Content Base Image Retrieval Using Clustering Technique?
Last modified: 2014-05-25 16:10:28