arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~

重新思考服务核心网络栈中的轮询效率

Rethinking Polling Efficiency in Service Core Network Stacks

Matheus Stolet, Simon Peter, Antoine Kaufmann

arXiv 2607.16408首次发表:更新:

AI 中文总结

研究服务核心网络栈轮询效率,通过对AMD EPYC处理器测量,发现回收闲置核心收益低且增加调度复杂度,进而提出以预算为中心的观点,将功率作为基本资源,等待策略作为首要系统设计选择。

AI 中文摘要

闲置的网络服务核心被视为计算资源的浪费。这一假设促使越来越复杂的机制在微秒级时间尺度上回收闲置核心。我们认为这种观点已不再符合现代服务器硬件情况。在当代多核处理器上,活跃核心会争夺共享的封装级功率和热预算。一旦该预算成为限制资源,高效等待的闲置核心能返还计算能力,供硬件重新分配用于生产工作。对近期AMD EPYC处理器的测量表明等待策略、处理器拓扑和闲置持续时间如何决定这种权衡。我们的结果表明回收闲置核心往往收益比通常假设的要少,同时还会引入大量调度复杂性。我们提出一种以预算为中心的服务核心系统观点,其中功率而非核心占用成为基本资源,等待策略成为首要的系统设计选择。

英文摘要

Idle network service cores are treated as wasted compute. This assumption motivates increasingly sophisticated mechanisms that reclaim idle cores at microsecond timescales. We argue that this view no longer matches modern server hardware. On contemporary multicore processors, active cores compete for a shared package level power and thermal budget. Once that budget becomes the limiting resource, an idle core that waits efficiently returns compute capacity that hardware can redistribute to productive work. Measurements on a recent AMD EPYC processor show how waiting strategy, processor topology, and idle duration determine this tradeoff. Our results suggest that reclaiming idle cores often yields less benefit than commonly assumed while introducing substantial scheduling complexity. We propose a budget centric view of service core systems in which power, rather than core occupancy, becomes the fundamental resource and waiting policy becomes a first class systems design choice.

论文原文

arXiv 摘要页 · PDF 原文 · HTML 原文

↑