On scheduling transaction in grid computing using cuckoo search-ant colony optimization considering load.

Scheduling of transactions in the grid computing system is known to be an NP-hard problem. In order to solve this problem, this paper introduces a hybrid approach named cuckoo search-ant colony optimization. The approach is to dynamically generate an optimal schedule by clustering the resources considering their load so as to complete the transactions within their deadlines as well as utilizing the resources in an efficient way. The approach also balances the load of the system before scheduling the transactions. We use cuckoo search method for making clusters of resources based on their load. We use ant colony optimization for selecting the appropriate and optimal resources. We evaluate the performance of the proposed algorithm with six existing algorithms. The results illustrate that an important advantage of the cuckoo search-ant colony optimization algorithm is its speed of clustering and ability to obtain faster and feasible load balanced schedules. [ABSTRACT FROM AUTHOR]