The task of balancing of assembly lines is well-known in mass production system but this problem is NP-hard even for the simple straight line. Therefore, utilizing heuristic methods for these problems is totally unquestionable. Furthermore, in line with balancing problems, heuristic methods are the foundation of the metaheuristic methods, thus it seems to be necessary to use more efficient heur...

In large-scale distributed-computing environments, there are a number of inherent time-delay factors that can seriously alter the expected performance of load-balancing (or scheduling) policies that do not account for such delays. This situation arises, for example, in systems for which each computational element (CE) is connected by means of a shared broadband communication medium. The delays,...

Load balancing in a distributed system is the process of redistributing the workload among various nodes so as to improve resource utilization and the mean response time and also to balance the workload among the nodes of the system to avoid the situation in which one node is overloaded while other is sitting idle. A dynamic load balancing approach needs no prior knowledge about the global stat...

This article proposes a design and implementation of a low cost two-tier architecture model for high availability cluster combined with load-balancing and shared storage technology to achieve desired scale of three-tier architecture for application load balancing e.g. web servers. The research work proposes a design that physically omits Network File System (NFS) server nodes and implements NFS...

Load balancing algorithms goal is to keep all nodes normally loaded through migration of modules from heavy loaded nodes to lightly loaded nodes. In addition, load balancing must involve low communication overhead and respond quickly to load imbalance in the system. In previous load balancing algorithms, classification of node as heavy, light or normal loaded node is done by using concept of th...

A serious difficulty in concurrent programming of a distributed system is how to deal with scheduling and load balancing of such a system which may consist of heterogeneous computers. In this paper, we formulate the static load-balancing problem in single class job distributed systems as a cooperative game among computers. The computers comprising the distributed system are modeled as M/M/1 que...

In this paper we present a dynamic network traffic balancing approach using strong migration on an agent based grid environment. The paper focuses on three different areas, namely load balancing, strong mobility and CSP (Constraint Satisfaction Problem) approach. We use CSP approach for making task migration decisions. Strong task migration is used to move tasks between nodes at runtime to main...

Most current load balancing systems are based on process placement or process migration. We introduce placement of user login sessions as a load balancing approach, and compare it to the process placement and process migration approaches. A load balancing system based on user placement is described, and some experimental results are given. We conclude that user placement has several advantages ...