Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.apache.kafka.streams.processor.internals.assignment;
import java.util.Collection;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
import java.util.SortedMap;
import java.util.SortedSet;
import java.util.TreeMap;
import java.util.TreeSet;
import java.util.UUID;
import java.util.function.BiConsumer;
import java.util.function.BiPredicate;
import java.util.stream.Collectors;
import org.apache.kafka.streams.KeyValue;
import org.apache.kafka.streams.processor.TaskId;
import org.apache.kafka.streams.processor.internals.TopologyMetadata.Subtopology;
import org.apache.kafka.streams.processor.internals.assignment.RackAwareTaskAssignor.CostFunction;
public class BalanceSubtopologyGraphConstructor implements RackAwareGraphConstructor {
private final Map> tasksForTopicGroup;
public BalanceSubtopologyGraphConstructor(final Map> tasksForTopicGroup) {
this.tasksForTopicGroup = tasksForTopicGroup;
}
@Override
public int getSinkNodeID(
final List taskIdList,
final List clientList,
final Map> tasksForTopicGroup
) {
return clientList.size() + taskIdList.size() + clientList.size() * tasksForTopicGroup.size();
}
@Override
public int getClientNodeId(final int clientIndex, final List taskIdList, final List clientList, final int topicGroupIndex) {
return taskIdList.size() + clientList.size() * topicGroupIndex + clientIndex;
}
@Override
public int getClientIndex(final int clientNodeId, final List taskIdList, final List clientList, final int topicGroupIndex) {
return clientNodeId - taskIdList.size() - clientList.size() * topicGroupIndex;
}
private static int getSecondStageClientNodeId(final List taskIdList, final List clientList, final Map> tasksForTopicGroup, final int clientIndex) {
return taskIdList.size() + clientList.size() * tasksForTopicGroup.size() + clientIndex;
}
@Override
public Graph constructTaskGraph(
final List clientList,
final List taskIdList,
final Map clientStates,
final Map taskClientMap,
final Map originalAssignedTaskNumber,
final BiPredicate hasAssignedTask,
final CostFunction costFunction,
final int trafficCost,
final int nonOverlapCost,
final boolean hasReplica,
final boolean isStandby
) {
validateTasks(taskIdList);
final Graph graph = new Graph<>();
for (final TaskId taskId : taskIdList) {
for (final Entry clientState : clientStates.entrySet()) {
if (hasAssignedTask.test(clientState.getValue(), taskId)) {
originalAssignedTaskNumber.merge(clientState.getKey(), 1, Integer::sum);
}
}
}
constructEdges(
graph,
taskIdList,
clientList,
clientStates,
taskClientMap,
originalAssignedTaskNumber,
hasAssignedTask,
costFunction,
trafficCost,
nonOverlapCost,
hasReplica,
isStandby
);
// Run max flow algorithm to get a solution first
final long maxFlow = graph.calculateMaxFlow();
if (maxFlow != taskIdList.size()) {
throw new IllegalStateException("max flow calculated: " + maxFlow + " doesn't match taskSize: " + taskIdList.size());
}
return graph;
}
@Override
public boolean assignTaskFromMinCostFlow(
final Graph graph,
final List clientList,
final List taskIdList,
final Map clientStates,
final Map originalAssignedTaskNumber,
final Map taskClientMap,
final BiConsumer assignTask,
final BiConsumer unAssignTask,
final BiPredicate hasAssignedTask
) {
final SortedMap> sortedTasksForTopicGroup = new TreeMap<>(tasksForTopicGroup);
final Set taskIdSet = new HashSet<>(taskIdList);
int taskNodeId = 0;
int topicGroupIndex = 0;
int tasksAssigned = 0;
boolean taskMoved = false;
for (final Entry> kv : sortedTasksForTopicGroup.entrySet()) {
final SortedSet taskIds = new TreeSet<>(kv.getValue());
for (final TaskId taskId : taskIds) {
if (!taskIdSet.contains(taskId)) {
continue;
}
final KeyValue movedAndAssigned = assignTaskToClient(graph, taskId, taskNodeId, topicGroupIndex,
clientStates, clientList, taskIdList, taskClientMap, assignTask, unAssignTask);
taskMoved |= movedAndAssigned.key;
tasksAssigned += movedAndAssigned.value;
taskNodeId++;
}
topicGroupIndex++;
}
validateAssignedTask(taskIdList, tasksAssigned, clientStates, originalAssignedTaskNumber, hasAssignedTask);
return taskMoved;
}
private void validateTasks(final List taskIdList) {
final Set tasksInSubtopology = tasksForTopicGroup.values().stream().flatMap(
Collection::stream).collect(Collectors.toSet());
for (final TaskId taskId : taskIdList) {
if (!tasksInSubtopology.contains(taskId)) {
throw new IllegalStateException("Task " + taskId + " not in tasksForTopicGroup");
}
}
}
private void constructEdges(
final Graph graph,
final List taskIdList,
final List clientList,
final Map clientStates,
final Map taskClientMap,
final Map originalAssignedTaskNumber,
final BiPredicate hasAssignedTask,
final CostFunction costFunction,
final int trafficCost,
final int nonOverlapCost,
final boolean hasReplica,
final boolean isStandby
) {
final Set taskIdSet = new HashSet<>(taskIdList);
final SortedMap> sortedTasksForTopicGroup = new TreeMap<>(tasksForTopicGroup);
final int sinkId = getSinkNodeID(taskIdList, clientList, tasksForTopicGroup);
int taskNodeId = 0;
int topicGroupIndex = 0;
for (final Entry> kv : sortedTasksForTopicGroup.entrySet()) {
final SortedSet taskIds = new TreeSet<>(kv.getValue());
for (int clientIndex = 0; clientIndex < clientList.size(); clientIndex++) {
final UUID processId = clientList.get(clientIndex);
final int clientNodeId = getClientNodeId(clientIndex, taskIdList, clientList, topicGroupIndex);
int startingTaskNodeId = taskNodeId;
int validTaskCount = 0;
for (final TaskId taskId : taskIds) {
// It's possible some taskId is not in the tasks we want to assign. For example, taskIdSet is only stateless tasks,
// but the tasks in subtopology map contains all tasks including stateful ones.
if (!taskIdSet.contains(taskId)) {
continue;
}
validTaskCount++;
final boolean inCurrentAssignment = hasAssignedTask.test(clientStates.get(processId), taskId);
graph.addEdge(startingTaskNodeId, clientNodeId, 1, costFunction.getCost(taskId, processId, inCurrentAssignment, trafficCost, nonOverlapCost, isStandby), 0);
startingTaskNodeId++;
if (inCurrentAssignment) {
if (!hasReplica && taskClientMap.containsKey(taskId)) {
throw new IllegalArgumentException("Task " + taskId + " assigned to multiple clients "
+ processId + ", " + taskClientMap.get(taskId));
}
taskClientMap.put(taskId, processId);
}
}
if (validTaskCount > 0) {
final int secondStageClientNodeId = getSecondStageClientNodeId(taskIdList,
clientList, tasksForTopicGroup, clientIndex);
final int capacity =
originalAssignedTaskNumber.containsKey(processId) ?
(int) Math.ceil(originalAssignedTaskNumber.get(processId) * 1.0 / taskIdList.size() * validTaskCount) : 0;
graph.addEdge(clientNodeId, secondStageClientNodeId, capacity, 0, 0);
}
}
taskNodeId += (int) taskIds.stream().filter(taskIdSet::contains).count();
topicGroupIndex++;
}
// Add edges from source to all tasks
taskNodeId = 0;
for (final Entry> kv : sortedTasksForTopicGroup.entrySet()) {
final SortedSet taskIds = new TreeSet<>(kv.getValue());
for (final TaskId taskId : taskIds) {
if (!taskIdSet.contains(taskId)) {
continue;
}
graph.addEdge(SOURCE_ID, taskNodeId, 1, 0, 0);
taskNodeId++;
}
}
// Add sink
for (int clientIndex = 0; clientIndex < clientList.size(); clientIndex++) {
final UUID processId = clientList.get(clientIndex);
final int capacity = originalAssignedTaskNumber.getOrDefault(processId, 0);
final int secondStageClientNodeId = getSecondStageClientNodeId(taskIdList, clientList, tasksForTopicGroup, clientIndex);
graph.addEdge(secondStageClientNodeId, sinkId, capacity, 0, 0);
}
graph.setSourceNode(SOURCE_ID);
graph.setSinkNode(sinkId);
}
}
