An Ant Colony Optimization Based Load Sharing Technique for Meta Task Scheduling in Grid Computing
Grid Computing is the fast growing industry, which shares the resources in the organization in an effective manner. Resource sharing requires more optimized algorithmic structure, otherwise the waiting time and response time are increased, ansd the resource utilization is reduced. In order to avoid such reduction in the performance of the grid system, an optimal resource sharing algorithm is required. The traditional min–min algorithm is a simple algorithm that produces a schedule that minimizes the makespan than the other traditional algorithms in the literature. But it fails to produce a load balanced schedule. In recent days, ACO plays a vital role in the discrete optimization problems. The ACO solves many engineering problems and provides optimal result which includes Travelling Salesman Problem, Network Routing, and Scheduling. This paper proposes Load Shared Ant Colony Optimization (LSACO) which shares the load among the available resources. The proposed method considers memory requirement as a QoS parameter. Through load sharing LSACO reduces the overall response time and waiting time of the tasks.
KeywordsGrid Computing Ant Colony Optimization Argentine Ants Resource Sharing
Unable to display preview. Download preview PDF.
- 1.Casanova, H., Obertelli, G., Berman, F., Wolski, R.: The AppLeS parameter sweep template: user-level middleware for the grid. In: Proceedings of the ACM/IEEE Conference on Supercomputing (2003)Google Scholar
- 2.Kokilavani, T., George Amalarethinam, D.I.: Applying Non-Traditional Optimization Techniques to Task Scheduling in Grid Computing. International Journal of Research and Reviews in Computer Science 1(4), 34–38 (2010)Google Scholar
- 4.Braun, T.D., Siegel, H.J., Beck, N., Boloni, L.L., Maheswaran, M., Reuther, A.I., Robertson, J.P., et al.: A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. Journal of Parallel and Distributed Computing 61(6), 810–837 (2001)CrossRefGoogle Scholar
- 5.Chen, W.-N., Student Member, IEEE, Zhang, J., Senior Member, IEEE: An Ant Colony Optimization Approach to a Grid Workflow Scheduling Problem With Various QoS Requirements. IEEE Transactions on Systems, Man, and Cybernetics—Part C: Applications and Reviews 39(1), 29–43 (2009)Google Scholar
- 7.Saiz, P., Buncic, A., Peters, J.: AliEn Resource Brokers. In: Proceedings of the Third International Workshop on in High-Energy and Nuclear Physics, CHEP 2003 (2003)Google Scholar
- 8.Kertész, A., Kacsuk, P.: A Taxonomy of Grid Resource Brokers, pp. 201–210.Google Scholar
- 9.Kokilavani, T., George Amalarethinam, D.I.: Load Balanced min–min Algorithm for Static Meta-Task Scheduling in Grid Computing. International Journal of Computer Applications (0975–8887) 20(2) (April 2011)Google Scholar
- 11.Ritchie, G., Levine, J.: A hybrid ant algorithm for scheduling independent jobs in heterogeneous computing environments. American Association for Artificial Intelligence (2004)Google Scholar
- 12.Xu, Z., Gu, J.: Research on Ant Algorithm Based Task Category Scheduling in Grid Computing. In: Second International Conference on Intelligent Networks and Intelligent Systems, pp. 498–501 (2009)Google Scholar