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

Balanced allocation: memory performance tradeoffs

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

DOI10.1214/11-AAP804zbMath1246.68163arXiv0901.1155OpenAlexW3100115274MaRDI QIDQ453251

Yury Makarychev, Itai Benjamini

Publication date: 19 September 2012

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0901.1155


zbMATH Keywords

load balancingballs-and-bins processmemory performance tradeoffs


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial probability (60C05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)


Related Items (1)

Long-term balanced allocation via thinning




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Balanced Allocations
  • Parallel randomized load balancing
  • Balanced Allocations: The Heavily Loaded Case




This page was built for publication: Balanced allocation: memory performance tradeoffs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:453251&oldid=12330179"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 04:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki