Achieving optimal backlog in multi-processor cup games

@article{Bender2019AchievingOB,
  title={Achieving optimal backlog in multi-processor cup games},
  author={Michael A. Bender and Martin Farach-Colton and William Kuszmaul},
  journal={ArXiv},
  year={2019},
  volume={abs/1904.02861}
}
  • Michael A. Bender, Martin Farach-Colton, William Kuszmaul
  • Published in STOC 2019
  • Mathematics, Computer Science
  • Many problems in processor scheduling, deamortization, and buffer management can be modeled as single- and multi-processor cup games. At the beginning of the single-processor n-cup game, all cups are empty. In each step of the game, a filler distributes 1−є units of water among the cups, and then an emptier selects a cup and removes up to 1 unit of water from it. The goal of the emptier is to minimize the amount of water in the fullest cup, also known as the backlog. The greedy algorithm (i.e… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    3
    Twitter Mentions

    Citations

    Publications citing this paper.
    SHOWING 1-2 OF 2 CITATIONS

    Achieving Optimal Backlog in the Vanilla Multi-Processor Cup Game

    VIEW 10 EXCERPTS
    CITES BACKGROUND, RESULTS & METHODS

    References

    Publications referenced by this paper.
    SHOWING 1-6 OF 6 REFERENCES

    A proportionate fair scheduling rule with good worst-case performance

    VIEW 10 EXCERPTS
    HIGHLY INFLUENTIAL

    Persistence

    • P. F. Dietz, R. Raman
    • amortization and randomization. In Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 78–88
    • 1991
    VIEW 10 EXCERPTS
    HIGHLY INFLUENTIAL

    Two algorithms for maintaining order in a list

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL