Load Balancing Model Research Articles

Linear programming models for load balancing

The problem of optimally sharing a given workload among a number of machines under a presently known load level is formulated both as a linear program and as a partitioning problem. An interpretation of the problem in terms of scheduling theory is described, and an exact algorithm running in O( n log n) time is presented.

Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System

Queueing models for a simple heterogeneous multiple processor system are presented, analyzed, and compared. Each model is distinguished by a job routing strategy which is designed to reduce the average job turnaround time by balancing the total load among the processors. In each case an arriving job is routed by a job dispatcher to one of m parallel processors. The job routing strategies are divided into two classes: deterministic and nondeterministic. The nondeterministic policies are described by state independent branching probabilities. For the deterministic policies, the next processor is chosen to minimize or maximize the expected value of a performance related criterion function.

Inter Nepcon—Assembly and repair of multi-chip modules : A. G. Cozens, Electron. Engng, October (1969), p. 22

Although the hierarchical model appears to be an effective solution to organize the resource managements in grid systems which have more stringent demand for both scalability and efficiency, it has some limitations which need to be addressed. For example, the master/manager resources in different levels represent single points of failure and they may be sources of bottleneck and communication overhead especially if they are not efficiently selected. Moreover, the dynamic and fault-prone nature of grids cannot be treated by static structures while the manual construction and repairing are also prohibitive due to the highly caused overhead which often represents a significant obstruction to an efficient resource utilization (especially for those with intermittent availabilities). The main objective of this paper is to first introduce a self-repairing n-try dynamic hierarchical grid model for scheduling and load balancing in which each master resource will be replicated on one of its children resources. Second, an efficient methodology to elect masters–replicas resources is proposed. In this methodology, the masters–replicas are selected based on both resource reliability (in terms of MTBF) and resource proximity from the other nodes in specified groups (in terms of communication latency). Validation of the proposed methodology based on the proposed model is done via simulation. Experimental results show that the proposed model has a great impact on the overall performance. Compared to other approaches, the simulations show that our approach decrements the average completion time (ACT) by 18.9%–25%, increases the tree stability ratio (TSR) up to 26.2%–27.1%, and minimizes the total communication overhead (TCO) by 4.4%–18.7% in the range of system parameter values examined.