STUDY OF TIMELINE AND PROFILE BASED SCHEDULING IN GRID ENVIRONMENT – A SCOPE TO IMPROVE CLOUD SCHEDULING.

Main Article Content

Bimal V O
Bosco Paul Alapatt
Dr. M Anand Kumar

Abstract

Abstract: The word grid computing is originated from a new computing infrastructure for scientific research in various areas. Cloud is the commercial version of grid. There are various challenges in Grid computing which are applicable in cloud also. The main challenges are resource management, job scheduling, security problems, fault tolerance, virtualisation etc. In the above current research challenges, job scheduling is the fundamental issue in achieving high performance in grid and cloud computing systems. However, it is a big challenge for efficient scheduling algorithm design and implementation. In scheduling algorithms, some are cost effective and some others are performance based. CPU intensive problems are very much increased and the research on effective scheduling is going deeply and widely. In this scenario, the scheduling problem is very interesting and this is the perfect time to develop a new scheduling strategy. The computing power in the grid is scattered around the globe. Any resource owner can put his own cost and other several policies for renting his resource. In such an environment the scheduling will be difficult and price variant. So developing an optimum scheduling algorithm with optimised cost and reduced waiting time is always better than an optimum duration or time based approach. Utilising the resources effectively in a minimum amount of cost and waiting time of jobs are always a better approach. The profile based selection is another approach in grid. In this paper we discusses two algorithms developed by us. We also portraits the possibilities of the same in cloud environment.

Downloads

Download data is not yet available.

Article Details

Section
Articles
Author Biography

Bimal V O, Chinmaya Institute of Technology

Associate Professor, Master of Computer Application Dept

References

. A. Grimshaw and W. Wulf, 1997. The Legion Vision of a Worldwide Virtual Computer, Communications of the ACM, vol. 40.

. Alexandre di Costanzo, Marcos Dias de Assuncao, 2009. Harnessing Cloud Technologies for a Virtualized Distributed Computing Infrastructure, IEEE Internet Computing, Volume 13, Number 5, Pages: 24-33.

. Anthony Sulistio, Chee Shin Yeo, and Rajkumar Buyya, 2004. A Taxonomy of Computer-based Simulations and its Mapping to Parallel and Distributed Systems Simulation Tools, Software: Practice and Experience (SPE), Volume 34, Issue 7, Pages: 653-673.

. Anthony Sulistio, Uros Cibej, Sushil Prasad, and Rajkumar Buyya, 2009. GarQ: An Efficient Scheduling Data Structure for Advance Reservations of Grid Resources, International Journal of Parallel, Emergent and Distributed Systems, Volume 24, Number 1, Pages: 1-19.

. Balaji, N.. Enhancing Computational Speed for Search Application Through High Performance Grid Using Globus Tool Kit, International Journal of Computational Intelligence Research/09731873, 20090401.

. Bimal VO, Dr. G.Raju, 2011 “Alea- The efficient job scheduling simulatorâ€- Proceedings in 'National conference on Envisioning the future: Emerging Trends in Management and Information Technology-Aavishkar' Chintech, Kannur, ISBN 978-81-921983-9-2.

. Bimal VO, G Raju, 2014. Performance Analysis of TimeLine Algorithm in Grid Environment using Alea.International Journal of Computer Science Systems Engineering and Information Technology (IJCSSEIT), Vol. 7, No. 2, December 2014, pp. 199-210.

. Bimal VO, G Raju, 2015 Job-Profile based selection of Scheduling Algorithms in Grid Environment. International Journal of Applied Engineering Research ISSN 0973-4562 Volume 10, Number 14, pp 34479-34484.

. Bimal VO, G Raju. Job-Profile based selection of Scheduling Algorithms in Grid Environment. International Journal of Applied Engineering Research ISSN 0973-4562 Volume 10, Number 14 (2015) pp 34479-34484

. Bimal VO, G Raju. Performance Analysis of TimeLine Algorithm in Grid Environment using Alea. International Journal of Computer Science Systems Engineering and Information Technology (IJCSSEIT), Vol. 7, No. 2, December

