Remarks on dynamic load balancing of integer loads and integral graphs

DOI10.1016/J.AMC.2013.10.053MaRDI QIDQ505711zbMATH OpenOpenAlexFDO

Authors Dragan Stevanović

Publication date 26 January 2017

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2013.10.053

zbMATH Keywords

dynamic load balancingintegral graphsunit size tokens

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Discrete load balancing is (almost) as easy as continuous load balancing
• scientific article; zbMATH DE number 4130424
• scientific article; zbMATH DE number 1424534
• A simple approach for adapting continuous load balancing processes to discrete settings
• Graphs for small multiprocessor interconnection networks

Cites work

• Efficient schemes for nearest neighbor load balancing
• Graphs for small multiprocessor interconnection networks
• Graphs with least eigenvalue -2; the eigenspace of the eigenvalue -2
• scientific article; zbMATH DE number 1196829 (Why is no real title available?)

Cited in

(3)

• Load balancing for Markov chains with a specified directed graph
• scientific article; zbMATH DE number 4130424 (Why is no real title available?)
• scientific article; zbMATH DE number 975375 (Why is no real title available?)

This page was built for publication: Remarks on dynamic load balancing of integer loads and integral graphs

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