With elevation in the technologies, parallel computing has become an apparent area with the aspiration of providing adequate and faster result for various applications. Parallel computing focuses on parallel processing between operations in some way. Today, parallel computing is growing at an accelerating rate. Parallel computing emphasizes parallel and concurrent computation among different processors. Parallel computing refers to sub-division of a problem, and executing these sub problems simultaneously. Imbalance in the load is a well-known problem in the region which involves parallelism. One of the challenging tasks of parallel computing is to balance the load among processors. Load balancing optimizes the way processing load is shared among the multiple processors. Load balancing algorithms are broadly categorized as Static and Dynamic. Static load balancing distributes the processes to processors at compile time, while dynamic load balancing bind processes at run time. Static load balancing algorithms may be either deterministic or probabilistic. Dynamic load balancing is further categorized as centralized and distributed. This paper confers about the study and analysis of load balancing approaches in multiprocessor systems. Performances of sender initiated load balancing is observed on the basis of execution time, speedup and steal ratio. To implement load balancing algorithms, scale simulator is used.
