The Average Diffusion method for the load balancing problem

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper proposes the Average Diffusion (ADF) method for solving the load balancing problem. It is shown that a sufficient and necessary condition for the ADF method to converge to the uniform distribution of loads is the induced network of processors to be d-regular, connected and not bipartite. Next, we proceed and apply Fourier analysis determining the convergence factor γ in terms of the diffusion parameters cij (weighted case) when the network of processors is a ring and 2D-torus. It is shown that cij = 1/2 and cij ∈ (0, 1/2) when the network is a ring and 2D-torus, respectively, thus solving partially the open problem which concerns the determination of the diffusion parameters cij. © 2002 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Karagiorgos, G., & Missirlis, N. M. (2002). The Average Diffusion method for the load balancing problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2329 LNCS, pp. 623–632). Springer Verlag. https://doi.org/10.1007/3-540-46043-8_63

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free