2002
DOI: 10.1006/jpdc.2001.1819
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive Load-Balancing Algorithms Using Symmetric Broadcast Networks

Abstract: In a distributed-computing environment, it is important to ensure that the processor work-

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
9
0

Year Published

2003
2003
2011
2011

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 15 publications
(9 citation statements)
references
References 24 publications
0
9
0
Order By: Relevance
“…2. The effective speeds (SpeedWS i ) of all workstations are computed by (17) where N is the number of slave processes. 3.…”
Section: Performing Redistributionmentioning
confidence: 99%
See 1 more Smart Citation
“…2. The effective speeds (SpeedWS i ) of all workstations are computed by (17) where N is the number of slave processes. 3.…”
Section: Performing Redistributionmentioning
confidence: 99%
“…However, the possible dependency of the optimal threshold on the task size was not considered. In [17], two thresholds were employed in determining whether load balancing is to be carried out. The performance of the dynamic load balancing algorithm depends on the chosen values of the two thresholds.…”
Section: Introductionmentioning
confidence: 99%
“…SBN (Symmetric Broadcast Networks) provides communication patterns among nodes in a topology-independent manner. It also needs log 2 v round message interchange and the communication complexity is 2v  ðlog 2 vÞ 2 [2,3]. These two methods works only when v ¼ 2 d for a natural number d. The algorithm based on SBIBD (Symmetric Balanced Incomplete Block Design) requires only two round message exchange and communication complexity is about 2v ffiffi ffi v p [8].…”
Section: Introductionmentioning
confidence: 98%
“…Based on SBN (Symmetric Broadcast Networks), communication patterns between nodes are constructed. It also needs O(v 2 ) communication complexity for collecting workload information from all the nodes and a communication path is O(log 2 v) [9,10].…”
Section: Introductionmentioning
confidence: 99%