This report describes a prototype load balancing algorithm designed to improve the efficiency of molecular dynamics simulations, specifically those in which the system under study is characterised by large spatial variations in atom density. At root the parallelisation scheme used in the load balancer is similar to the widely used domain decomposition scheme, however each domain is further subd...

one of the most challenges in parallel computing is how to balance the load over participated processors. Imbalance states usually increase the execution time and thus decrease the performance and minimize the utilization of computing resources. Two main types of load balancing strategies are discussed in literature; static and dynamic. Few works were focused to combine both of them as hybrid s...

Increasingly large-scale clusters of PC/WS continue to become majority platform in HPC field. Such a commodity cluster environment, there may be incremental upgrade due to several reasons, such as rapid progress in processor technologies, or user needs and it may cause the performance heterogeneity between nodes from which the application programmer will suffer as load imbalances. To overcome t...

The performance of large distributed systems crucially depends on efficiently balancing their load. This has motivated a large amount of theoretical research how an imbalanced load vector can be smoothed with local algorithms. For technical reasons, the vast majority of previous work focuses on regular (or almost regular) graphs including symmetric topologies such as grids and hypercubes, and i...

This work studies distributed algorithms for locally optimal load-balancing : We are given a graph of maximum degree ∆, and each node has up to L units of load. The task is to distribute the load more evenly so that the loads of adjacent nodes differ by at most 1. If the graph is a path (∆ = 2), it is easy to solve the fractional version of the problem in O(L) communication rounds, independentl...

Explosive data traffic growth leads to a continuous surge in capacity demands across mobile networks. In order to provision high network capacity, small cell base stations (SCBSs) are widely deployed. Owing to the close proximity to mobile users, SCBSs can effectively enhance the network capacity and offloading traffic load from macro BSs (MBSs). However, the cost-effective backhaul may not be ...

------------------------------------------------------------------ABSTRACT---------------------------------------------------------------Virtual learning is a method to access and share study materials for students on web. As it is the easy way of accessing data, millions of student’s widely using E-learning. Due to the increase of users day by day there is an issue in scheduling and providing ...

This paper proposes a technique for load balancing on symmetric multiprocessor systems, where tasks are placed in queues for being processed. Load balancing on processers was run using the RED algorithm and fuzzy system. This system which involves three threads and load balancing was carried out based on these threads. Load balancing operation was carried out in symmetric processers. Load balan...

Over the past few years, the design and performance of channel-aware scheduling strategies have attracted huge interest. In the present paper, we examine a somewhat different notion of scheduling, namely coordination of transmissions among base stations, which has received little attention so far. The inter-cell coordination comprises two key elements: (i) interference avoidance and (ii) load b...