知识卡片
分区分配的状态代价
分配器需要平衡分区、响应实例加入或离开,并满足共分区约束。轮询便于均摊数量;静态分配减少状态迁移但可能等待失联实例恢复;自定义算法可使用lag等外部信号。状态越大,迁移与恢复越贵,因此不能只比较分区数量,须同时考虑热点、处理能力和重新平衡停顿。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- Event-Driven Processing Basics · 查看原书依据
The goal of a partition assignment algorithm is to ensure that partitions are evenly distributed across the consumer instances, assuming that the consumer instances are equal in processing capabilities. A partition assignment algorithm may also have secondary goals, such as reducing the number of partitions reassigned during a rebalance. This is particularly important when you are dealing with materialized state sharded across multiple data store instances, as the reassignment of
参考来源
- 位置:《Building Event-Driven Microservices Leveraging Organizational Data at Scale (Adam Bellemare)》第05章《Event-Driven Processing Basics》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Building Event-Driven Microservices Leveraging Organizational Data at Scale (Adam Bellemare)/_epub-src/OEBPS/ch05.xhtml;规范化段落起句:The goal of a partition assignment algorithm)
- 结论依据:原文对该对象的定义、运行说明或对比支持以下归纳:分配器需要平衡分区、响应实例加入或离开,并满足共分区约束。本卡同时保留其适用条件与失败边界。
- 原始内容:The goal of a partition assignment algorithm is to ensure that partitions are evenly distributed across the consumer instances, assuming that the consumer instances are equal in processing capabilities. A partition assignment algorithm may also have secondary goals, such as reducing the number of partitions reassigned during a rebalance. This is particularly important when you are dealing with materialized state sharded across multiple data store instances, as the reassignment of