Name
Abstract | ||
|---|---|---|
Efficient load balancing algorithms are the key to many efficient parallel applications. Until now, research in this area has mainly been focusing on homogeneous schemes. However, observations show that the convergence rate of diffusion algorithms can be improved using edge weighted graphs without deteriorating the flows quality. In this pa- per we consider common interconnection topologies and demonstrate, how optimal edge weights can be calculated for the First and Second Order Diffusion Schemes. Us- ing theoretical analysis and practical experiments we show, what improvements can be archived on selected networks. |
Year | Venue | Keywords |
|---|---|---|
2002 | International Parallel and Distributed Processing Symposium/International Parallel Processing Symposium | diffusion,common interconnection topology,fos,edge weighted graph,optimal diffusion matrices,homogeneous scheme,hypercubic networks,eigenvalues,second order diffusion schemes,flows quality,sos,efficient parallel application,optimal edge weight,efficient load,convergence rate,diffusion algorithm,. load balancing,graph theory,parallel processing,second order,load balance,resource allocation |
DocType | ISBN | Citations |
Conference | 0-7695-1573-8 | 7 |
PageRank | References | Authors |
0.59 | 11 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert Elsässer | 1 | 63 | 6.54 |
| Burkhard Monien | 2 | 2199 | 279.35 |
| Günter Rote | 3 | 1181 | 129.29 |
| Stefan Schamberger | 4 | 193 | 12.74 |