A Pragmatic Study and Analysis of Load Balancing Techniques in Parallel Computing

Abstract

Allocation of the work load in to small processes is known as Load Balancing.Parallel programming is based on four phases finding Concurrency (by understanding the available concurrency and expose in algorithm design), Algorithm structure (programmer develop high level structure for organizing parallel algorithm), Supporting structure (in this code analyzing techniques used to manage data), Implementation mechanism (final steps to look specific software construct for parallel program implementation).The middle two phases based on patterns. With availability of parallle programming models OpenMP(Shared Memory Model) MPI(Distributed Memory Model) ande Hybrid(OpemMP and MPI) there is various aspects while doing load balancing in High Performance Computing also there are typical load balancing approach, Static and Dynamic are broadly categories. For this review paper keeping vision on efficiency and speed we have discussed the aspect and issues associated with typical categorised load balancing techniques.

Integration process simulator: A tool for performance evaluation of task scheduling of integration processes

“…The throughput of a computer system is a function of the environment and workload characteristics. Improvements resulting from system changes can be evaluated by throughput measurements (Wood and Forman, 1971;Thakur and Kumar., 2018). In case of execution of integration processes, throughput corresponds to the number of messages processed per time unit and it is calculated as the division of the total number of processed messages np by the total execution time T ET , cf.…”

Queue-priority optimized algorithm: a novel task scheduling for runtime systems of application integration platforms

“…The throughput of a computer system is a function of the environment and workload characteristics. Improvements resulting from system changes can be evaluated by throughput metrics [54,58]. In case of execution of integration processes, throughput corresponds to the number of messages processed per time unit and it is calculated by computing the division of the total number of processed messages «np» by the total execution time «Makespan», cf.…”