Load balancing algorithms based on gradient methods and their analysis through algebraic graph theory

DOI10.1016/J.JPDC.2007.09.001zbMATH Open1243.68224OpenAlexW1969210088MaRDI QIDQ436672FDOQ436672

Authors: Andrey G. Bronevich, Wolfgang Meyer 

Publication date: 26 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2007.09.001

Recommendations

• scientific article; zbMATH DE number 1305097
• Quasi-static load balancing in local area networks
• Publication:4945781
• Ultra-fast load balancing on scale-free networks
• Efficient schemes for nearest neighbor load balancing

zbMATH Keywords

gradient methodsLaplacianalgebraic graph theoryload balancing algorithms

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Analysis of the generalized dimension exchange method for dynamic load balancing
• Title not available (Why is that?)
• Iterative Dynamic Load Balancing in Multicomputers
• Dynamic load balancing for parallelized particle simulations on MIMD computers

Cited In (5)

• Fourier analysis for solving the load balancing problem
• Load balancing by graph coloring, an algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• KELLEY

This page was built for publication: Load balancing algorithms based on gradient methods and their analysis through algebraic graph theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436672)