Self-stabilizing balls & bins in batches: The power of leaky bins [Extended Abstract]

© 2016 ACM. 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 to n bins (servers). In a...

Full description

Bibliographic Details

Main Authors:	Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Lars Nagel, Chris Wastell
Format:	Default Conference proceeding
Published:	2016
Subjects:	Other information and computing sciences not elsewhere classified untagged Information and Computing Sciences not elsewhere classified
Online Access:	https://hdl.handle.net/2134/28403
Tags:	Add Tag No Tags, Be the first to tag this record!