conference-paper

A Dynamic Algorithm for VM Scheduling for Prioritized Cloudlets

Research footprint

At a glance

Citations
3
References
16
Comments
0
Paper overview

Öz

Users submit their requests to cloud service providers, and cloud computing delivers services over networks. With the influx of a large number of requests to the cloud, effective scheduling of cloudlets is imperative for optimal performance. This paper focuses on assigning priorities to cloudlets and scheduling them accordingly. Dynamic updating of priorities is implemented to prevent starvation. Cloudlets are allocated to VMs considering the current load of the VMs, further reducing execution time. The CloudSim simulation environment is used for assigning priorities to cloudlets, scheduling the cloudlets, and selecting the least loaded virtual machine for execution of the cloudlets. By prioritizing tasks and considering VM load, this approach aims to optimize system performance and ensure efficient resource utilization in cloud computing environments. It was found that the proposed method performs better in terms of total Turnaround Time and number of context switches than the existing algorithms.

Record transparency

Publication details

DOI
10.1109/icdcece60827.2024.10549675
OpenAlex
W4399563554
Document type
conference-paper
Language
EN
Last metadata update
Community

Comments

Oturum Açın to join the discussion.

  1. No comments yet. Start the discussion.