-
Notifications
You must be signed in to change notification settings - Fork 1.8k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Browse files
Browse the repository at this point in the history
* Created new ReplicaShardBatchAllocator to be used instead of ReplicaShardAllocator for batch calls (cherry picked from commit 4dbd6fa) Signed-off-by: Shivansh Arora <[email protected]> Signed-off-by: github-actions[bot] <github-actions[bot]@users.noreply.github.com> Co-authored-by: github-actions[bot] <github-actions[bot]@users.noreply.github.com>
- Loading branch information
1 parent
7139740
commit d371a3d
Showing
2 changed files
with
1,037 additions
and
0 deletions.
There are no files selected for viewing
188 changes: 188 additions & 0 deletions
188
server/src/main/java/org/opensearch/gateway/ReplicaShardBatchAllocator.java
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,188 @@ | ||
/* | ||
* SPDX-License-Identifier: Apache-2.0 | ||
* | ||
* The OpenSearch Contributors require contributions made to | ||
* this file be licensed under the Apache-2.0 license or a | ||
* compatible open source license. | ||
*/ | ||
|
||
package org.opensearch.gateway; | ||
|
||
import org.apache.logging.log4j.Logger; | ||
import org.opensearch.cluster.node.DiscoveryNode; | ||
import org.opensearch.cluster.routing.ShardRouting; | ||
import org.opensearch.cluster.routing.UnassignedInfo; | ||
import org.opensearch.cluster.routing.allocation.AllocateUnassignedDecision; | ||
import org.opensearch.cluster.routing.allocation.NodeAllocationResult; | ||
import org.opensearch.cluster.routing.allocation.RoutingAllocation; | ||
import org.opensearch.cluster.routing.allocation.decider.Decision; | ||
import org.opensearch.common.collect.Tuple; | ||
import org.opensearch.core.index.shard.ShardId; | ||
import org.opensearch.gateway.AsyncShardFetch.FetchResult; | ||
import org.opensearch.indices.store.TransportNodesListShardStoreMetadata; | ||
import org.opensearch.indices.store.TransportNodesListShardStoreMetadataBatch.NodeStoreFilesMetadata; | ||
import org.opensearch.indices.store.TransportNodesListShardStoreMetadataBatch.NodeStoreFilesMetadataBatch; | ||
import org.opensearch.indices.store.TransportNodesListShardStoreMetadataHelper.StoreFilesMetadata; | ||
|
||
import java.util.ArrayList; | ||
import java.util.Collections; | ||
import java.util.HashMap; | ||
import java.util.List; | ||
import java.util.Map; | ||
|
||
/** | ||
* Allocates replica shards in a batch mode | ||
* | ||
* @opensearch.internal | ||
*/ | ||
public abstract class ReplicaShardBatchAllocator extends ReplicaShardAllocator { | ||
|
||
/** | ||
* Process existing recoveries of replicas and see if we need to cancel them if we find a better | ||
* match. Today, a better match is one that can perform a no-op recovery while the previous recovery | ||
* has to copy segment files. | ||
* | ||
* @param allocation the overall routing allocation | ||
* @param shardBatches a list of shard batches to check for existing recoveries | ||
*/ | ||
public void processExistingRecoveries(RoutingAllocation allocation, List<List<ShardRouting>> shardBatches) { | ||
List<Runnable> shardCancellationActions = new ArrayList<>(); | ||
// iterate through the batches, each batch needs to be processed together as fetch call should be made for shards from same batch | ||
for (List<ShardRouting> shardBatch : shardBatches) { | ||
List<ShardRouting> eligibleShards = new ArrayList<>(); | ||
List<ShardRouting> ineligibleShards = new ArrayList<>(); | ||
// iterate over shards to check for match for each of those | ||
for (ShardRouting shard : shardBatch) { | ||
if (shard != null && !shard.primary()) { | ||
// need to iterate over all the nodes to find matching shard | ||
if (shouldSkipFetchForRecovery(shard)) { | ||
ineligibleShards.add(shard); | ||
continue; | ||
} | ||
eligibleShards.add(shard); | ||
} | ||
} | ||
AsyncShardFetch.FetchResult<NodeStoreFilesMetadataBatch> shardState = fetchData(eligibleShards, ineligibleShards, allocation); | ||
if (!shardState.hasData()) { | ||
logger.trace("{}: fetching new stores for initializing shard batch", eligibleShards); | ||
continue; // still fetching | ||
} | ||
for (ShardRouting shard : eligibleShards) { | ||
Map<DiscoveryNode, StoreFilesMetadata> nodeShardStores = convertToNodeStoreFilesMetadataMap(shard, shardState); | ||
|
||
Runnable cancellationAction = cancelExistingRecoveryForBetterMatch(shard, allocation, nodeShardStores); | ||
if (cancellationAction != null) { | ||
shardCancellationActions.add(cancellationAction); | ||
} | ||
} | ||
} | ||
for (Runnable action : shardCancellationActions) { | ||
action.run(); | ||
} | ||
} | ||
|
||
abstract protected FetchResult<NodeStoreFilesMetadataBatch> fetchData( | ||
List<ShardRouting> eligibleShards, | ||
List<ShardRouting> ineligibleShards, | ||
RoutingAllocation allocation | ||
); | ||
|
||
@Override | ||
protected FetchResult<TransportNodesListShardStoreMetadata.NodeStoreFilesMetadata> fetchData( | ||
ShardRouting shard, | ||
RoutingAllocation allocation | ||
) { | ||
logger.error("fetchData for single shard called via batch allocator"); | ||
throw new IllegalStateException("ReplicaShardBatchAllocator should only be used for a batch of shards"); | ||
} | ||
|
||
@Override | ||
public AllocateUnassignedDecision makeAllocationDecision(ShardRouting unassignedShard, RoutingAllocation allocation, Logger logger) { | ||
return makeAllocationDecision(Collections.singletonList(unassignedShard), allocation, logger).get(unassignedShard); | ||
} | ||
|
||
@Override | ||
public HashMap<ShardRouting, AllocateUnassignedDecision> makeAllocationDecision( | ||
List<ShardRouting> shards, | ||
RoutingAllocation allocation, | ||
Logger logger | ||
) { | ||
HashMap<ShardRouting, AllocateUnassignedDecision> shardAllocationDecisions = new HashMap<>(); | ||
final boolean explain = allocation.debugDecision(); | ||
List<ShardRouting> eligibleShards = new ArrayList<>(); | ||
List<ShardRouting> ineligibleShards = new ArrayList<>(); | ||
HashMap<ShardRouting, Tuple<Decision, Map<String, NodeAllocationResult>>> nodeAllocationDecisions = new HashMap<>(); | ||
for (ShardRouting shard : shards) { | ||
if (!isResponsibleFor(shard)) { | ||
// this allocator n is not responsible for allocating this shard | ||
ineligibleShards.add(shard); | ||
shardAllocationDecisions.put(shard, AllocateUnassignedDecision.NOT_TAKEN); | ||
continue; | ||
} | ||
|
||
Tuple<Decision, Map<String, NodeAllocationResult>> result = canBeAllocatedToAtLeastOneNode(shard, allocation); | ||
Decision allocationDecision = result.v1(); | ||
if (allocationDecision.type() != Decision.Type.YES && (!explain || !hasInitiatedFetching(shard))) { | ||
// only return early if we are not in explain mode, or we are in explain mode but we have not | ||
// yet attempted to fetch any shard data | ||
logger.trace("{}: ignoring allocation, can't be allocated on any node", shard); | ||
shardAllocationDecisions.put( | ||
shard, | ||
AllocateUnassignedDecision.no( | ||
UnassignedInfo.AllocationStatus.fromDecision(allocationDecision.type()), | ||
result.v2() != null ? new ArrayList<>(result.v2().values()) : null | ||
) | ||
); | ||
continue; | ||
} | ||
// storing the nodeDecisions in nodeAllocationDecisions if the decision is not YES | ||
// so that we don't have to compute the decisions again | ||
nodeAllocationDecisions.put(shard, result); | ||
|
||
eligibleShards.add(shard); | ||
} | ||
|
||
// Do not call fetchData if there are no eligible shards | ||
if (eligibleShards.isEmpty()) { | ||
return shardAllocationDecisions; | ||
} | ||
// only fetch data for eligible shards | ||
final FetchResult<NodeStoreFilesMetadataBatch> shardsState = fetchData(eligibleShards, ineligibleShards, allocation); | ||
|
||
for (ShardRouting unassignedShard : eligibleShards) { | ||
Tuple<Decision, Map<String, NodeAllocationResult>> result = nodeAllocationDecisions.get(unassignedShard); | ||
shardAllocationDecisions.put( | ||
unassignedShard, | ||
getAllocationDecision( | ||
unassignedShard, | ||
allocation, | ||
convertToNodeStoreFilesMetadataMap(unassignedShard, shardsState), | ||
result, | ||
logger | ||
) | ||
); | ||
} | ||
return shardAllocationDecisions; | ||
} | ||
|
||
private Map<DiscoveryNode, StoreFilesMetadata> convertToNodeStoreFilesMetadataMap( | ||
ShardRouting unassignedShard, | ||
FetchResult<NodeStoreFilesMetadataBatch> data | ||
) { | ||
if (!data.hasData()) { | ||
return null; | ||
} | ||
|
||
Map<DiscoveryNode, StoreFilesMetadata> map = new HashMap<>(); | ||
|
||
data.getData().forEach((discoveryNode, value) -> { | ||
Map<ShardId, NodeStoreFilesMetadata> batch = value.getNodeStoreFilesMetadataBatch(); | ||
NodeStoreFilesMetadata metadata = batch.get(unassignedShard.shardId()); | ||
if (metadata != null) { | ||
map.put(discoveryNode, metadata.storeFilesMetadata()); | ||
} | ||
}); | ||
|
||
return map; | ||
} | ||
} |
Oops, something went wrong.