This research paper introduces a novel scheduling algorithm designed for multi-class, parallel-server queuing systems. The algorithm addresses the challenge of balancing reward maximization with queue stability, a critical factor for network system applications. It employs a weighted proportional fair criterion combined with marginal costs and a specialized bandit algorithm for bilinear rewards, offering a tradeoff between regret and queue length. AI
IMPACT This research could improve resource allocation and efficiency in network systems by optimizing job scheduling.
RANK_REASON The item is an academic paper on arXiv detailing a new algorithm. [lever_c_demoted from research: ic=1 ai=0.7]
- alphaXiv
- arXiv
- Bibliographic Explorer
- CatalyzeX Code Finder for Papers
- Connected Papers
- cs.LG
- DagsHub
- Gotit.pub
- Hugging Face
- Jung-Hun Kim
- Litmaps
- scite Smart Citations
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →
