• Raj Kumar
• Dr. Vijay Dhir

In this digital Era, parallel computing and distributed computing is playing a very vital role in multiprocessor environment to meet out the growing resource needs of users day by day. When several processes are being executed in multiprocessor environment, there are possibilities that some of the processors are being idle while others are being heavily loaded. In other words, we can say that there is total load imbalance in the system. The algorithm which is used to balance the load among processors is known as the load balancing algorithm. The load balancing algorithms can be divided into types : static and dynamic. In static load balancing algorithms, the information regarding allocation of processes to the different resources is based on the estimation of expected execution or completion time of the processes at compile time itself. Where in case of dynamic load balancing algorithms, this information is not available to algorithm prior to run time. So dynamic load balancing algorithm balances the load according to the currently prevailing information at runtime. Aim of this research paper is to find out some qualitative factors for comparison of both type of algorithms.

Parallel Computing, Makespan, Latency, Throughput, Load Balancing Algorithms, Resource Utilization, Task Scheduling.

"Static Vs Dynamic Load Balancing Algorithms in Parallel Computing Environment", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 3, page no.121-125, March-2019, Available :http://www.jetir.org/papers/JETIR1903018.pdf

"Static Vs Dynamic Load Balancing Algorithms in Parallel Computing Environment", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 3, page no. pp121-125, March-2019, Available at : http://www.jetir.org/papers/JETIR1903018.pdf