Deploying CPU Load Balancing in the Linux Cluster Using Non-Repetitive CPU Selection (original) (raw)

An Effective Mechanism for Improving Performance of Load Balancing System in Cluster Computing

International Journal of Computer Applications, 2015

With the fast growth of the WWW, the traffic to the websites is also increased. Due to which, clients many times experience poor response time or sometimes denial of service. These bottlenecks of the server can be solved using multiple web servers that behave like a single host. With the rapid growth of both information and users, the quality of network services should be improved. Server"s performance can be enhanced using load balancing mechanism which is the process of redistributing the work load among processors in the system. To evenly distribute the load among the web servers, dynamic load balancing (DLB) techniques are used. In this paper, a DLB algorithm is given which will calculate, allocate and balance the load among web servers on the basis of processing capacity and memory requirement of jobs. Performance of the proposed framework is also analyzed.

A global load balancing strategy for a distributed computer system

1988

Distributed Computing Systems (DCSs) evolved to provide communication among replicated and physically distributed computers as hardware costs decreased. Interconnecting physically distributed computers allows better communication and improved performance through redistribution (or load balancing) of workload. In this paper, we describe a load balancing strategy for a computer system connected by multiaccess broadcast network. The strategy uses the existing broadcast capability of these networks to implement an efficient search technique for finding stations with the maximum and the minimum workload. The overhead of distributing status information in the proposed strategy is independent of the number of stations. This result is significant because the primary overhead in load balancing lies in the collection of status information. An implementation of the proposed strategy on a network of Sun workstations is presented. It consists of two modules that are executed at all participating computers: the distributed-search module that isolates the maximally and minimally loaded computers, and the job-migration module that places a job based on the load extremes.

A dynamic load balancing system for parallel cluster computing

Future Generation …, 1996

In this paper we discuss a new approach to dynamic load balancing of parallel jobs in clusters of workstations and describe the implementation into a Unix run-time environment. The e ciency of the proposed methodology is shown by means of a number of case studies.

Server Load – Balancing using Resources of Clustering Technique

International Journal of Computer Applications, 2015

Load Balancing is one of the most important issues for clustered servers. Load Balancing is done on the basis of server traffic. The proposed algorithm uses user-session history as the other constraint which is very useful for resource management over the server and easy access for the client. Collection of the data of a particular client from the last user-session, groups the applications that are likely to be opened in a specific time frame. This will provide easy access to the client and will reduce resource wastage on the server by using cluster technology. The primary clusters will be based on the bandwidth of the client's internet bandwidth, which will map to different servers. Whereas secondary clusters will be based on the similarity of application-usage in the past user-session. This approach can reduce the unnecessary searching time. Cluster management will provide better approachability towards the server also the bandwidth based load balancing will lead to the minimum bandwidth wastage.

Dynamic Load Balancing in Distributed System: An Efficient Approach

2007

In this paper, the problem of distributing load of a particular node over m identical nodes of a distributed computing system for minimizing turnaround time is studied first. Then an efficient technique is presented for dynamically scheduling jobs in large-scale, multiuser distributed computing systems that provides a balanced system performance with respect to the scheduling overhead. The nodes are scheduled independently and asynchronously with distinct execution initiation times corresponding to their earliest instant of being overloaded. The technique handles the task of resource management by dividing the nodes of the system into mutually overlapping subsets and thereby a node gets the system state information by querying only a few nodes. The approach is primarily targeted at systems that are composed of general purpose workstation computers having identical processors. Process scheduling decisions are driven by the desire to minimize turnaround time while maintaining fairness among competing applications and minimizing communication overhead. The performance analysis of the technique shows that it significantly reduces the total number of messages required for a node to take scheduling decision.

A Statistical Approach for Load balancing on Cluster Computing

2012

Given paper contain proposed approached for task scheduling to achieve load balancing which is done on a group of computers. The processor idles due to large set of data, on the multiprocessor computer. Consideration of process data part by dividing them into number of fixed part & merge into single set that as good as previous original data set. Parallelism an approach for doing jobs in amount of time i.e. very fast. The paper contains dynamic approach for process migration using thread level paradigm. Creating a thread of process into number of task, that leads to reduce total execution time of process. An algorithm is used to calculate PCB for decision purpose to achieve load balancing. We are taking CPU and MEMORY parameter in this approach. Fair share approach is considered to allocating task to every processor using preemption strategy. The MPI is used for process communication. This system has defined to reduce total execution time on onboard & between board times. Open knopp...

Dynamic load balancing in heterogeneous clusters

Pdcn, 2004

The dynamic load balancing techniques, practically, do not assume any information about the tasks to be executed at compilation time. Parameters like execution time or communication time are unknown at compilation time. These techniques are used to distribute the computation tasks of an application between different processors at execution time to achieve some defined performance objectives [1]. In this paper we present a dynamic load balancing algorithm designed especially for heterogeneous network of workstations. The algorithm distributes the parallel tasks dynamically attempting to minimize its execution time. The experiments are done over a network of workstation interconnected via a fast Ethernet. It is a Linux cluster which has some degree of heterogeneity in the processing nodes. Our algorithm is shown to be efficient in increasing the resource utilization and reducing the total execution time of the applications.

THE STUDY ON LOAD BALANCING STRATEGIES IN DISTRIBUTED COMPUTING SYSTEM

A number of load balancing algorithms were developed in order to improve the execution of a distributed application in any kind of distributed architecture. Load balancing involves assigning tasks to each processor and minimizing the execution time of the program. In practice, it would be possible even to execute the applications on any machine of worldwide distributed systems. However, the 'distributed system' becomes popular and attractive with the introduction of the web. This results in a significant performance improvement for the users. This paper describes the necessary, newly developed, principal concepts for several load balancing techniques in a distributed computing environment. This paper also includes various types of load balancing strategies, their merits, demerits and comparison depending on certain parameters. . IBM is currently developing Blue Gene /R and Blue Gene /P of speed 1.40 petaflops, the successors of Blue Gene/Lsystem .

The LC Assignment Policy for Cluster-Based Servers

2004

A cluster-based server consists of a front-end dispatcher and multiple back-end servers. The dispatcher receives incoming jobs, and then decides how to assign them to back-end servers, which in turn serve the jobs according to some discipline. Cluster-based servers have been broadly deployed as they combine good performance with low cost.

A protocol for load sharing among a cluster of heterogeneous Unix workstations

Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid, 2001

In this paper, we propose a protocol for load sharing among a cluster of heterogeneous Unix workstations. Our protocol, called the Distributed Process Management Protocol (DPMP), not only enables load sharing using nonpreemptive process migration but also seamlessly integrates the processes running on a network of machines. Remote processes can be accessed (for signalling, for example), in the same way as local processes making process migration highly transparent to the users and the applications. DPM-P also has builtin mechanisms to detect and recover from node and network failures. DPMP can be implemented at either the kernel or the user level. We also describe an implementation of DPMP within the Linux kernel. Preliminary performance studies show that the performance gains obtained by using DPMP are substantial.