*3.8. The SJF Algorithm*

It executes the jobs by considering their shortest size as the priority and that priority is controlled by analyzing consumers' requests' sizes [31]. It assigns the tasks to the VMs based on their regions, fogs and shortest size. This algorithm is preferred over other algorithms because it has minimum latency. The consumers bear less delay and their comfort standards do not compromise more. The requests having the minimum PT or sizes are served first and then VMs are assigned to them respectively. The scheduler allocates the jobs to various VMs and SJF schedules the jobs by allotting the minimum completion time. It also provides higher efficiency and lower turnaround time. In this way, it enhances the system's performance.
