Improving the Grid Scheduling Performance with Fault Tolerance Using Genetic Algorithm
In the last few decades we have witnessed the emergence of grid computing as an innovative extension to distributed computing technology, for computing resource sharing among participants in a virtualized collection of organizations. Grid computing entails new challenges as the adaptation of heterogeneous resources unlike homogeneous resources cluster in distributed systems. It is important to maintain proportional fairness in the grid scheduling in order to achieve balanced scheduling. In this paper we propose the importance of genetic algorithm to design schedulers that minimizes the waiting time and maximizes the resource utilization and provides fairness in the grid environment. The resource types and their efficiency are considered in order to maximize their utilization. This paper proposes a solution to maximize the throughput while considering multiple job requests during the scheduling process. The idea of fault tolerance in the crash fault environment will also be implemented based on precautionary method and real time restoration.
KeywordsSchedule Algorithm Grid Computing Fault Tolerance Round Robin Grid Environment
Unable to display preview. Download preview PDF.
- 2.Celaya, J., Marchal, L. (eds.): A Fair Decentralized Scheduler for Bag-of-tasks Applications on Desktop Grids.- Dept. de Informática e Ingeniería de Sistemas Zaragoza, SpainGoogle Scholar
- 3.Sulistio, A., Cibej, U., Venugopal, S., Robic, B., Buyya, R.: A Toolkit for Modelling and Simulating Data Grids: An Extension to GridSim. In: Concurrency and Computation: Practice and Experience (CCPE). Wiley Press, New York (2007)Google Scholar
- 4.Sanchez Santiago, A.J., Yuste, A.J., Munoz Exposito, J.E., Garcia Galan, S., Maqueira Marin, J.M., Bruque, S.: A dynamic-balanced scheduler for Genetic Algorithms for Grid Computing. Telecommunication Engineering Department Business Administration and Accounting Department University of JaénGoogle Scholar
- 6.Duan, R., Prodan, R., Fahringer, T.: Run-time optimization of grid workflow applications. In: 7th IEE/ACM International Conference on Grid Computing, pp. 33–40 (2006)Google Scholar
- 8.Mandal, A., Kennedy, K., Koelbel, C., Marin, G., Mellor-Crummey, J., Liu, B., Johnsson, L.: Scheduling strategies for mapping application workflows onto the grid. In: Proceedings of the 14th International Symposium on High Performance Distributed Computing (HPDC 2005), pp. 125–134 (2005)Google Scholar
- 9.Blythe, J., Jain, S., Deelman, E., Gil, Y., Vahi, K., Mandal, A., Kennedy, K.: Task scheduling strategies for workflow-based applications in grids. In: Proceedings of the Cluster Computing and Grid 2005 (CCGrid 2005), pp. 759–767 (2005)Google Scholar
- 10.Weiss, G., Pinedo, M.: Scheduling Tasks with Exponential Service Times on Non-Identical Processors to Minimize Various Cost Functions. Journal of Applied Probability, 187–202 (1980)Google Scholar
- 11.Carretero, J., Xhafa, F., Abraham, A.: Genetic based schedulers for grid computing systemsGoogle Scholar