知识卡片
队列稳定需要处理余量
设每项平均处理s秒、并行c个工作者、平均每a秒到一项,简化稳定条件是s/c,即到达率小于总处理率。相等时缺少吸收随机波动和积压的余量;限并行度虽节省资源,却增加等待。监控到达、服务时间和积压年龄后再扩缩容,不能用只看CPU替代队列目标。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- Chapter 11. Work Queue Systems · 查看原书依据
If we are processing work items in parallel, we also divide the processing time for a work item by the parallelism. For example, if each item takes one minute to process but we process four items in parallel, the effective time to process one item is 15 seconds,
参考来源
- 位置:《Designing Distributed Systems, 2nd Edition》第11章《Chapter 11. Work Queue Systems》(来源项目 book-sources;源文件:extracted/Designing Distributed Systems, 2nd Edition/_epub-src/OEBPS/ch11.html)
- 结论依据:原文比较快于、等于、慢于到达间隔并解释并行度作用;原文items/24h是速率而非时间间隔,卡片统一量纲。
- 原始内容:If we are processing work items in parallel, we also divide the processing time for a work item by the parallelism. For example, if each item takes one minute to process but we process four items in parallel, the effective time to process one item is 15 seconds,