Self-stabilizing balls and bins in batches: The power of leaky bins

A fundamental problem in distributed computing is the distribution of requests to a set of uniform servers without a centralized controller. Classically, such problems are modelled as static balls into bins processes, where m balls (tasks) are to be distributed among n bins (servers). In a seminal w...

Full description

Saved in:
Bibliographic Details
Main Authors: Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Lars Nagel, Chris Wastell
Format: Default Article
Published: 2018
Subjects:
Other information and computing sciences not elsewhere classified
Balls-into-bins
Self-stabilizing
2-choice
Positive recurrent
Maximum load
Information and Computing Sciences not elsewhere classified
Online Access:https://hdl.handle.net/2134/28244
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://hdl.handle.net/2134/28244

Similar Items