The variable-processor cup game
From MaRDI portal
Cites work
- Achieving optimal backlog in multi-processor cup games
- Achieving Optimal Backlog in the Vanilla Multi-Processor Cup Game
- Alphabet-dependent string searching with wexponential search trees
- Balanced scheduling toward loss-free packet queuing and delay fairness
- Bamboo garden trimming problem (perpetual maintenance of machines with different attendance urgency factors)
- Buffer size requirements under longest queue first
- Cache-adaptive algorithms
- Flushing Without Cascades
- scientific article; zbMATH DE number 432808 (Why is no real title available?)
- scientific article; zbMATH DE number 2079392 (Why is no real title available?)
- scientific article; zbMATH DE number 2119707 (Why is no real title available?)
- scientific article; zbMATH DE number 7788461 (Why is no real title available?)
- Improved dynamic dictionary matching
- Managing unbounded-length keys in comparison-driven data structures with applications to online indexing
- Maximizing throughput in multi-queue switches
- Nearly optimal perfectly periodic schedules
- On centralized smooth scheduling
- On queuing lengths in on-line switching
- On-line indexing for general alphabets via predecessor queries on subsets of an ordered list
- Proportionate progress: A notion of fairness in resource allocation
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- Smooth scheduling under variable rates or the analog-digital confinement game
- Streamed Graph Drawing and the File Maintenance Problem
This page was built for publication: The variable-processor cup game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229301)
