Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/28403

Title: Self-stabilizing balls & bins in batches: The power of leaky bins [Extended Abstract]
Authors: Berenbrink, Petra
Friedetzky, Tom
Kling, Peter
Mallmann-Trenn, Frederik
Nagel, Lars
Wastell, Chris
Issue Date: 2016
Publisher: © the Authors. Published by ACM
Citation: BERENBRINK, P. ...et al., 2016. Self-stabilizing balls & bins in batches: The power of leaky bins [Extended Abstract]. IN: Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (PODC '16), New York, 25-28th July, pp. 83-92.
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 seminal work, Azar et al. [4] proposed the sequential strategy Greedy[d] for n = m. When thrown, a ball queries the load of d random bins and is allocated to a least loaded of these. Azar et al. showed that d = 2 yields an exponential improvement compared to d = 1. Berenbrink et al. [7] extended this to m ≫ n, showing that the maximal load difference is independent of m for d = 2 (in contrast to d = 1). We propose a new variant of an infinite balls into bins process. In each round an expected number of n new balls arrive and are distributed (in parallel) to the bins and each non-empty bin deletes one of its balls. This setting models a set of servers processing incoming requests, where clients can query a server's current load but receive no information about parallel requests. We study the Greedy[d] distribution scheme in this setting and show a strong self-stabilizing property: For any arrival rate λ = λ(n) < 1, the system load is time-invariant. Moreover, for any (even superexponential) round t, the maximum system load is (w.h.p.) O ( 1/1-λ · log n/1-λ ) for d = 1 and O(log n/1-λ) for d = 2. In particular, Greedy[2] has an exponentially smaller system load for high arrival rates.
Description: {© the Authors. Published by ACM {2016}. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in https://doi.org/10.1145/2933057.2933092
Sponsor: Petra Berenbrink is supported by the Natural Sciences and Engineering Research Council of Canada (NSERC). Peter Kling is partly supported by the Natural Sciences and Engi- neering Research Council of Canada (NSERC) and the Pacific Institute for the Mathematical Sciences (PIMS). Lars Nagel is supported by the German Ministry of Education and Research under Grant 01IH13004. Christopher Wastell is supported by EPSRC.
Version: Accepted for publication
DOI: 10.1145/2933057.2933092
URI: https://dspace.lboro.ac.uk/2134/28403
Publisher Link: https://doi.org/10.1145/2933057.2933092
ISBN: 9781450339643
Appears in Collections:Conference Papers and Presentations (Computer Science)

Files associated with this item:

File Description SizeFormat
Nagel_Self-stabilizingBallsAndBinsInBatches.pdfAccepted version710.47 kBAdobe PDFView/Open


SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.