Skip to main content
Conference ProceedingsOPEN ACCESS

Optimum diffusion for load balancing in mesh networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6271 LNCS(PART 1) 230-241
DOI: 10.1007/978-3-642-15277-1_22
3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper studies the Diffusion method for the load balancing problem in case of weighted mesh graphs. Closed form formulae for the optimum values of the edge weights are determined using local Fourier analysis. It is shown that an extrapolated version of Diffusion (EDF) can become twice as fast for orthogonal mesh graphs. Also, as a byproduct of our analysis it is shown that EDF on tori is four times faster than on meshes. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Markomanolis, G. S., & Missirlis, N. M. (2010). Optimum diffusion for load balancing in mesh networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6271 LNCS, pp. 230–241). https://doi.org/10.1007/978-3-642-15277-1_22

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