跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.13750 · v1

List Update with Per-Page Maximum Delay

首次提交 2026-11-10 16:51
版本更新 2026-11-10 16:51
雷达观测 2026-11-11 11:04
arXiv ↗PDF ↗

摘要

We study list update with per-page maximum delay. Requests may wait, and one access clears all pending requests of a page at its current list rank, paying their maximum waiting penalty. Each service can change the permutation and therefore the cost of later accesses. We give a strictly 55-competitive deterministic algorithm: serve a page when the oldest waiting time reaches two thirds of its current rank, then move it to the front. Our main tool is an asynchronous marked-rank coupling that compares different list orders and different service histories. A temporal transfer principle separates this permutation argument from two waiting-cost inequalities. It gives factor 55 for page-specific superadditive penalties, common calendar rates, and additional hard deadlines; deadlines alone admit factor 33. Two structural conditions on request-specific penalties give factor 3+2κ3+2κ. In particular, nonincreasing request severity retains factor 55 even with unbounded weight ratios. For linear delay, offline optimization is NP-complete but fixed-parameter tractable in the number of pages. We characterize fixed-list batching, show an Ω(m)Ω(m) gap between the best static order and dynamic reordering, and prove that the optimal deterministic factor for one page is exactly 22. Counterexamples delineate the threshold rule's scope.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-10 16:51 · 最新观测版本

List Update with Per-Page Maximum Delay

We study list update with per-page maximum delay. Requests may wait, and one access clears all pending requests of a page at its current list rank, paying their maximum waiting penalty. Each service can change the permutation and therefore the cost of later accesses. We give a strictly 55-competitive deterministic algorithm: serve a page when the oldest waiting time reaches two thirds of its current rank, then move it to the front. Our main tool is an asynchronous marked-rank coupling that compares different list orders and different service histories. A temporal transfer principle separates this permutation argument from two waiting-cost inequalities. It gives factor 55 for page-specific superadditive penalties, common calendar rates, and additional hard deadlines; deadlines alone admit factor 33. Two structural conditions on request-specific penalties give factor 3+2κ3+2κ. In particular, nonincreasing request severity retains factor 55 even with unbounded weight ratios. For linear delay, offline optimization is NP-complete but fixed-parameter tractable in the number of pages. We characterize fixed-list batching, show an Ω(m)Ω(m) gap between the best static order and dynamic reordering, and prove that the optimal deterministic factor for one page is exactly 22. Counterexamples delineate the threshold rule's scope.

查看此版本解读 →查看此版本原文 ↗