. Bimal.V.O, Anand Kumar. Performance Analysis of TimeLine Algorithm against CONS, PBS_PRO and BestGap in Grid Environment using Alea. International Journal of Applied Engineering Research ISSN 0973-4562 Volume 11, Number 7 (2016) pp 5132-5138

. C. Waldspurger, T. Hogg, B. Huberman, J. Kephart, and W. Stornetta, 1992. Spawn: A Distributed Computational Economy, IEEE Transactions on Software Engineering, Vol. 18, No. 2, pp 103.

. Chee Shin Yeo and Rajkumar Buyya, 2007 Pricing for Utility-driven Resource Management and Allocation in Clusters, International Journal of High Performance Computing Applications, Volume 21, Issue 4, Pages: 405-418.

. D. Abramson, J. Giddy, and L. Kotler, 2000. High Performance Parametric Modeling with Nimrod/G: Killer Application for the Global Grid?, Proceedings of the International Parallel and Distributed Processing Symposium.

. D. Abramson, P. Roe, L. Kotler, and D. Mather, 2001. ActiveSheets: Super-Computing with Spreadsheets. 2001 High Performance Computing Symposium (HPC’01), Advanced Simulation Technologies Conference.

. D. Abramson, R. Buyya, and J. Giddy. A Computational Economy for Grid Computing and its Implementation in the Nimrod-G Resource Broker. Future Generation Computer Systems (FGCS) Journal, 18(8):1061–1074.

. David Abramson, Rajkumar Buyya, and Jonathan Giddy, 2002. A Computational Economy for Grid Computing and its Implementation in the Nimrod-G Resource Broker, Future Generation Computer Systems, Volume 18, Issue 8, Pages: 1061-1074.

. Ding Choon Hoong and Rajkumar Buyya, 2004. Guided Google: A Meta Search Engine and its Implementation using the Google Distributed Web Services, International Journal of Computers and Applications, Volume 26, No.3, Pages: 181-187.

. Rajkumar Buyya, David Abramson, Jonathan Giddy, and Heinz Stockinger, 2002. Economic Models for Resource Management and Scheduling in Grid Computing, Concurrency and Computation: Practice and Experience (CCPE), Volume 14, Issue 13-15, Pages: 1507-1542.

.Rajkumar Buyya, Manzur Murshed, David Abramson, and Srikumar Venugopal, 2005. Scheduling Parameter Sweep Applications on Global Grids: A Deadline and Budget Constrained Cost-Time Optimisation Algorithm, Software: Practice and Experience (SPE), Volume 35, Issue 5, Pages: 491 – 512.

. Rajkumar Buyya, Toni Cortes, and Hai Jin,2001 Single System Image, International Journal of High Performance Computing Applications (IJHPCA), Volume 15, No. 2, Pages: 124-135.

. Srikumar Venugopal, Krishna Nadiminti, Hussein Gibbins and Rajkumar Buyya, 2008. Designing a Resource Broker for Heterogeneous Grids, Software: Practice and Experience, Volume 38, Issue 8, Pages: 793-825.

. Srikumar Venugopal, Rajkumar Buyya and Lyle Winton, 2006. A Grid Service Broker for Scheduling e-Science Applications on Global Data Grids, Concurrency and Computation: Practice and Experience, Volume 18, Issue 6, Pages: 685-699.

. Srikumar Venugopal, Rajkumar Buyya, and Kotagiri Ramamohanarao, 2006. A Taxonomy of Data Grids for Distributed Data Sharing, Management and Processing, ACM Computing Surveys, Volume 38, No. 1, Pages:1-53.

. Wolski, R., Plank, J. S., Brevik, J. and Bryan, T. , 2001. GCommerce: Market formulations controlling resource allocation on the computational Grid. International Parallel and Distributed Processing Symposium, San Francisco, USA

. Y. Amir, B. Awerbuch., A. Barak A., S. Borgstrom, and A. Keren, 2000. An Opportunity Cost Approach for Job Assignment in a Scalable Computing Cluster, IEEE Transactions on Parallel and Distributed Systems, Vol. 11, No. 7, pp. 760-768.

. Y. Aridor, M. Factor, and A. Teperman, 1999. cJVM: a Single System Image of a JVM on a Cluster, Proceedings of the 29th International Conference on Parallel Processing (ICPP 99).