Performance evaluation of scheduling algorithms using CloudSim

Abstract

Cloud computing is a growing method for using online resources, with varying traffic levels. Scheduling algorithms are crucial due to factors like execution time and latency. This paper examines cloud environments, highlighting models like SaaS, PaaS, IaaS, and types such as public, private, and hybrid. It uses CloudSim to simulate components like data centers and VMs. The study analyzes scheduling algorithms: FCFS, SJF, and RR. Results indicate SJF excels in most areas but not in makespan, FCFS fares well in makespan but is costly, and RR is efficient in makespan but slow in total completion time.

Document Type

Conference Proceeding

Date of Publication

1-1-2025

Volume

1360 LNNS

Publication Title

Lecture Notes in Networks and Systems

Publisher

Springer

School

School of Engineering

Comments

Sati, S. O., Zhang, J., Tu, S., & Waqas, M. (2024). Performance evaluation of scheduling algorithms using CloudSim. Lecture Notes in Networks and Systems, 1360, 1157-1175. https://doi.org/10.1007/978-981-96-5006-4_100

Copyright

subscription content

First Page

1157

Last Page

1175

Link to Full Text

Share

 
COinS
 

Link to publisher version (DOI)

10.1007/978-981-96-5006-4_100