Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Randomized load balancing by joining and splitting bins

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

DOI10.1016/J.IPL.2012.01.003zbMATH Open1243.68322OpenAlexW2043098260MaRDI QIDQ436309FDOQ436309


Authors: James Aspnes, Yitong Yin Edit this on Wikidata


Publication date: 20 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.01.003




Recommendations

  • Perfectly balanced allocation
  • Randomized allocation processes
  • Balanced Allocation: Patience Is Not a Virtue
  • On the analysis of randomized load balancing schemes
  • Balanced allocations (extended abstract)


zbMATH Keywords

randomized algorithmsload balancing


Mathematics Subject Classification ID

Randomized algorithms (68W20) Computer system organization (68M99)


Cites Work

  • A communication efficient probabilistic algorithm for mining frequent itemsets from a peer‐to‐peer network
  • Title not available (Why is that?)


Cited In (1)

  • Dynamic load balancing by random matchings





This page was built for publication: Randomized load balancing by joining and splitting bins

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:436309&oldid=12311716"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 04:04. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki