Achieving Optimal Backlog in the Vanilla Multi-Processor Cup Game

DOI10.1137/1.9781611975994.96MaRDI QIDQ5146874zbMATH OpenOpenAlexFDO

Authors William Kuszmaul

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1910.13533

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(5)

• The matroid cup game
• Cutting bamboo down to size
• Achieving optimal backlog in multi-processor cup games
• Perpetual maintenance of machines with different urgency requirements
• The variable-processor cup game

This page was built for publication: Achieving Optimal Backlog in the Vanilla Multi-Processor Cup Game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146874)