Grid computing technology can be seen as a positive alternative for implementing high-performance distributed computing. The goal of Grid computing is to create the illusion of virtual computer out of a large collection of connected heterogeneous nodes. Scheduling jobs on computational grids is identified as NP-hard problem due to the heterogeneity of resources; the resources belong to different administrative domains and apply different management policies. Today a highly secure or virtual grid is very demanding in which you can share any resource from any cluster even with existence of fault in system. In this paper, an algorithm named as UMAX is proposed. This method aims to improve the resource utilization with maximum efficiency and throughput

Meta task; Scheduling; Resource utilization; Grid task scheduling

[1] W. Gentzsch, “DOT-COMing the GRID: Using Grids for Business”, Sun Microsystems Inc, Palo Alto, California, USA, pp. 1–3, 2002.
[2] A News Article Web Page in “Nature”, Available at: http://www.nature.com/nature/webmatters/grid/ grid.html.
[3] M. Baker, R. Buyya, D. Laforenza, “The Grid: International Efforts in Global Computing”, SSGRR 2000 The Computer & eBusiness Conference, l`Aquila, Italy, July 31 2000 – August 6 2000.
[4] C. Germain, V. Néri, G. Fedak, F. Cappello, “XtremWeb: Building an Experimental Platform for Global Computing”, Grid2000, IEEE Press, December 2000.
[5] I. Foster, C. Kesselman, S. Tuecke, “The Anatomy of the Grid: Enabling Scalable Virtual Organizations”, The International Journal of High Performance Computing Applications, Vol. 15, Issue. 3, pp. 200–222, 2001.
[6] I. Foster, C. Kesselman, Eds., “Computational Grids”, In: “The Grid: Blueprint for a New Computing Infrastructure”, Morgan Kaufmann, 1998
[7] D.C. Arnold, S.S. Vahdiyar, J. Dongarra, “On the Convergence of Computational and Data Grids”, Parallel Processing Letters, Vol. 11, pp. 187–202, 2001, ISSN 0129-6264.
[8] P. Sessini, “Scheduling in Grid Computing Systems”, University of Calgary, Alberta, Canada, 2015.
[9] C. Franke, U. Schwiegelshohn, R. Yahyapour, “Job Scheduling for Computational Grids”, University of Dortmund, Germany.
[10] M. Hemamalini, M.V. Srinath, “Memory Constrained Load Shared Minimum Execution Time Grid Task Scheduling Algorithm in a Heterogeneous Environment”, Indian Journal of Science & Technology, Vol. 8, 2015, ISSN (Print): 0974–6846, ISSN (Online): 0974–5645.
[11] R.J. Wisnesky, “Evaluating Scheduling Algorithms on Distributed Computational Grids”, 2002.
[12] K. Jairam Naik, K. Vijaya Kumar, N. Satyanarayana, “Scheduling Tasks on Most Suitable Fault Tolerant Resource for Execution in Computing Grid”, IJGDC, Vol. 5, pp. 121–132, 2012.
[13] M. Hemamalini, “Review on Grid Task Scheduling Algorithm in a Distributed Heterogeneous Environment”, International Journal of Computer Applications, Vol. 40, Issue. 2, pp. 24–30, 2012.
[14] M. Hemamalini, Dr. M.V. Srinath, “State of the Art: Task Scheduling Algorithms in Heterogeneous Grid 0 50 100 150 200 250 Time in Milliseconds Response Time Minimization”, International Journal of Computer Applications, Vol. 145 p. 14, 2016, “Computing Environment”, Elysium Journal of Engineering Research Management, Vol. 1, August 2014.
[15] M. Hemamalini, M.V. Srinath, “Response Time Minimization Task Scheduling Algorithm”, International Journal of Computers and Applications, Vol. 145, pp. 9–14, 2016.
[16] J. Balasangameshwara, N. Raju, “A Hybrid Policy for Fault Tolerant Load Balancing in Grid Computing Environments”, Journal of Network and Computer Applications, Vol. 35, Issue. 1, pp. 412–422, 2012.