新算法解决并行服务器队列中的调度问题

作者 PulseAugur 编辑部 · [1 个来源] · 2026-07-14 04:00

本研究论文介绍了一种新颖的调度算法，专为多类并行服务器队列系统设计。该算法解决了在最大化奖励与队列稳定性之间取得平衡的挑战，这是网络系统应用的关键因素。它采用了加权比例公平准则，结合边际成本和一种专门用于双线性奖励的赌博机算法，提供了在遗憾和队列长度之间的权衡。 AI

影响这项研究通过优化作业调度，有望提高网络系统的资源分配和效率。

排序理由该条目是arXiv上的一篇学术论文，详细介绍了一种新算法。[lever_c_demoted from research: ic=1 ai=0.7]

AI 生成摘要 · Google Gemini · 来自 1 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 0 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 该条目是arXiv上的一篇学术论文，详细介绍了一种新算法。[lever_c_demoted from research: ic=1 ai=0.7]
Source corroboration: Single-source cluster; Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics: paper, other; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: High; Clearly on-topic for AI-industry coverage.
Story freshness: 78 days old; Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

完整方法见我们的编辑标准。

arXiv cs.LG TIER_1 English(EN) · Jung-hun Kim, Milan Vojnovic · 2026-07-14 04:00

具有随机双线性奖励的并行服务器队列学习调度

arXiv:2112.06362v5 Announce Type: replace Abstract: We consider the problem of scheduling in multi-class, parallel-server queuing systems with uncertain rewards from job-server assignments. In this scenario, jobs incur holding costs while awaiting completion, and job-server assig…