Skip to main content
SpringerLink
Log in

Job Scheduling Algorithm in Cloud Environment Considering the Priority and Cost of Job

  • Conference paper
  • First Online:
Book cover Proceedings of Sixth International Conference on Soft Computing for Problem Solving

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 547))

Abstract

Distribution of work load (job) among the virtual machine is one of the challenging issues in cloud environment. It is very difficult to predict the execution time of job in cloud computing. So Cloud job scheduler should be dynamic in nature and distribute the job among the virtual machine in such a manner, no virtual machine should be in overloaded or ideal condition. We proposed an algorithm considering the priority of jobs and cost of resource. Job priority and cost of resources is major issue to establish a cloud environment for enterprises. For better quality of service and utilization of resources IBA algorithm is suited for this purpose. Result shows that IBA minimize the idle time of resources but IBA does not provide the guarantee for handling job priority and cost of the resource. So there is a need of job scheduling algorithm that considers job priority and recourse cost.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Peixoto, M., Santana, M., Estrella, J., Tavares, T., Kuehne, B., Santana, R.: A metascheduler architecture to provide QoS on the cloud computing. In: 2010 IEEE 17th International Conference on Telecommunications (ICT 2010), pp. 650–657, April 2010

    Google Scholar 

  2. Mu’alem, J.A., Feitelson, D.: Utilization, predictability, workload and user runtime estimates in scheduling the ibm sp2 with backfilling. IEEE Trans. Parallel Distrib. Syst. 12(6), 529–543 (2001)

    Article  Google Scholar 

  3. Suresh, A., Vijayakarthick, P.: Improving scheduling of backfill algorithm using balanced spiral method for cloud metascheduler. In: 2011 International Conference on Recent Trends in Information Technology (ICRTIT 2011), pp. 624–627, June 2011

    Google Scholar 

  4. Yi, S., Wang, Z., Ma, S., Che, Z., Liang, F., Huang,Y.: Combinational backfilling for parallel job scheduling. In: 2010 2nd International Conference on Education Technology and computer (IECTC 2010), vol. 2, pp. v2-112–v2-116, June 2010

    Google Scholar 

  5. Xu, X., Ye, N.: Minimization of job waiting time variance on Identical parallel machine. IEEE Trans. Syst. Man Cybern. Part C Appl. Rev. 37, 917–927 (2007)

    Article  Google Scholar 

  6. Yang, J., Chen, Z.: Cloud computing research and security issues. In: 2010 International Conference on Computational Intelligence and Software Engineering (CiSE 2010), pp. 1–3 (2010)

    Google Scholar 

  7. Ma, T., Buyya, R.: Critical-path and priority based algorithms for scheduling workflows with parameter sweep tasks on global grids. In: 17th International Symposium on Computer Architecture and High Performance Computing 2005, SBAC-PAD 2005, pp. 251–258 (2005)

    Google Scholar 

  8. Gupta, P., Rakesh, N.: Different job scheduling methodologies for web application and web server in a cloud computing environment. In: 2010 3rd International Conference on Emerging Trends in Engineering and Technology (ICETET 2010), pp. 569–572 (2010)

    Google Scholar 

  9. Feitelson, D.G., Rudolph, L., Schwiegelshohn, U.: Parallel job scheduling — a status report. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2004. LNCS, vol. 3277, pp. 1–16. Springer, Heidelberg (2005). doi:10.1007/11407522_1

    Chapter  Google Scholar 

  10. Chen, H., et al.: User-priority guided min-min scheduling algorithm for load balancing in cloud computing. In: National Conference on Parallel Computing Technologies, Bangalore, pp. 1–8 (2013)

    Google Scholar 

  11. Bhatia, J., et al.: HTV dynamic load balancing algorithm for virtual machine instances in cloud. In: International Symposium on Cloud and Services Computing, Mangalore, pp. 15–20 (2012)

    Google Scholar 

  12. Dubey, K., et al.: A priority based job scheduling algorithm using IBA and EASY algorithm for cloud metaschedular. In: International Conference on Advances in Computer Engineering and Applications, Ghaziabad, India, pp. 66–70 (2015)

    Google Scholar 

  13. Babu, D., Venkata, P.: Honey bee behavior inspired load balancing of tasks in cloud computing environments. Appl. Soft Comput. 13(5), 2292–2303 (2013)

    Article  Google Scholar 

  14. Ramezani, F., Khadeer Hussain, F.: Task-based system load balancing in cloud computing using Particle Swarm Optimization. Int. J. Parallel Program. 42(5), 739–754 (2013)

    Article  Google Scholar 

  15. Buyya, R., Ranjan, R., Calheiros, R.: Modeling and simulation of scalable cloud computing environments and the cloudsim toolkit: challenges and opportunities. In: International Conference on High Performance Computing Simulation 2009, HPCS 2009, pp. 1–11, June 2009

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indian Institute of Technology Roorkee, Roorkee, India

    Mohit Kumar, Kalka Dubey & S. C. Sharma

Authors
  1. Mohit Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kalka Dubey
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. C. Sharma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohit Kumar .

Editor information

Editors and Affiliations

  1. Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, India

    Kusum Deep

  2. Department of Mathematics, South Asian University, New Delhi, India

    Jagdish Chand Bansal

  3. Department of Mathematics, National Institute of Technology, Silchar, Silchar, Assam, India

    Kedar Nath Das

  4. School of Mathematics, Thapar Institute of Engineering and Technology University, Patiala, Punjab, India

    Arvind Kumar Lal

  5. School of Mathematics, Thapar Institute of Engineering and Technology University, Patiala, Punjab, India

    Harish Garg

  6. Department of Mathematics and Computer Science, Liverpool Hope University, Liverpool, United Kingdom

    Atulya K. Nagar

  7. Department of Paper Technology, Indian Institute of Technology Roorkee, Roorkee, India

    Millie Pant

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Kumar, M., Dubey, K., Sharma, S.C. (2017). Job Scheduling Algorithm in Cloud Environment Considering the Priority and Cost of Job. In: Deep, K., et al. Proceedings of Sixth International Conference on Soft Computing for Problem Solving. Advances in Intelligent Systems and Computing, vol 547. Springer, Singapore. https://doi.org/10.1007/978-981-10-3325-4_31

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-3325-4_31

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-3324-7

  • Online ISBN: 978-981-10-3325-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation