Toward Optimal Diffusion Matrices

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 paper we consider common interconnection topologies and demonstrate, how optimal edge weights can be calculated for the First and Second Order Diffusion Schemes. Using theoretical analysis and practical experiments we show, what improvements can be archived on selected networks. Keywords. load balancing, diffusion, eigenvalues, FOS, SOS, hypercubic networks

• Type: Conference
• Year: 2002
• Where: IPPS
• Authors: Robert Elsässer, Burkhard Monien, Günter Rote, Stefan Schamberger
• Keywords: Distributed And Parallel Computing, Edge Weighted Graphs, IPPS 2002, Load Balancing Algorithms, Order Diffusion Schemes