Achieving Optimal Backlog in the Vanilla Multi-Processor Cup Game

DOI10.1137/1.9781611975994.96OpenAlexW3003073781MaRDI QIDQ5146874

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)

Related Items

Perpetual maintenance of machines with different urgency requirements, The matroid cup game, Cutting bamboo down to size