1 / 13

LOAD BALANCING IN A CENTRALIZED DISTRIBUTED SYSTEM

LOAD BALANCING IN A CENTRALIZED DISTRIBUTED SYSTEM. BY ANILA JAGANNATHAM ELENA HARRIS. OUTLINE. PROBLEM STATEMENT ARCHITECTURE LOAD BALANCING METHODS EXPERIMENTAL RESULTS CONCLUSION. PROBLEM STATEMENT.

diza
Download Presentation

LOAD BALANCING IN A CENTRALIZED DISTRIBUTED SYSTEM

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. LOAD BALANCING IN A CENTRALIZED DISTRIBUTED SYSTEM BY ANILA JAGANNATHAM ELENA HARRIS

  2. OUTLINE • PROBLEM STATEMENT • ARCHITECTURE • LOAD BALANCING METHODS • EXPERIMENTAL RESULTS • CONCLUSION

  3. PROBLEM STATEMENT To study different load balancing methods in order to improve CPU utilization and overall execution time of requests in a centralized distributed system with an environment that requires extensive calculations.

  4. ARCHITECTURE • MASTER – SLAVE ARCHITECHTURE • CENTRALIZED CLIENT ACTS AS THE MASTER MACHINE • SERVERS ACT AS SLAVES • SOCKETS ARE USED FOR COMMUNICATION SERVER SERVER SERVER CLIENT

  5. LOAD BALANCING APPROACHES • RANDOM LOAD BALANCING Requests are routed to servers at random. Used for homogeneous systems. • ROUND ROBIN LOAD BALANCING Simple and no overhead Load may not be evenly balanced in the system • CPU UTILIZATION BASED LOAD BALANCING Client queries CPU utilization of each of the servers and chooses the least loaded server to assign incoming user request.

  6. CPU UTILIZATION METRIC • Client requests statistics from /proc/stat file maintained by each server to estimate current CPU utilization. • Statistics from /proc/stat: – Total time spent by the CPU on all processes – Total number of processes running. • Average time per process, T / P is used as metric T – Difference in CPU time at two time points P – Difference in number of processes at two time points • The larger T / P, the less loaded a CPU is.

  7. USER APPLICATIONS • Four applications are chosen to simulate user requests. • Run time of these applications is 8 min , 3 min, 30 sec and 3 sec respectively. • Client has dual functionality - Generates user requests - Performs load balancing.

  8. EXPERIMENTAL RESULTS T/P TIME PERIODS RANDOM LOAD BALANCING

  9. T/P TIME PERIODS

  10. T/P TIME POINTS

  11. EXPERIMENT -II In this experiment, 1000 tasks were distributed. From the graph, average time/process using the proposed method changes less drastically.

  12. CONCLUSION LOAD BALANCING USING CURRENT CPU AVERAGE TIME/PROCESS RESULTS IN BETTER OVERALL CPU UTILIZATION AS COMPARED TO RANDOM OR ROUND ROBIN METHODS.

More Related