Determining the Priority of Implementing Functions in the Grid Computing to Reduce the Waiting and Idle Time

The analysts are aware of the fact that not all servers function at the same speed owing to many factors, such as the amount of memory present, the speed of the processor, the bandwidth, congestion, etc. This indicates that there will be a problem if we use several servers to download data since the faster server will have to wait for the slower server to complete its download before continuing. Idle time of machines and waiting time for tasks were also topics of many scholarly articles because of their significant practical importance of these. This is because the idle time of servers and waiting time for tasks are indicators of how productive production systems are. The task of job reduction and scheduling is one of the most challenging challenges in network computing. When several tasks are requested, those jobs have to wait before they are allocated to servers, which might potentially expand the queue and increase the amount of time spent waiting. Because of this, the article uses Johnson Scheduling Algorithm to find the optimal sequence for processing tasks on two servers to reduce idle and waiting time.