|
This paper presents an approach for scheduling algorithms that can maintain the load balancing and provides better improved strategies through efficient job scheduling and modified resource allocation techniques. The load can be CPU load, memory capacity, delay or network load. Load balancing is the process of distributing the load among various nodes of a distributed system to improve both resource utilization and job response time while also avoiding a situation where some of the nodes are heavily loaded while other nodes are idle or doing very little work. Load balancing ensures that all the processor in the system or every node in the network does approximately the equal amount of work at any instant of time. The simulated results provided in this paper based on scheduling algorithm ESCE (Equally Spread Current Execution) load .ESCE Scheduling algorithms handle the random selection based load distributed problem round robin , we have proposed ESCE scheduling algorithm and compared it with the round robin scheduling to estimate response time, processing time, which is having an impact on cost.
|
