International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 63 - Number 11 |
Year of Publication: 2013 |
Authors: Devi Priya, Joshua Samuel Raj, V. Vasudeven |
10.5120/10514-5484 |
Devi Priya, Joshua Samuel Raj, V. Vasudeven . Hybridized TABU-BFO Algorithmin Grid Scheduling. International Journal of Computer Applications. 63, 11 ( February 2013), 43-47. DOI=10.5120/10514-5484
Task Scheduling is an important issue in Grid Environment of multiprocessors system. The problem of scheduling a set of dependent and independent Task in a distributed system is considered. In this paper we are going to study a detailed study on tabu search, BFO and its hybridization. Tabu search is a heuristic procedure which uses its adaptive memory structures in order to find optimal solution in grid scheduling. Bacterial Foraging Optimization Algorithm is a well-known optimization algorithm for Task scheduling. The Hybridization of tabu-BFO approach is considered for reliability factor which increase the performance by means of efficient Task Scheduling.