Matches in SemOpenAlex for { <https://semopenalex.org/work/W2982475410> ?p ?o ?g. }
Showing items 1 to 91 of
91
with 100 items per page.
- W2982475410 abstract "In each step of the $p$-processor cup game on $n$ cups, a filler distributes up to $p$ units of water among the cups, subject only to the constraint that no cup receives more than $1$ unit of water; an emptier then removes up to $1$ unit of water from each of $p$ cups. Designing strategies for the emptier that minimize backlog (i.e., the height of the fullest cup) is important for applications in processor scheduling, buffer management in networks, quality of service guarantees, and deamortization. We prove that the greedy algorithm (i.e., the empty-from-fullest-cups algorithm) achieves backlog $O(log n)$ for any $p ge 1$. This resolves a long-standing open problem for $p > 1$, and is asymptotically optimal as long as $n ge 2p$. If the filler is an oblivious adversary, then we prove that there is a randomized emptying algorithm that achieve backlog $O(log p + log log n)$ with probability $1 - 2^{-operatorname{polylog}(n)}$ for $2^{operatorname{polylog}(n)}$ steps. This is known to be asymptotically optimal when $n$ is sufficiently large relative to $p$. The analysis of the randomized algorithm can also be reinterpreted as a smoothed analysis of the deterministic greedy algorithm. Previously, the only known bound on backlog for $p > 1$, and the only known randomized guarantees for any $p$ (including when $p = 1$), required the use of resource augmentation, meaning that the filler can only distribute at most $p(1 - epsilon)$ units of water in each step, and that the emptier is then permitted to remove $1 + delta$ units of water from each of $p$ cups, for some $epsilon, delta > 0$." @default.
- W2982475410 created "2019-11-08" @default.
- W2982475410 creator A5005111940 @default.
- W2982475410 date "2019-10-29" @default.
- W2982475410 modified "2023-09-25" @default.
- W2982475410 title "Achieving Optimal Backlog in the Vanilla Multi-Processor Cup Game" @default.
- W2982475410 cites W1492077731 @default.
- W2982475410 cites W1628974215 @default.
- W2982475410 cites W164930620 @default.
- W2982475410 cites W1884472997 @default.
- W2982475410 cites W1935687795 @default.
- W2982475410 cites W1980436314 @default.
- W2982475410 cites W1998014198 @default.
- W2982475410 cites W1998482902 @default.
- W2982475410 cites W2003523151 @default.
- W2982475410 cites W2010063782 @default.
- W2982475410 cites W2025470700 @default.
- W2982475410 cites W2026511056 @default.
- W2982475410 cites W2039208882 @default.
- W2982475410 cites W2051392328 @default.
- W2982475410 cites W2056830486 @default.
- W2982475410 cites W2071632823 @default.
- W2982475410 cites W2083865199 @default.
- W2982475410 cites W2097145526 @default.
- W2982475410 cites W2104338317 @default.
- W2982475410 cites W2109488193 @default.
- W2982475410 cites W2111046894 @default.
- W2982475410 cites W2120234059 @default.
- W2982475410 cites W2127087946 @default.
- W2982475410 cites W2160702061 @default.
- W2982475410 cites W2165659786 @default.
- W2982475410 cites W2169152518 @default.
- W2982475410 cites W2568208948 @default.
- W2982475410 cites W2721925531 @default.
- W2982475410 cites W2964054046 @default.
- W2982475410 cites W2167661731 @default.
- W2982475410 hasPublicationYear "2019" @default.
- W2982475410 type Work @default.
- W2982475410 sameAs 2982475410 @default.
- W2982475410 citedByCount "0" @default.
- W2982475410 crossrefType "posted-content" @default.
- W2982475410 hasAuthorship W2982475410A5005111940 @default.
- W2982475410 hasConcept C102408133 @default.
- W2982475410 hasConcept C114614502 @default.
- W2982475410 hasConcept C126255220 @default.
- W2982475410 hasConcept C128669082 @default.
- W2982475410 hasConcept C134306372 @default.
- W2982475410 hasConcept C181789720 @default.
- W2982475410 hasConcept C206729178 @default.
- W2982475410 hasConcept C33923547 @default.
- W2982475410 hasConcept C41008148 @default.
- W2982475410 hasConcept C51823790 @default.
- W2982475410 hasConcept C77553402 @default.
- W2982475410 hasConceptScore W2982475410C102408133 @default.
- W2982475410 hasConceptScore W2982475410C114614502 @default.
- W2982475410 hasConceptScore W2982475410C126255220 @default.
- W2982475410 hasConceptScore W2982475410C128669082 @default.
- W2982475410 hasConceptScore W2982475410C134306372 @default.
- W2982475410 hasConceptScore W2982475410C181789720 @default.
- W2982475410 hasConceptScore W2982475410C206729178 @default.
- W2982475410 hasConceptScore W2982475410C33923547 @default.
- W2982475410 hasConceptScore W2982475410C41008148 @default.
- W2982475410 hasConceptScore W2982475410C51823790 @default.
- W2982475410 hasConceptScore W2982475410C77553402 @default.
- W2982475410 hasLocation W29824754101 @default.
- W2982475410 hasOpenAccess W2982475410 @default.
- W2982475410 hasPrimaryLocation W29824754101 @default.
- W2982475410 hasRelatedWork W1580324059 @default.
- W2982475410 hasRelatedWork W1948887950 @default.
- W2982475410 hasRelatedWork W1977752801 @default.
- W2982475410 hasRelatedWork W1985058615 @default.
- W2982475410 hasRelatedWork W1990511053 @default.
- W2982475410 hasRelatedWork W2034325394 @default.
- W2982475410 hasRelatedWork W2116579726 @default.
- W2982475410 hasRelatedWork W2143838916 @default.
- W2982475410 hasRelatedWork W2157071288 @default.
- W2982475410 hasRelatedWork W2242586777 @default.
- W2982475410 hasRelatedWork W2401684988 @default.
- W2982475410 hasRelatedWork W2508763465 @default.
- W2982475410 hasRelatedWork W2797688497 @default.
- W2982475410 hasRelatedWork W2912724849 @default.
- W2982475410 hasRelatedWork W2949716110 @default.
- W2982475410 hasRelatedWork W2979754689 @default.
- W2982475410 hasRelatedWork W3003073781 @default.
- W2982475410 hasRelatedWork W3090834346 @default.
- W2982475410 hasRelatedWork W40661443 @default.
- W2982475410 hasRelatedWork W2342616875 @default.
- W2982475410 isParatext "false" @default.
- W2982475410 isRetracted "false" @default.
- W2982475410 magId "2982475410" @default.
- W2982475410 workType "article" @default.