1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
|
// Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
package com.yahoo.vespa.model.search;
import com.yahoo.vespa.model.SimpleConfigProducer;
import com.yahoo.vespa.model.content.DispatchSpec;
import java.util.ArrayList;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
/**
* Class used to build the mid-level dispatch groups in an indexed content cluster.
*
* @author geirst
*/
public class DispatchGroupBuilder {
private final SimpleConfigProducer dispatchParent;
private final DispatchGroup rootDispatch;
private final IndexedSearchCluster searchCluster;
public DispatchGroupBuilder(SimpleConfigProducer dispatchParent,
DispatchGroup rootDispatch,
IndexedSearchCluster searchCluster) {
this.dispatchParent = dispatchParent;
this.rootDispatch = rootDispatch;
this.searchCluster = searchCluster;
}
public void build(List<DispatchSpec.Group> groupsSpec, List<SearchNode> searchNodes) {
Map<Integer, SearchNode> searchNodeMap = buildSearchNodeMap(searchNodes);
for (int partId = 0; partId < groupsSpec.size(); ++partId) {
DispatchSpec.Group groupSpec = groupsSpec.get(partId);
DispatchGroup group = new DispatchGroup(searchCluster);
populateDispatchGroup(group, groupSpec.getNodes(), searchNodeMap, partId);
}
}
private void populateDispatchGroup(DispatchGroup group,
List<DispatchSpec.Node> nodeList,
Map<Integer, SearchNode> searchNodesMap,
int partId) {
for (int rowId = 0; rowId < nodeList.size(); ++rowId) {
int distributionKey = nodeList.get(rowId).getDistributionKey();
SearchNode searchNode = searchNodesMap.get(distributionKey);
// Note: the rowId in this context will be the partId for the underlying search node.
group.addSearcher(buildSearchInterface(searchNode, rowId));
}
}
private static SearchInterface buildSearchInterface(SearchNode searchNode, int partId) {
searchNode.updatePartition(partId); // ensure that search node uses the same partId as dispatch sees
return new SearchNodeWrapper(new NodeSpec(0, partId), searchNode);
}
private static Map<Integer, SearchNode> buildSearchNodeMap(List<SearchNode> searchNodes) {
Map<Integer, SearchNode> retval = new LinkedHashMap<>();
for (SearchNode node : searchNodes) {
retval.put(node.getDistributionKey(), node);
}
return retval;
}
public static List<DispatchSpec.Group> createDispatchGroups(List<SearchNode> searchNodes,
int numDispatchGroups) {
if (numDispatchGroups > searchNodes.size())
numDispatchGroups = searchNodes.size();
List<DispatchSpec.Group> groupsSpec = new ArrayList<>();
int numNodesPerGroup = searchNodes.size() / numDispatchGroups;
if (searchNodes.size() % numDispatchGroups != 0) {
numNodesPerGroup += 1;
}
int searchNodeIdx = 0;
for (int i = 0; i < numDispatchGroups; ++i) {
DispatchSpec.Group groupSpec = new DispatchSpec.Group();
for (int j = 0; j < numNodesPerGroup && searchNodeIdx < searchNodes.size(); ++j) {
groupSpec.addNode(new DispatchSpec.Node(searchNodes.get(searchNodeIdx++).getDistributionKey()));
}
groupsSpec.add(groupSpec);
}
assert(searchNodeIdx == searchNodes.size());
return groupsSpec;
}
}
|
