International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 63 - Issue 11 |
Published: February 2013 |
Authors: Devi Priya, Joshua Samuel Raj, V. Vasudeven |
![]() |
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
@article{ 10.5120/10514-5484, author = { Devi Priya,Joshua Samuel Raj,V. Vasudeven }, title = { Hybridized TABU-BFO Algorithmin Grid Scheduling }, journal = { International Journal of Computer Applications }, year = { 2013 }, volume = { 63 }, number = { 11 }, pages = { 43-47 }, doi = { 10.5120/10514-5484 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2013 %A Devi Priya %A Joshua Samuel Raj %A V. Vasudeven %T Hybridized TABU-BFO Algorithmin Grid Scheduling%T %J International Journal of Computer Applications %V 63 %N 11 %P 43-47 %R 10.5120/10514-5484 %I Foundation of Computer Science (FCS), NY, USA
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.