Optimization of Dynamic Resource Scheduling Algorithm in Grid Computing Environment
|S.K. Patel1 , A.K. Sharma2|
1 Dept. of Information Technology, Govt. N.P.G. College of Science, Raipur, India.
2 Dept. of Information Technology, A.P.S.G.M.N.S Govt. P. G. College, Kawardha, India.
|Correspondence should be addressed to: firstname.lastname@example.org.|
Section:Research Paper, Product Type: Journal Paper
Volume-6 , Issue-3 , Page no. 19-26, Mar-2018
Online published on Mar 30, 2018
Copyright © S.K. Patel, A.K. Sharma . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
|View this paper at Google Scholar | DPI Digital Library|
|XML View||PDF Download|
IEEE Style Citation: S.K. Patel, A.K. Sharma, “Optimization of Dynamic Resource Scheduling Algorithm in Grid Computing Environment”, International Journal of Computer Sciences and Engineering, Vol.6, Issue.3, pp.19-26, 2018.
MLA Style Citation: S.K. Patel, A.K. Sharma "Optimization of Dynamic Resource Scheduling Algorithm in Grid Computing Environment." International Journal of Computer Sciences and Engineering 6.3 (2018): 19-26.
APA Style Citation: S.K. Patel, A.K. Sharma, (2018). Optimization of Dynamic Resource Scheduling Algorithm in Grid Computing Environment. International Journal of Computer Sciences and Engineering, 6(3), 19-26.
|15||22 downloads||5 downloads|
|Resource supervision and task scheduling are very important and complex problems in grid computing environment. Handle of such resources we need job scheduling and load balancing techniques which are responsible for efficient use of the grid resources, reduce job waiting time, access latency in a wise manner. After comprehensive investigation of an existing grid which involves a large number of CPU cluster, we observe that grid scheduling decisions can be significantly improved computation time if the characteristics of current usage patterns are understood. In this paper a new job scheduling algorithm, called Improved Dynamic Load Balancing (IDLB) is proposed. In the proposed algorithm the current scheduling is denoted as S* so the runtime delay is reduced by using Actual Latest Finish Time (ALFT). Finally, in this research the algorithm was simulated with the aid of OptorSim simulator and it was proved that our proposed algorithm provid an effective solution for resource management grid scheduling.|
|Key-Words / Index Term :|
|Grid Computing, Computational Grid, DLB, IDLB,Load Balance , Resource Management, Job Scheduling|
 Garg SK, Buyya R, Siegel HJ (2010) Time and cost tradeoff management for scheduling parallel applications on utility Grids. Future Gener Comput Syst 26:1344–1355
 S. K. Patel, A.K. Sharma,“Grid Computing: Status of Technology In Current Perspective”, International Journal of Software & Hardware Research in Engineering, Vol.2, Issue.6, 2014.
 S. K. Patel, A.K. Sharma,“ Design and Implementation of an Efficient Resource Sharing algorithm for Grid Computing”, International Journal of Software & Hardware Research in Engineering, Vol.2, Issue.5, 2014.
 Foster, and C. Kesselman. 2003,”The Grid 2: Blueprint for a New Computing Infrastructure”, Morgan Kaufmann, USA.
 R. Buyya, D. Abramson, and S. Venugopal. 2005, “The Grid Economy”. Proceedings of the IEEE, pp. 698-714.
 S. K. Patel, A.K. Sharma,“Implementing job scheduling to optimize computational task in Grid Computing using PSO”, International Journal of Computer application, 2015.
 Thamarai Selvi, S., Ponsy, R. K., Bhama, S., Architha, S., Kaarunya, T., Vinothini, K.,( 2010). Scheduling In Virtualized Grid Environment Using Hybrid Approach, International Journal of Grid Computing & Applications (IJGCA) Vol.1, No.1.
 Somasundaram, K., Radhakrishnan, S., (2008). Node Allocation In Grid Computing Using Optimal Resource Constraint (ORC) Scheduling”, IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.6.
 Quan, L., Yeqing ,L.,( 2009). Grouping-Based Fine- grained Job Scheduling in Grid Computing, Vol.1, pp.556- 559, IEEE First International Workshop on Education Technology and Computer Science.
 Kaur,S., Kaur,S.(2013). Survey of Resource and Grouping Based Job Scheduling Algorithm in Grid Computing, IJCSMC, Vol. 2, Issue. 5, pg.214 – 218
 Srivastava, A., Rathore, R. & Sharma, R.(2013). High Compaction Coarse Grained Job Scheduling In Grid Computing, International Journal of Computer Science Engineering and Information Technology Research (IJCSEITR) ISSN 2249-6831 Vol. 3, Issue 2, 295-302.
 Nithiapidary , M.,(2005). A Dynamic Job Grouping- Based Scheduling for Deploying Applications with Fine-Grained Tasks on Global Grids
 Ang, T.F., . Ng, W.K., Ling, T.C., Por, L.Y., and Liew, C.S., (2009). A Bandwidth -Aware Job Grouping - Based Scheduling on Grid Environment. Information Technology Journal, 8: 372-377.
 Cameron, D. G., Schiaffino, R. C., Ferguson, J., Millar, P., Nicholson, C., Stockinger, K., and Zini, F., (2004). OptorSim v2.0 Installation and User Guide.
 S. K. Patel,“ Design And Development Of A New Technique Including Policies For Resource Sharing Management In Computational Grid System” , 2017.
 S. Parsa, R. Entezari-Maleki, RASA: A New Grid Task Scheduling Algorithm, JDCTA (2009) 91–99.
 A. Olteanu, F. Pop, C. Dobre, V. Cristea, A dynamic rescheduling algorithm for resource management in large scale dependable distributed systems, Comput. Math. Appl. 69 (9) (2012) 1409–1423.
 M. A. Vasile , P. Florin, “ Resource- Aware Hybrid Scheduling Algorithm in heterogeneous distributed Computing”, Futer Generation Computer System, 51 (2015), 61-67.