Nothing Special   »   [go: up one dir, main page]

Skip to main content

Round Robin Scheduling Based on Remaining Time and Median (RR_RT&M) for Cloud Computing

  • Conference paper
  • First Online:
Smart Trends in Computing and Communications

Part of the book series: Smart Innovation, Systems and Technologies ((SIST,volume 165))

Abstract

Cloud computing is a system that is flexible to adjust infrastructure as needed with low costs. Quality of service is a challenge for a cloud service provider. A scheduling algorithm has a direct impact on the quality of service in cloud computing. Therefore, this work focuses on studying scheduling algorithms for cloud environments and proposes a new algorithm based on a round robin algorithm called round robin based on remaining time and median (RR_RT&M). It is compared with other algorithms, such as first-come, first-served (FCFS), and smarter round robin (SRR) algorithms. The performance metrics are makespan, execution time, and waiting time. The experiments were conducted in CloudSim simulator, and the results showed that RR_RT&M performed the best for all metrics and the percentage of improvement for makespan was between 16 and 72%. For execution time and waiting time, the improvement percentages were 31–73 and 0–73%, respectively.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

Similar content being viewed by others

References

  1. Zimmer, T.: What are the advantages of information technology in business? https://smallbusiness.chron.com/advantages-information-technology-business-774.html

  2. Buyya, R., Broberg, J., Goscinski, A.: Cloud Computing: Principles and Paradigms. Wiley (2010)

    Google Scholar 

  3. Zhang, S., Chen, X., Zhang, S., Huo, X.: The comparison between cloud computing and grid computing. In: Computer Application and System Modeling (ICCASM), pp. 72–75 (2010)

    Google Scholar 

  4. Hung, T.C., Phi, N.X.: Study the effect of parameters to load balancing in cloud computing. Int. J. Comput. Netw. Commun. (IJCNC) 8(3) (2016)

    Article  Google Scholar 

  5. Mishral, M.K., Rashid, F.: An improved round robin CPU scheduling algorithm with varying time quantum. Int. J. Comput. Sci. Eng. Appl. (IJCSEA) 4(4), 1–8 (2014)

    Article  Google Scholar 

  6. Islam, T., Hasan, M.S.: A performance comparison of load balancing algorithms for cloud computing. In: International Conference on the Frontiers and Advances in Data Science (FADS) (2017)

    Google Scholar 

  7. Lin, W., Liang, C., Wang, J.Z., Buyya, R.: Bandwidth-aware divisible task scheduling for cloud computing. Softw.-Pract. Exp. 44, 163–174 (2014)

    Article  Google Scholar 

  8. Madni, S.H.H., Latiff, M.S.A., Abdullahi, M., Abdulhamid, S.M., Usman, M.J.: Performance comparison of heuristic algorithms for task scheduling in IaaS cloud computing environment. PLoS One, 1–26 (2017)

    Google Scholar 

  9. Mahmoud, A.A., Zarina, M., Nik, W.N.S.W., Ahmad, F.: Multi-criteria strategy for job scheduling and resource load balancing in cloud computing environment. Indian J. Sci. Technol. 8(30), 1–5 (2015)

    Article  Google Scholar 

  10. Hicham, G.T., Chaker, E.A.: Cloud computing CPU allocation and scheduling algorithms using CloudSim simulator. Int. J. Electr. Comput. Eng. (IJECE) 6(4), 1866–1879 (2016)

    Article  Google Scholar 

  11. Hicham, G.T., Chaker, E.A.: Smarter round robin scheduling algorithm for cloud computing and big data. J. Data Min. Digit. Humanit. (2017)

    Google Scholar 

  12. Mora, H., Abdullahi, S.E., Junaidu, S.B.: Modified Median Round Robin Algorithm (MMRRA). In: 13th International Conference on Electronics, Computer and Computation (ICECCO) (2017)

    Google Scholar 

  13. Bansala, N., Mauryaa, A., Kumara, T., Singha, M., Bansalb, S.: Cost performance of QoS driven task scheduling in cloud computing. In: Third International Conference on Recent Trends in Computing (ICRTC 2015) (2015)

    Google Scholar 

  14. Mathew, T., Sekaran. K.C., Jose, J.: Study and analysis of various task scheduling algorithms in the cloud computing environment. In: International Conference on Advances in Computing, Communications and Informatics (ICACCI) (2014)

    Google Scholar 

  15. Elmougy, S., Sarhan, S., Joundy, M.: A novel hybrid of shortest job first and round robin with dynamic variable quantum time task scheduling technique. J. Cloud Comput.: Adv. Syst. Appl. (2017)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tanapat Anusas-amornkul .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Runsungnoen, M., Anusas-amornkul, T. (2020). Round Robin Scheduling Based on Remaining Time and Median (RR_RT&M) for Cloud Computing. In: Zhang, YD., Mandal, J., So-In, C., Thakur, N. (eds) Smart Trends in Computing and Communications. Smart Innovation, Systems and Technologies, vol 165. Springer, Singapore. https://doi.org/10.1007/978-981-15-0077-0_3

Download citation

Publish with us

Policies and ethics