2006 Fifth International Symposium on Parallel and Distributed Computing 2006
DOI: 10.1109/ispdc.2006.17
|View full text |Cite
|
Sign up to set email alerts
|

Dealing with Heterogeneity in Load Balancing Algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 14 publications
(10 citation statements)
references
References 10 publications
0
10
0
Order By: Relevance
“…The idea is to assign to each process a data partition that is proportional to the relative computing power (RCP ) of the processor on which it is running. The relative computing power of processor i (RCP i ) [36,37] is computed in Equation 1 as the computing power of the processor (in F LOP S) divided by the sum of the computing power of all of the p processors on which the MPI program is running. Rather than balance the workload using the number of rows or columns as reference, our balancing algorithm uses the number of nonzero elements.…”
Section: Load Balancingmentioning
confidence: 99%
“…The idea is to assign to each process a data partition that is proportional to the relative computing power (RCP ) of the processor on which it is running. The relative computing power of processor i (RCP i ) [36,37] is computed in Equation 1 as the computing power of the processor (in F LOP S) divided by the sum of the computing power of all of the p processors on which the MPI program is running. Rather than balance the workload using the number of rows or columns as reference, our balancing algorithm uses the number of nonzero elements.…”
Section: Load Balancingmentioning
confidence: 99%
“…An efficient approach, originally designed for homogeneous systems, consists in adapting the parallel code by software techniques which balance the load depending on the computational power of each computing unit. But to adapt parallel code to run on a heterogeneous system requires prior knowledge about the characteristics of the architecture [4], which is not always feasible.…”
Section: Related Workmentioning
confidence: 99%
“…The fraction of the workload assigned to process i is computed in Equation 2 depending on the relative computing power (RCP i ) of a process i, which is computed as the M F LOP S i divided by the total M F LOP S for all of the p processes. RCP is used to estimate workload distribution on parallel applications, since it provides a normalized value of the computational power of a process relative to the computational power of the whole system [4,7].…”
Section: Load Balancingmentioning
confidence: 99%
“…The methodology chosen, however, allows for the implementation of balancing algorithms which may be more efficient. It is well known that to exploit a heterogeneous system the workload of every node has to be proportional to its computational power or speed [3,6]. On nondedicated systems, the computational power available to every task is a temporal parameter, α i (t), it has to be periodically measured to dynamically adapt the load attached to every processor.…”
Section: Model Of Computational Power On Nondedicated Systemsmentioning
confidence: 99%