栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 前沿技术 > 大数据 > 大数据系统

kafka分区消费计算

kafka分区消费计算

int numPartitionsPerConsumer = numPartitionsForTopic / consumersForTopic.size();
 int consumersWithExtraPartition = numPartitionsForTopic % consumersForTopic.size();

 List partitions = AbstractPartitionAssignor.partitions(topic, numPartitionsForTopic);
 for (int i = 0, n = consumersForTopic.size(); i < n; i++) {
     int start = numPartitionsPerConsumer * i + Math.min(i, consumersWithExtraPartition);
     int length = numPartitionsPerConsumer + (i + 1 > consumersWithExtraPartition ? 0 : 1);
     assignment.get(consumersForTopic.get(i).memberId).addAll(partitions.subList(start, start + length));
 }

利用除数和余数得到结果
比如5个分区,3个消费者
分区:01234
消费:
01
23
4


public class KafkaPartitionTest {

    public static void main(String[] args) {

        int numPartitionsForTopic = 5;
        int consumersForTopicSize = 3;
        int numPartitionsPerConsumer = numPartitionsForTopic / consumersForTopicSize;
        int consumersWithExtraPartition = numPartitionsForTopic % consumersForTopicSize;

        //List partitions = AbstractPartitionAssignor.partitions(topic, numPartitionsForTopic);
        for (int i = 0, n = consumersForTopicSize; i < n; i++) {
            int start = numPartitionsPerConsumer * i + Math.min(i, consumersWithExtraPartition);
            int length = numPartitionsPerConsumer + (i + 1 > consumersWithExtraPartition ? 0 : 1);
            //assignment.get(consumersForTopic.get(i).memberId).addAll(partitions.subList(start, start + length));
            System.out.println("start:" + start);
            System.out.println("start + length:" + (start + length));
        }
    }
}
转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/742154.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号