Reducing Makespan and Enhancing Resource Usage in Cloud Computing With ESJFP Method: A New Dynamic Approach

Abstract

ABSTRACTA well‐designed web‐based tool or application allows consumers to access on‐demand services on a pay‐per‐use basis via the internet in the cloud computing service paradigm. Cloud computing continues to be a leading technology trend, with a primary focus on optimizing and enhancing end‐user applications. The increasing challenge of meeting the diverse needs of clints for service providers is propelling the development of load scheduling algorithms. Some of the current scheduling algorithms used in cloud computing include First Come First Serve (FCFS), Shortest Job First (SJF) and Round Robin (RR). The response time and makespan—the interval between the start and end times of consecutive tasks on the same machine—are the two most crucial load balancing elements. Response time refers to the duration a server takes to respond to a client's request. Measured in milliseconds, this timer starts when a client sends a request and stops when the server sends its initial response. This study examines many load balancing methods and suggests improvements for cloud computing's Shortest Job First (SJF) methodology. To minimize makespan and maximize resource usage, we provide a solution that is Enhanced Shortest Job First with Priority (ESJFP) load scheduling algorithms. Under the ESJFP method, computers with more processing power are assigned the longest tasks with higher MIPS (million instructions per second) needs, while machines with lesser processing capacity are assigned the shortest jobs with lower MIPS requirements. By giving equal priority to all activities, this technique makes sure that neither high‐MIPS nor low‐MIPS jobs have to wait an extended period of time for resource allocation.