Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Dynamic averaging load balancing on cycles

From MaRDI portal
Publication:2118388
Jump to:navigation, search

DOI10.1007/s00453-021-00905-9OpenAlexW4205540997MaRDI QIDQ2118388

Amirmojtaba Sabour, Giorgi Nadiradze, Dan Alistarh

Publication date: 22 March 2022

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-021-00905-9

zbMATH Keywords

algorithmsload balancing


Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)




Cites Work

  • Dynamic load balancing by random matchings
  • Approximate counting, uniform generation and rapidly mixing Markov chains
  • First- and second-order diffusive methods for rapid, coarse, distributed load balancing
  • Randomized allocation processes
  • Balanced allocations
  • Graphical balanced allocations and the (1 + β)-choice process
  • Balanced Allocations
  • Balanced Allocations: A Simple Proof for the Heavily Loaded Case
  • The Power of Choice in Priority Scheduling
  • THE MAXIMUM CONNECTIVITY OF A GRAPH
  • An Analysis of Random-Walk Cuckoo Hashing
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2118388&oldid=14609994"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 23:23.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki