Deadline Constrained Least Laxity Time Based Cloudlet Scheduling

Users send their requests to cloud service providers, who then deliver the services over networked systems. With a high volume of requests, it is crucial to schedule cloudlets effectively to ensure that most meet their specified deadlines for optimal performance. This paper focuses on calculating Both slack time and laxity time for cloudlets across all virtual machines and scheduling them accordingly. It also considers the rearrangement of cloudlets already assigned to virtual machines to accommodate new cloudlets. The CloudSim simulation environment is utilized to schedule cloudlets by evaluating their slack time and laxity time across various virtual machines. This approach helps in selecting the most suitable virtual machine for executing the cloudlets. By incorporating laxity time into the scheduling decisions, the system becomes more balanced, reduces makespan, and thus enhances overall performance. The proposed method has been shown to reduce task rejection by at least 10% and the makespan by an average of 17% when compared to the EFD algorithm.