TY  - JOUR
T1  - Comparison of Ant Colony Optimization and Particle Swarm Optimization in Grid Scheduling
AU - Booba, B. AU - Gopal, T.V. 
JO  - Asian Journal of Information Technology
VL  - 13
IS  - 9
SP  - 561
EP  - 565
PY  - 2014
DA  - 2001/08/19
SN  - 1682-3915
DO  - ajit.2014.561.565
UR  - https://makhillpublications.co/view-article.php?doi=ajit.2014.561.565
KW  - Grid computing
KW  -job scheduling
KW  -ACO
KW  -PSO
KW  -grid scheduling
AB  - Computational grids are a modern trend in distributed computing applications includes searching and sharing of resources for a particular job in geographically distributed heterogeneous computing systems. Grid computing allows finding efficient allocation of resources to jobs submitted by users by making appropriate scheduling decisions. In a grid environment an important issue associated with efficient utilization of resources can be done by job scheduling. As per the demand of scheduling, the job scheduling is implemented as an integrated part of parallel and distributed computing. It selects the correct match of resource for a particular job providing an increase in job throughput and performance. It is often difficult to find an exact resource for a defined job to make the scheduling of job efficiently an Ant Colony algorithm is proposed for allocating optimal resources to each job at a minimal execution time. In this project, Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO) is proposed to solve and find an exact resource allocation by choosing shortest and the optimal path for a required specific job, minimizing the schedule of length of jobs with minimum make span and execution time. This study distinguishes both optimization methods and concluded it with its best performance.
ER  -