Parallel Balanced Allocations: The Heavily Loaded Case

@article{Lenzen2019ParallelBA,
  title={Parallel Balanced Allocations: The Heavily Loaded Case},
  author={Christoph Lenzen and Merav Parter and Eylon Yogev},
  journal={The 31st ACM Symposium on Parallelism in Algorithms and Architectures},
  year={2019}
}
  • Christoph Lenzen, Merav Parter, Eylon Yogev
  • Published in SPAA '19 2019
  • Computer Science
  • The 31st ACM Symposium on Parallelism in Algorithms and Architectures
  • We study parallel algorithms for the classical balls-into-bins problem, in which m balls acting in parallel as separate agents are placed into n bins. Algorithms operate in synchronous rounds, in each of which balls and bins exchange messages once. The goal is to minimize the maximal load over all bins using a small number of rounds and few messages. While the case of $m=n$ balls has been extensively studied, little is known about the heavily loaded case. In this work, we consider parallel… CONTINUE READING

    References

    Publications referenced by this paper.

    1942

    • C. G. Esseen
    • On the Liapunoff limit of error in the theory of probability. Ark. Mat. Astron. Fys. A28, 9
    • 1942
    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL