Topology preserving dynamic load balancing for parallel molecular simulations

Hegarty, David F.; Kechadi, M-Tahar

doi:10.1145/509593.509629

Cited by 14 publications

(9 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…B N + tree is a dynamic structure since its height grows or contracts as new nodes join the system and/or other nodes leave the system. The second phase of our technique consists of the application of the PSLB/PSTS algorithm in order to balance the load among the leaves (nodes) of the resulting B N +tree [12,14].…”

Section: B N + Network Treementioning

confidence: 99%

“…The algorithm used to balance the work load among the nodes of a sub-pattern (or group) is called the Positional Scan Load Balancing algorithm (PSLB) [12]. This algorithm leads to a perfect load balanced system at a very reasonable time.…”

Section: Task Scheduling and Allocationmentioning

confidence: 99%

“…The PSLB algorithm is a very powerful and can operate at different levels of details (coarse grain and fine grain). The generalization of the algorithm to n-dimensional data-grids is also introduced in [12]. A brief description of the PSLB algorithm for 1-D grids (line or bus) is given below (Algorithm 1).…”

Section: Pslb Algorithmmentioning

confidence: 99%

See 2 more Smart Citations

Efficient Load Balancing on Irregular Network Topologies Using B+tree Structures

Savvas

Kechadi

2007

Sixth International Symposium on Parallel and Distributed Computing (ISPDC'07)

View full text Add to dashboard Cite

In this study, a heterogeneous distributed computing environment (Grid) is employed as a computing platform to perform some computationally intensive tasks. In order to increase the efficiency of the system (utilization and average response time), a dynamic task scheduling algorithm is proposed to balance the load among the nodes of the system. The technique is composed of two main phases. Firstly, the heterogeneous distributed system is embedded onto a structure similar to B+tree and then the algorithm of load-balancing is executed on the virtual structure. The optimum degree of the tree is identified in order to achieve optimal performance. The experimental and simulation results show the benefit of using the technique and additionally they show that it is relatively easy to identify the crossover points (thresholds) for which the system should be load balanced.

show abstract

Section: B N + Network Treementioning

confidence: 99%

Section: Task Scheduling and Allocationmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Load Balancing on Irregular Network Topologies Using B+tree Structures

Savvas

Kechadi

2007

Sixth International Symposium on Parallel and Distributed Computing (ISPDC'07)

View full text Add to dashboard Cite

show abstract

“…The authors of [5] take the data traffic balance method based on ring routing, to avoid congestion of critical node in the central area. And in [6], a probability-based data traffic balance method is put forward, by way of using multiple gateway nodes as forwarding nodes, to avoid the congestion of gateway. It cannot consider data balance of the whole network.…”

Section: Introductionmentioning

confidence: 99%

Routing algorithm of smart grid data collection based on data balance measurement model

Jia¹,

Chen

Shao

et al. 2014

The 16th Asia-Pacific Network Operations and Management Symposium

View full text Add to dashboard Cite

Data collection communications system for electric power communication network is an important entity network in electric power system. It's significant to provide a reasonable routing mechanism for data collection system. The major risk of original routing mechanism is the burst congestion. In the data collection network of smart grid, that some nodes may suffer from more congestion than others even become the bottleneck of network become the new source of risk. In order to overcome these problems, this paper proposes a routing mechanism to realize data balance. This mechanism firstly abstracts a multigate network model of data collection system. Then, it proposes a routing measurement model to balance data traffic named data balance measurement model (DBMM). Subsequently it proposes a routing algorithm based on DBMM, named RA-DBMM. The RA-DBMM handles the data traffic to achieve data balance by modifying the routing decision measurement function. So the queue length of queuing data and buffer capacity of every nodes are taken into consideration. Simulation illustrates that the proposed RA-DBMM has biggish enhancement in minishing the congestion, reducing loss ratio, overcoming bottleneck and increasing throughput of network.

show abstract

“…Some of the techniques previously used to load balance MD simulations include the orthogonal recursive bisection [3] [7], hashed oct-tree [18], costzones [9], cell redistribution [1] and morton-ordering [11]. However, all of these techniques take into consideration the spatial distribution of the atoms in the system since they they assume that the spatial decomposition method is used for parallelization.…”

Section: Introductionmentioning

confidence: 99%

Adaptive Load Balancing for Long-Range MD Simulations in A Distributed Environment

Sumanth

Swanson

Jiang

2006

2006 International Conference on Parallel Processing (ICPP'06)

View full text Add to dashboard Cite

show abstract

Topology preserving dynamic load balancing for parallel molecular simulations

Cited by 14 publications

References 23 publications

Efficient Load Balancing on Irregular Network Topologies Using B+tree Structures

Efficient Load Balancing on Irregular Network Topologies Using B+tree Structures

Routing algorithm of smart grid data collection based on data balance measurement model

Adaptive Load Balancing for Long-Range MD Simulations in A Distributed Environment

Contact Info

Product

Resources

About