optimize reroute
- optimize initialization of building the all the assigned shards state - optimize iteration in throttling allocation decider
This commit is contained in:
parent
cc1173b58f
commit
759a13f1de
|
@ -19,6 +19,7 @@
|
||||||
|
|
||||||
package org.elasticsearch.cluster.routing;
|
package org.elasticsearch.cluster.routing;
|
||||||
|
|
||||||
|
import com.google.common.base.Predicate;
|
||||||
import com.google.common.collect.ImmutableSet;
|
import com.google.common.collect.ImmutableSet;
|
||||||
import com.google.common.collect.Sets;
|
import com.google.common.collect.Sets;
|
||||||
import gnu.trove.map.hash.TObjectIntHashMap;
|
import gnu.trove.map.hash.TObjectIntHashMap;
|
||||||
|
@ -247,6 +248,20 @@ public class RoutingNodes implements Iterable<RoutingNode> {
|
||||||
return count;
|
return count;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
public List<MutableShardRouting> shards(Predicate<MutableShardRouting> predicate) {
|
||||||
|
List<MutableShardRouting> shards = newArrayList();
|
||||||
|
for (RoutingNode routingNode : this) {
|
||||||
|
List<MutableShardRouting> nodeShards = routingNode.shards();
|
||||||
|
for (int i = 0; i < nodeShards.size(); i++) {
|
||||||
|
MutableShardRouting shardRouting = nodeShards.get(i);
|
||||||
|
if (predicate.apply(shardRouting)) {
|
||||||
|
shards.add(shardRouting);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return shards;
|
||||||
|
}
|
||||||
|
|
||||||
public List<MutableShardRouting> shardsWithState(ShardRoutingState... state) {
|
public List<MutableShardRouting> shardsWithState(ShardRoutingState... state) {
|
||||||
List<MutableShardRouting> shards = newArrayList();
|
List<MutableShardRouting> shards = newArrayList();
|
||||||
for (RoutingNode routingNode : this) {
|
for (RoutingNode routingNode : this) {
|
||||||
|
|
|
@ -20,11 +20,13 @@
|
||||||
package org.elasticsearch.cluster.routing.allocation.allocator;
|
package org.elasticsearch.cluster.routing.allocation.allocator;
|
||||||
|
|
||||||
import com.google.common.base.Predicate;
|
import com.google.common.base.Predicate;
|
||||||
import com.google.common.collect.Iterables;
|
|
||||||
import org.apache.lucene.util.SorterTemplate;
|
import org.apache.lucene.util.SorterTemplate;
|
||||||
import org.elasticsearch.ElasticSearchIllegalArgumentException;
|
import org.elasticsearch.ElasticSearchIllegalArgumentException;
|
||||||
import org.elasticsearch.cluster.metadata.MetaData;
|
import org.elasticsearch.cluster.metadata.MetaData;
|
||||||
import org.elasticsearch.cluster.routing.*;
|
import org.elasticsearch.cluster.routing.MutableShardRouting;
|
||||||
|
import org.elasticsearch.cluster.routing.RoutingNode;
|
||||||
|
import org.elasticsearch.cluster.routing.RoutingNodes;
|
||||||
|
import org.elasticsearch.cluster.routing.ShardRoutingState;
|
||||||
import org.elasticsearch.cluster.routing.allocation.FailedRerouteAllocation;
|
import org.elasticsearch.cluster.routing.allocation.FailedRerouteAllocation;
|
||||||
import org.elasticsearch.cluster.routing.allocation.RoutingAllocation;
|
import org.elasticsearch.cluster.routing.allocation.RoutingAllocation;
|
||||||
import org.elasticsearch.cluster.routing.allocation.StartedRerouteAllocation;
|
import org.elasticsearch.cluster.routing.allocation.StartedRerouteAllocation;
|
||||||
|
@ -325,27 +327,20 @@ public class BalancedShardsAllocator extends AbstractComponent implements Shards
|
||||||
/**
|
/**
|
||||||
* Returns a new {@link NodeSorter} that sorts the nodes based on their
|
* Returns a new {@link NodeSorter} that sorts the nodes based on their
|
||||||
* current weight with respect to the index passed to the sorter. The
|
* current weight with respect to the index passed to the sorter. The
|
||||||
* returned sorter is not sorted. Use {@link NodeSorter#reset(String)}
|
* returned sorter is not sorted. Use {@link NodeSorter#reset(org.elasticsearch.cluster.routing.allocation.allocator.BalancedShardsAllocator.Operation, String)}
|
||||||
* to sort based on an index.
|
* to sort based on an index.
|
||||||
*/
|
*/
|
||||||
private NodeSorter newNodeSorter() {
|
private NodeSorter newNodeSorter() {
|
||||||
final NodeSorter sorter = new NodeSorter(nodesArray(), weight, this);
|
return new NodeSorter(nodesArray(), weight, this);
|
||||||
return sorter;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
private boolean initialize(RoutingNodes routing) {
|
private boolean initialize(RoutingNodes routing) {
|
||||||
Collection<MutableShardRouting> shards = new ArrayList<MutableShardRouting>();
|
|
||||||
if (logger.isTraceEnabled()) {
|
if (logger.isTraceEnabled()) {
|
||||||
logger.trace("Start distributing Shards");
|
logger.trace("Start distributing Shards");
|
||||||
}
|
}
|
||||||
|
|
||||||
for (IndexRoutingTable index : allocation.routingTable().indicesRouting().values()) {
|
indices.addAll(allocation.routingTable().indicesRouting().keySet());
|
||||||
indices.add(index.index());
|
buildModelFromAssigned(routing.shards(assignedFilter));
|
||||||
for (IndexShardRoutingTable shard : index.getShards().values()) {
|
|
||||||
shards.addAll(routing.shardsRoutingFor(index.index(), shard.shardId().id()));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
buildModelFromAssigned(Iterables.filter(shards, assignedFilter));
|
|
||||||
return allocateUnassigned(allocation.routingNodes().unassigned(), allocation.routingNodes().ignoredUnassigned());
|
return allocateUnassigned(allocation.routingNodes().unassigned(), allocation.routingNodes().ignoredUnassigned());
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
|
@ -75,9 +75,12 @@ public class ThrottlingAllocationDecider extends AllocationDecider {
|
||||||
public Decision canAllocate(ShardRouting shardRouting, RoutingNode node, RoutingAllocation allocation) {
|
public Decision canAllocate(ShardRouting shardRouting, RoutingNode node, RoutingAllocation allocation) {
|
||||||
if (shardRouting.primary()) {
|
if (shardRouting.primary()) {
|
||||||
boolean primaryUnassigned = false;
|
boolean primaryUnassigned = false;
|
||||||
for (MutableShardRouting shard : allocation.routingNodes().unassigned()) {
|
List<MutableShardRouting> unassigned = allocation.routingNodes().unassigned();
|
||||||
|
for (int i1 = 0; i1 < unassigned.size(); i1++) {
|
||||||
|
MutableShardRouting shard = unassigned.get(i1);
|
||||||
if (shard.shardId().equals(shardRouting.shardId())) {
|
if (shard.shardId().equals(shardRouting.shardId())) {
|
||||||
primaryUnassigned = true;
|
primaryUnassigned = true;
|
||||||
|
break;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
if (primaryUnassigned) {
|
if (primaryUnassigned) {
|
||||||
|
|
Loading…
Reference in New Issue