2961 lines
130 KiB
C++
2961 lines
130 KiB
C++
/*
|
||
* DataDistributionQueue.actor.cpp
|
||
*
|
||
* This source file is part of the FoundationDB open source project
|
||
*
|
||
* Copyright 2013-2024 Apple Inc. and the FoundationDB project authors
|
||
*
|
||
* Licensed 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.
|
||
*/
|
||
|
||
#include <limits>
|
||
#include <numeric>
|
||
#include <utility>
|
||
#include <vector>
|
||
|
||
#include "fdbserver/DataDistributionTeam.h"
|
||
#include "flow/ActorCollection.h"
|
||
#include "flow/Buggify.h"
|
||
#include "flow/FastRef.h"
|
||
#include "flow/Trace.h"
|
||
#include "fdbrpc/sim_validation.h"
|
||
#include "fdbclient/ManagementAPI.actor.h"
|
||
#include "fdbclient/SystemData.h"
|
||
#include "fdbserver/DataDistribution.actor.h"
|
||
#include "fdbserver/MoveKeys.actor.h"
|
||
#include "fdbserver/Knobs.h"
|
||
#include "fdbrpc/simulator.h"
|
||
#include "fdbserver/DDTxnProcessor.h"
|
||
#include "flow/DebugTrace.h"
|
||
#include "fdbserver/DDRelocationQueue.h"
|
||
#include "flow/actorcompiler.h" // This must be the last #include.
|
||
|
||
#define WORK_FULL_UTILIZATION 10000 // This is not a knob; it is a fixed point scaling factor!
|
||
|
||
typedef Reference<IDataDistributionTeam> ITeamRef;
|
||
typedef std::pair<ITeamRef, ITeamRef> SrcDestTeamPair;
|
||
|
||
inline bool isDataMovementForDiskBalancing(DataMovementReason reason) {
|
||
return reason == DataMovementReason::REBALANCE_UNDERUTILIZED_TEAM ||
|
||
reason == DataMovementReason::REBALANCE_OVERUTILIZED_TEAM;
|
||
}
|
||
|
||
inline bool isDataMovementForReadBalancing(DataMovementReason reason) {
|
||
return reason == DataMovementReason::REBALANCE_READ_OVERUTIL_TEAM ||
|
||
reason == DataMovementReason::REBALANCE_READ_UNDERUTIL_TEAM;
|
||
}
|
||
|
||
inline bool isDataMovementForMountainChopper(DataMovementReason reason) {
|
||
return reason == DataMovementReason::REBALANCE_OVERUTILIZED_TEAM ||
|
||
reason == DataMovementReason::REBALANCE_READ_OVERUTIL_TEAM;
|
||
}
|
||
|
||
// FIXME: Always use DataMovementReason to invoke these functions.
|
||
inline bool isValleyFillerPriority(int priority) {
|
||
return priority == SERVER_KNOBS->PRIORITY_REBALANCE_UNDERUTILIZED_TEAM ||
|
||
priority == SERVER_KNOBS->PRIORITY_REBALANCE_READ_UNDERUTIL_TEAM;
|
||
}
|
||
|
||
inline bool isDataMovementForValleyFiller(DataMovementReason reason) {
|
||
return reason == DataMovementReason::REBALANCE_UNDERUTILIZED_TEAM ||
|
||
reason == DataMovementReason::REBALANCE_READ_UNDERUTIL_TEAM;
|
||
}
|
||
|
||
typedef std::map<DataMovementReason, int> DmReasonPriorityMapping;
|
||
typedef std::map<int, DataMovementReason> PriorityDmReasonMapping;
|
||
std::pair<const DmReasonPriorityMapping*, const PriorityDmReasonMapping*> buildPriorityMappings() {
|
||
static DmReasonPriorityMapping reasonPriority{
|
||
{ DataMovementReason::INVALID, -1 },
|
||
{ DataMovementReason::RECOVER_MOVE, SERVER_KNOBS->PRIORITY_RECOVER_MOVE },
|
||
{ DataMovementReason::REBALANCE_UNDERUTILIZED_TEAM, SERVER_KNOBS->PRIORITY_REBALANCE_UNDERUTILIZED_TEAM },
|
||
{ DataMovementReason::REBALANCE_OVERUTILIZED_TEAM, SERVER_KNOBS->PRIORITY_REBALANCE_OVERUTILIZED_TEAM },
|
||
{ DataMovementReason::REBALANCE_READ_OVERUTIL_TEAM, SERVER_KNOBS->PRIORITY_REBALANCE_READ_OVERUTIL_TEAM },
|
||
{ DataMovementReason::REBALANCE_READ_UNDERUTIL_TEAM, SERVER_KNOBS->PRIORITY_REBALANCE_READ_UNDERUTIL_TEAM },
|
||
{ DataMovementReason::PERPETUAL_STORAGE_WIGGLE, SERVER_KNOBS->PRIORITY_PERPETUAL_STORAGE_WIGGLE },
|
||
{ DataMovementReason::TEAM_HEALTHY, SERVER_KNOBS->PRIORITY_TEAM_HEALTHY },
|
||
{ DataMovementReason::TEAM_CONTAINS_UNDESIRED_SERVER, SERVER_KNOBS->PRIORITY_TEAM_CONTAINS_UNDESIRED_SERVER },
|
||
{ DataMovementReason::TEAM_REDUNDANT, SERVER_KNOBS->PRIORITY_TEAM_REDUNDANT },
|
||
{ DataMovementReason::MERGE_SHARD, SERVER_KNOBS->PRIORITY_MERGE_SHARD },
|
||
{ DataMovementReason::POPULATE_REGION, SERVER_KNOBS->PRIORITY_POPULATE_REGION },
|
||
{ DataMovementReason::TEAM_UNHEALTHY, SERVER_KNOBS->PRIORITY_TEAM_UNHEALTHY },
|
||
{ DataMovementReason::TEAM_2_LEFT, SERVER_KNOBS->PRIORITY_TEAM_2_LEFT },
|
||
{ DataMovementReason::TEAM_1_LEFT, SERVER_KNOBS->PRIORITY_TEAM_1_LEFT },
|
||
{ DataMovementReason::TEAM_FAILED, SERVER_KNOBS->PRIORITY_TEAM_FAILED },
|
||
{ DataMovementReason::TEAM_0_LEFT, SERVER_KNOBS->PRIORITY_TEAM_0_LEFT },
|
||
{ DataMovementReason::SPLIT_SHARD, SERVER_KNOBS->PRIORITY_SPLIT_SHARD },
|
||
{ DataMovementReason::ENFORCE_MOVE_OUT_OF_PHYSICAL_SHARD,
|
||
SERVER_KNOBS->PRIORITY_ENFORCE_MOVE_OUT_OF_PHYSICAL_SHARD },
|
||
{ DataMovementReason::REBALANCE_STORAGE_QUEUE, SERVER_KNOBS->PRIORITY_REBALANCE_STORAGE_QUEUE },
|
||
{ DataMovementReason::ASSIGN_EMPTY_RANGE, -2 }, // dummy reason, no corresponding actual data move
|
||
{ DataMovementReason::SEED_SHARD_SERVER, -3 }, // dummy reason, no corresponding actual data move
|
||
{ DataMovementReason::NUMBER_OF_REASONS, -4 }, // dummy reason, no corresponding actual data move
|
||
};
|
||
|
||
static PriorityDmReasonMapping priorityReason;
|
||
if (priorityReason.empty()) { // only build once
|
||
for (const auto& [r, p] : reasonPriority) {
|
||
priorityReason[p] = r;
|
||
}
|
||
// Don't allow 2 priorities value being the same.
|
||
if (priorityReason.size() != reasonPriority.size()) {
|
||
TraceEvent(SevError, "DuplicateDataMovementPriority").log();
|
||
ASSERT(false);
|
||
}
|
||
}
|
||
|
||
return std::make_pair(&reasonPriority, &priorityReason);
|
||
}
|
||
|
||
// Return negative priority for invalid or dummy reasons
|
||
int dataMovementPriority(DataMovementReason reason) {
|
||
auto [reasonPriority, _] = buildPriorityMappings();
|
||
return reasonPriority->at(reason);
|
||
}
|
||
|
||
DataMovementReason priorityToDataMovementReason(int priority) {
|
||
auto [_, priorityReason] = buildPriorityMappings();
|
||
return priorityReason->at(priority);
|
||
}
|
||
|
||
RelocateData::RelocateData()
|
||
: priority(-1), boundaryPriority(-1), healthPriority(-1), reason(RelocateReason::OTHER), startTime(-1),
|
||
dataMoveId(anonymousShardId), workFactor(0), wantsNewServers(false), cancellable(false),
|
||
interval("QueuedRelocation"){};
|
||
|
||
RelocateData::RelocateData(RelocateShard const& rs)
|
||
: parent_range(rs.getParentRange()), keys(rs.keys), priority(rs.priority),
|
||
boundaryPriority(isBoundaryPriority(rs.priority) ? rs.priority : -1),
|
||
healthPriority(isHealthPriority(rs.priority) ? rs.priority : -1), reason(rs.reason), dmReason(rs.moveReason),
|
||
startTime(now()), randomId(rs.traceId.isValid() ? rs.traceId : deterministicRandom()->randomUniqueID()),
|
||
dataMoveId(rs.dataMoveId), workFactor(0),
|
||
wantsNewServers(isDataMovementForMountainChopper(rs.moveReason) || isDataMovementForValleyFiller(rs.moveReason) ||
|
||
rs.moveReason == DataMovementReason::SPLIT_SHARD ||
|
||
rs.moveReason == DataMovementReason::TEAM_REDUNDANT ||
|
||
rs.moveReason == DataMovementReason::REBALANCE_STORAGE_QUEUE),
|
||
cancellable(true), interval("QueuedRelocation", randomId), dataMove(rs.dataMove) {
|
||
if (dataMove != nullptr) {
|
||
this->src.insert(this->src.end(), dataMove->meta.src.begin(), dataMove->meta.src.end());
|
||
}
|
||
}
|
||
|
||
bool RelocateData::isRestore() const {
|
||
return this->dataMove != nullptr;
|
||
}
|
||
|
||
// Note: C++ standard library uses the Compare operator, uniqueness is determined by !comp(a, b) && !comp(b, a).
|
||
// So operator == and != is not used by std::set<RelocateData, std::greater<RelocateData>>
|
||
bool RelocateData::operator>(const RelocateData& rhs) const {
|
||
if (priority != rhs.priority) {
|
||
return priority > rhs.priority;
|
||
} else if (startTime != rhs.startTime) {
|
||
return startTime < rhs.startTime;
|
||
} else if (randomId != rhs.randomId) {
|
||
return randomId > rhs.randomId;
|
||
} else if (keys.begin != rhs.keys.begin) {
|
||
return keys.begin < rhs.keys.begin;
|
||
} else {
|
||
return keys.end < rhs.keys.end;
|
||
}
|
||
}
|
||
|
||
bool RelocateData::operator==(const RelocateData& rhs) const {
|
||
return priority == rhs.priority && boundaryPriority == rhs.boundaryPriority &&
|
||
healthPriority == rhs.healthPriority && reason == rhs.reason && keys == rhs.keys &&
|
||
startTime == rhs.startTime && workFactor == rhs.workFactor && src == rhs.src &&
|
||
completeSources == rhs.completeSources && wantsNewServers == rhs.wantsNewServers && randomId == rhs.randomId;
|
||
}
|
||
bool RelocateData::operator!=(const RelocateData& rhs) const {
|
||
return !(*this == rhs);
|
||
}
|
||
Optional<KeyRange> RelocateData::getParentRange() const {
|
||
return parent_range;
|
||
}
|
||
|
||
class ParallelTCInfo final : public ReferenceCounted<ParallelTCInfo>, public IDataDistributionTeam {
|
||
std::vector<Reference<IDataDistributionTeam>> teams;
|
||
std::vector<UID> tempServerIDs;
|
||
|
||
template <typename NUM>
|
||
NUM sum(std::function<NUM(IDataDistributionTeam const&)> func) const {
|
||
NUM result = 0;
|
||
for (const auto& team : teams) {
|
||
result += func(*team);
|
||
}
|
||
return result;
|
||
}
|
||
|
||
template <class T>
|
||
std::vector<T> collect(std::function<std::vector<T>(IDataDistributionTeam const&)> func) const {
|
||
std::vector<T> result;
|
||
|
||
for (const auto& team : teams) {
|
||
std::vector<T> newItems = func(*team);
|
||
result.insert(result.end(), newItems.begin(), newItems.end());
|
||
}
|
||
return result;
|
||
}
|
||
|
||
bool any(std::function<bool(IDataDistributionTeam const&)> func) const {
|
||
for (const auto& team : teams) {
|
||
if (func(*team)) {
|
||
return true;
|
||
}
|
||
}
|
||
return false;
|
||
}
|
||
|
||
public:
|
||
ParallelTCInfo() = default;
|
||
explicit ParallelTCInfo(ParallelTCInfo const& info) : teams(info.teams), tempServerIDs(info.tempServerIDs){};
|
||
|
||
void addTeam(Reference<IDataDistributionTeam> team) { teams.push_back(team); }
|
||
|
||
void clear() { teams.clear(); }
|
||
|
||
bool all(std::function<bool(IDataDistributionTeam const&)> func) const {
|
||
return !any([func](IDataDistributionTeam const& team) { return !func(team); });
|
||
}
|
||
|
||
std::vector<StorageServerInterface> getLastKnownServerInterfaces() const override {
|
||
return collect<StorageServerInterface>(
|
||
[](IDataDistributionTeam const& team) { return team.getLastKnownServerInterfaces(); });
|
||
}
|
||
|
||
int size() const override {
|
||
int totalSize = 0;
|
||
for (auto it = teams.begin(); it != teams.end(); it++) {
|
||
totalSize += (*it)->size();
|
||
}
|
||
return totalSize;
|
||
}
|
||
|
||
std::vector<UID> const& getServerIDs() const override {
|
||
static std::vector<UID> tempServerIDs;
|
||
tempServerIDs.clear();
|
||
for (const auto& team : teams) {
|
||
std::vector<UID> const& childIDs = team->getServerIDs();
|
||
tempServerIDs.insert(tempServerIDs.end(), childIDs.begin(), childIDs.end());
|
||
}
|
||
return tempServerIDs;
|
||
}
|
||
|
||
void addDataInFlightToTeam(int64_t delta) override {
|
||
for (auto& team : teams) {
|
||
team->addDataInFlightToTeam(delta);
|
||
}
|
||
}
|
||
|
||
void addReadInFlightToTeam(int64_t delta) override {
|
||
for (auto& team : teams) {
|
||
team->addReadInFlightToTeam(delta);
|
||
}
|
||
}
|
||
|
||
int64_t getDataInFlightToTeam() const override {
|
||
return sum<int64_t>([](IDataDistributionTeam const& team) { return team.getDataInFlightToTeam(); });
|
||
}
|
||
|
||
int64_t getLoadBytes(bool includeInFlight = true, double inflightPenalty = 1.0) const override {
|
||
return sum<int64_t>([includeInFlight, inflightPenalty](IDataDistributionTeam const& team) {
|
||
return team.getLoadBytes(includeInFlight, inflightPenalty);
|
||
});
|
||
}
|
||
|
||
int64_t getReadInFlightToTeam() const override {
|
||
return sum<int64_t>([](IDataDistributionTeam const& team) { return team.getReadInFlightToTeam(); });
|
||
}
|
||
|
||
double getReadLoad(bool includeInFlight = true, double inflightPenalty = 1.0) const override {
|
||
return sum<double>([includeInFlight, inflightPenalty](IDataDistributionTeam const& team) {
|
||
return team.getReadLoad(includeInFlight, inflightPenalty);
|
||
});
|
||
}
|
||
|
||
double getAverageCPU() const override {
|
||
return sum<double>([](IDataDistributionTeam const& team) { return team.getAverageCPU(); }) / teams.size();
|
||
}
|
||
|
||
bool hasLowerCpu(double cpuThreshold) const override {
|
||
return all([cpuThreshold](IDataDistributionTeam const& team) { return team.hasLowerCpu(cpuThreshold); });
|
||
}
|
||
|
||
Optional<int64_t> getLongestStorageQueueSize() const override {
|
||
int64_t maxQueueSize = 0;
|
||
for (const auto& team : teams) {
|
||
Optional<int64_t> queueSize = team->getLongestStorageQueueSize();
|
||
if (!queueSize.present()) {
|
||
return Optional<int64_t>();
|
||
}
|
||
maxQueueSize = std::max(maxQueueSize, queueSize.get());
|
||
}
|
||
return maxQueueSize;
|
||
}
|
||
|
||
int64_t getMinAvailableSpace(bool includeInFlight = true) const override {
|
||
int64_t result = std::numeric_limits<int64_t>::max();
|
||
for (const auto& team : teams) {
|
||
result = std::min(result, team->getMinAvailableSpace(includeInFlight));
|
||
}
|
||
return result;
|
||
}
|
||
|
||
double getMinAvailableSpaceRatio(bool includeInFlight = true) const override {
|
||
double result = std::numeric_limits<double>::max();
|
||
for (const auto& team : teams) {
|
||
result = std::min(result, team->getMinAvailableSpaceRatio(includeInFlight));
|
||
}
|
||
return result;
|
||
}
|
||
|
||
bool hasHealthyAvailableSpace(double minRatio) const override {
|
||
return all([minRatio](IDataDistributionTeam const& team) { return team.hasHealthyAvailableSpace(minRatio); });
|
||
}
|
||
|
||
Future<Void> updateStorageMetrics() override {
|
||
std::vector<Future<Void>> futures;
|
||
|
||
for (auto& team : teams) {
|
||
futures.push_back(team->updateStorageMetrics());
|
||
}
|
||
return waitForAll(futures);
|
||
}
|
||
|
||
bool isOptimal() const override {
|
||
return all([](IDataDistributionTeam const& team) { return team.isOptimal(); });
|
||
}
|
||
|
||
bool isWrongConfiguration() const override {
|
||
return any([](IDataDistributionTeam const& team) { return team.isWrongConfiguration(); });
|
||
}
|
||
void setWrongConfiguration(bool wrongConfiguration) override {
|
||
for (auto it = teams.begin(); it != teams.end(); it++) {
|
||
(*it)->setWrongConfiguration(wrongConfiguration);
|
||
}
|
||
}
|
||
|
||
bool isHealthy() const override {
|
||
return all([](IDataDistributionTeam const& team) { return team.isHealthy(); });
|
||
}
|
||
|
||
void setHealthy(bool h) override {
|
||
for (auto it = teams.begin(); it != teams.end(); it++) {
|
||
(*it)->setHealthy(h);
|
||
}
|
||
}
|
||
|
||
int getPriority() const override {
|
||
int priority = 0;
|
||
for (auto it = teams.begin(); it != teams.end(); it++) {
|
||
priority = std::max(priority, (*it)->getPriority());
|
||
}
|
||
return priority;
|
||
}
|
||
|
||
void setPriority(int p) override {
|
||
for (auto it = teams.begin(); it != teams.end(); it++) {
|
||
(*it)->setPriority(p);
|
||
}
|
||
}
|
||
void addref() const override { ReferenceCounted<ParallelTCInfo>::addref(); }
|
||
void delref() const override { ReferenceCounted<ParallelTCInfo>::delref(); }
|
||
|
||
void addServers(const std::vector<UID>& servers) override {
|
||
ASSERT(!teams.empty());
|
||
teams[0]->addServers(servers);
|
||
}
|
||
|
||
std::string getTeamID() const override {
|
||
std::string id;
|
||
for (int i = 0; i < teams.size(); i++) {
|
||
auto const& team = teams[i];
|
||
id += (i == teams.size() - 1) ? team->getTeamID() : format("%s, ", team->getTeamID().c_str());
|
||
}
|
||
return id;
|
||
}
|
||
};
|
||
|
||
bool Busyness::canLaunch(int prio, int work) const {
|
||
ASSERT(prio > 0 && prio < 1000);
|
||
return ledger[prio / 100] <= WORK_FULL_UTILIZATION - work; // allow for rounding errors in double division
|
||
}
|
||
|
||
void Busyness::addWork(int prio, int work) {
|
||
ASSERT(prio > 0 && prio < 1000);
|
||
for (int i = 0; i <= (prio / 100); i++)
|
||
ledger[i] += work;
|
||
}
|
||
|
||
void Busyness::removeWork(int prio, int work) {
|
||
addWork(prio, -work);
|
||
}
|
||
|
||
std::string Busyness::toString() {
|
||
std::string result;
|
||
for (int i = 1; i < ledger.size();) {
|
||
int j = i + 1;
|
||
while (j < ledger.size() && ledger[i] == ledger[j])
|
||
j++;
|
||
if (i != 1)
|
||
result += ", ";
|
||
result += i + 1 == j ? format("%03d", i * 100) : format("%03d/%03d", i * 100, (j - 1) * 100);
|
||
result += format("=%1.02f (%d/%d)", (float)ledger[i] / WORK_FULL_UTILIZATION, ledger[i], WORK_FULL_UTILIZATION);
|
||
i = j;
|
||
}
|
||
return result;
|
||
}
|
||
|
||
// find the "workFactor" for this, were it launched now
|
||
int getSrcWorkFactor(RelocateData const& relocation, int singleRegionTeamSize) {
|
||
if (relocation.bulkLoadTask.present())
|
||
return 0;
|
||
else if (relocation.healthPriority == SERVER_KNOBS->PRIORITY_TEAM_1_LEFT ||
|
||
relocation.healthPriority == SERVER_KNOBS->PRIORITY_TEAM_0_LEFT)
|
||
return WORK_FULL_UTILIZATION / SERVER_KNOBS->RELOCATION_PARALLELISM_PER_SOURCE_SERVER;
|
||
else if (relocation.healthPriority == SERVER_KNOBS->PRIORITY_TEAM_2_LEFT)
|
||
return WORK_FULL_UTILIZATION / 2 / SERVER_KNOBS->RELOCATION_PARALLELISM_PER_SOURCE_SERVER;
|
||
else if (relocation.healthPriority == SERVER_KNOBS->PRIORITY_PERPETUAL_STORAGE_WIGGLE)
|
||
// we want to set PRIORITY_PERPETUAL_STORAGE_WIGGLE to a reasonably large value
|
||
// to make this parallelism take effect
|
||
return WORK_FULL_UTILIZATION / SERVER_KNOBS->WIGGLING_RELOCATION_PARALLELISM_PER_SOURCE_SERVER;
|
||
else if (relocation.priority == SERVER_KNOBS->PRIORITY_MERGE_SHARD)
|
||
return WORK_FULL_UTILIZATION / SERVER_KNOBS->MERGE_RELOCATION_PARALLELISM_PER_TEAM;
|
||
else { // for now we assume that any message at a lower priority can best be assumed to have a full team left for
|
||
// work
|
||
|
||
return WORK_FULL_UTILIZATION / singleRegionTeamSize / SERVER_KNOBS->RELOCATION_PARALLELISM_PER_SOURCE_SERVER;
|
||
}
|
||
}
|
||
|
||
int getDestWorkFactor() {
|
||
// Work of moving a shard is even across destination servers
|
||
return WORK_FULL_UTILIZATION / SERVER_KNOBS->RELOCATION_PARALLELISM_PER_DEST_SERVER;
|
||
}
|
||
|
||
// Data movement's resource control: Do not overload servers used for the RelocateData
|
||
// return true if servers are not too busy to launch the relocation
|
||
// This ensure source servers will not be overloaded.
|
||
bool canLaunchSrc(RelocateData& relocation,
|
||
int teamSize,
|
||
int singleRegionTeamSize,
|
||
std::map<UID, Busyness>& busymap,
|
||
std::vector<RelocateData> cancellableRelocations) {
|
||
// assert this has not already been launched
|
||
ASSERT(relocation.workFactor == 0);
|
||
ASSERT(relocation.src.size() != 0);
|
||
ASSERT(teamSize >= singleRegionTeamSize);
|
||
|
||
// Blob migrator is backed by s3 so it can allow unlimited data movements
|
||
if (relocation.src.size() == 1 && BlobMigratorInterface::isBlobMigrator(relocation.src.back())) {
|
||
return true;
|
||
} else if (relocation.bulkLoadTask.present()) {
|
||
// workFactor for bulk load task on source is always 0, therefore, we can safely launch
|
||
// the data move with a bulk load task
|
||
return true;
|
||
}
|
||
|
||
// find the "workFactor" for this, were it launched now
|
||
int workFactor = getSrcWorkFactor(relocation, singleRegionTeamSize);
|
||
int neededServers = std::min<int>(relocation.src.size(), teamSize - singleRegionTeamSize + 1);
|
||
if (SERVER_KNOBS->USE_OLD_NEEDED_SERVERS) {
|
||
neededServers = std::max(1, (int)relocation.src.size() - teamSize + 1);
|
||
}
|
||
// see if each of the SS can launch this task
|
||
for (int i = 0; i < relocation.src.size(); i++) {
|
||
// For each source server for this relocation, copy and modify its busyness to reflect work that WOULD be
|
||
// cancelled
|
||
auto busyCopy = busymap[relocation.src[i]];
|
||
for (int j = 0; j < cancellableRelocations.size(); j++) {
|
||
auto& servers = cancellableRelocations[j].src;
|
||
if (std::count(servers.begin(), servers.end(), relocation.src[i]))
|
||
busyCopy.removeWork(cancellableRelocations[j].priority, cancellableRelocations[j].workFactor);
|
||
}
|
||
// Use this modified busyness to check if this relocation could be launched
|
||
if (busyCopy.canLaunch(relocation.priority, workFactor)) {
|
||
--neededServers;
|
||
if (neededServers == 0)
|
||
return true;
|
||
}
|
||
}
|
||
|
||
return false;
|
||
}
|
||
|
||
// candidateTeams is a vector containing one team per datacenter, the team(s) DD is planning on moving the shard to.
|
||
bool canLaunchDest(const std::vector<std::pair<Reference<IDataDistributionTeam>, bool>>& candidateTeams,
|
||
int priority,
|
||
std::map<UID, Busyness>& busymapDest) {
|
||
// fail switch if this is causing issues
|
||
if (SERVER_KNOBS->RELOCATION_PARALLELISM_PER_DEST_SERVER <= 0) {
|
||
return true;
|
||
}
|
||
int workFactor = getDestWorkFactor();
|
||
for (auto& [team, _] : candidateTeams) {
|
||
for (UID id : team->getServerIDs()) {
|
||
if (!busymapDest[id].canLaunch(priority, workFactor)) {
|
||
return false;
|
||
}
|
||
}
|
||
}
|
||
return true;
|
||
}
|
||
|
||
// update busyness for each server
|
||
void launch(RelocateData& relocation, std::map<UID, Busyness>& busymap, int singleRegionTeamSize) {
|
||
// if we are here this means that we can launch and should adjust all the work the servers can do
|
||
relocation.workFactor = getSrcWorkFactor(relocation, singleRegionTeamSize);
|
||
for (int i = 0; i < relocation.src.size(); i++)
|
||
busymap[relocation.src[i]].addWork(relocation.priority, relocation.workFactor);
|
||
}
|
||
|
||
void launchDest(RelocateData& relocation,
|
||
const std::vector<std::pair<Reference<IDataDistributionTeam>, bool>>& candidateTeams,
|
||
std::map<UID, Busyness>& destBusymap) {
|
||
ASSERT(relocation.completeDests.empty());
|
||
int destWorkFactor = getDestWorkFactor();
|
||
for (auto& [team, _] : candidateTeams) {
|
||
for (UID id : team->getServerIDs()) {
|
||
relocation.completeDests.push_back(id);
|
||
destBusymap[id].addWork(relocation.priority, destWorkFactor);
|
||
}
|
||
}
|
||
}
|
||
void completeDest(RelocateData const& relocation, std::map<UID, Busyness>& destBusymap) {
|
||
int destWorkFactor = getDestWorkFactor();
|
||
for (UID id : relocation.completeDests) {
|
||
destBusymap[id].removeWork(relocation.priority, destWorkFactor);
|
||
}
|
||
}
|
||
|
||
void complete(RelocateData const& relocation, std::map<UID, Busyness>& busymap, std::map<UID, Busyness>& destBusymap) {
|
||
ASSERT(relocation.bulkLoadTask.present() || relocation.workFactor > 0);
|
||
for (int i = 0; i < relocation.src.size(); i++)
|
||
busymap[relocation.src[i]].removeWork(relocation.priority, relocation.workFactor);
|
||
|
||
completeDest(relocation, destBusymap);
|
||
}
|
||
|
||
// Cancels in-flight data moves intersecting with range.
|
||
ACTOR Future<Void> cancelDataMove(class DDQueue* self, KeyRange range, const DDEnabledState* ddEnabledState);
|
||
|
||
ACTOR Future<Void> dataDistributionRelocator(class DDQueue* self,
|
||
RelocateData rd,
|
||
Future<Void> prevCleanup,
|
||
const DDEnabledState* ddEnabledState);
|
||
|
||
ACTOR Future<Void> getSourceServersForRange(DDQueue* self,
|
||
RelocateData input,
|
||
PromiseStream<RelocateData> output,
|
||
Reference<FlowLock> fetchLock) {
|
||
|
||
// FIXME: is the merge case needed
|
||
if (input.priority == SERVER_KNOBS->PRIORITY_MERGE_SHARD) {
|
||
wait(delay(0.5, TaskPriority::DataDistributionVeryLow));
|
||
} else {
|
||
wait(delay(0.0001, TaskPriority::DataDistributionLaunch));
|
||
}
|
||
|
||
wait(fetchLock->take(TaskPriority::DataDistributionLaunch));
|
||
state FlowLock::Releaser releaser(*fetchLock);
|
||
|
||
IDDTxnProcessor::SourceServers res = wait(self->txnProcessor->getSourceServersForRange(input.keys));
|
||
input.src = std::move(res.srcServers);
|
||
input.completeSources = std::move(res.completeSources);
|
||
output.send(input);
|
||
return Void();
|
||
}
|
||
|
||
DDQueue::DDQueue(DDQueueInitParams const& params)
|
||
: IDDRelocationQueue(), distributorId(params.id), lock(params.lock), txnProcessor(params.db),
|
||
teamCollections(params.teamCollections), shardsAffectedByTeamFailure(params.shardsAffectedByTeamFailure),
|
||
physicalShardCollection(params.physicalShardCollection), bulkLoadTaskCollection(params.bulkLoadTaskCollection),
|
||
getAverageShardBytes(params.getAverageShardBytes),
|
||
startMoveKeysParallelismLock(SERVER_KNOBS->DD_MOVE_KEYS_PARALLELISM),
|
||
finishMoveKeysParallelismLock(SERVER_KNOBS->DD_MOVE_KEYS_PARALLELISM),
|
||
cleanUpDataMoveParallelismLock(SERVER_KNOBS->DD_MOVE_KEYS_PARALLELISM),
|
||
fetchSourceLock(new FlowLock(SERVER_KNOBS->DD_FETCH_SOURCE_PARALLELISM)), activeRelocations(0),
|
||
queuedRelocations(0), bytesWritten(0), teamSize(params.teamSize), singleRegionTeamSize(params.singleRegionTeamSize),
|
||
output(params.relocationProducer), input(params.relocationConsumer), getShardMetrics(params.getShardMetrics),
|
||
getTopKMetrics(params.getTopKMetrics), lastInterval(0), suppressIntervals(0),
|
||
rawProcessingUnhealthy(new AsyncVar<bool>(false)), rawProcessingWiggle(new AsyncVar<bool>(false)),
|
||
unhealthyRelocations(0), movedKeyServersEventHolder(makeReference<EventCacheHolder>("MovedKeyServers")),
|
||
moveReusePhysicalShard(0), moveCreateNewPhysicalShard(0),
|
||
retryFindDstReasonCount(static_cast<int>(RetryFindDstReason::NumberOfTypes), 0),
|
||
moveBytesRate(SERVER_KNOBS->DD_TRACE_MOVE_BYTES_AVERAGE_INTERVAL) {}
|
||
|
||
void DDQueue::startRelocation(int priority, int healthPriority) {
|
||
// Although PRIORITY_TEAM_REDUNDANT has lower priority than split and merge shard movement,
|
||
// we must count it into unhealthyRelocations; because team removers relies on unhealthyRelocations to
|
||
// ensure a team remover will not start before the previous one finishes removing a team and move away data
|
||
// NOTE: split and merge shard have higher priority. If they have to wait for unhealthyRelocations = 0,
|
||
// deadlock may happen: split/merge shard waits for unhealthyRelocations, while blocks team_redundant.
|
||
if (healthPriority == SERVER_KNOBS->PRIORITY_POPULATE_REGION ||
|
||
healthPriority == SERVER_KNOBS->PRIORITY_TEAM_UNHEALTHY ||
|
||
healthPriority == SERVER_KNOBS->PRIORITY_TEAM_2_LEFT || healthPriority == SERVER_KNOBS->PRIORITY_TEAM_1_LEFT ||
|
||
healthPriority == SERVER_KNOBS->PRIORITY_TEAM_0_LEFT ||
|
||
healthPriority == SERVER_KNOBS->PRIORITY_TEAM_REDUNDANT) {
|
||
unhealthyRelocations++;
|
||
rawProcessingUnhealthy->set(true);
|
||
}
|
||
if (healthPriority == SERVER_KNOBS->PRIORITY_PERPETUAL_STORAGE_WIGGLE) {
|
||
rawProcessingWiggle->set(true);
|
||
}
|
||
priority_relocations[priority]++;
|
||
}
|
||
|
||
void DDQueue::finishRelocation(int priority, int healthPriority) {
|
||
if (healthPriority == SERVER_KNOBS->PRIORITY_POPULATE_REGION ||
|
||
healthPriority == SERVER_KNOBS->PRIORITY_TEAM_UNHEALTHY ||
|
||
healthPriority == SERVER_KNOBS->PRIORITY_TEAM_2_LEFT || healthPriority == SERVER_KNOBS->PRIORITY_TEAM_1_LEFT ||
|
||
healthPriority == SERVER_KNOBS->PRIORITY_TEAM_0_LEFT ||
|
||
healthPriority == SERVER_KNOBS->PRIORITY_TEAM_REDUNDANT) {
|
||
unhealthyRelocations--;
|
||
ASSERT(unhealthyRelocations >= 0);
|
||
if (unhealthyRelocations == 0) {
|
||
rawProcessingUnhealthy->set(false);
|
||
}
|
||
}
|
||
priority_relocations[priority]--;
|
||
if (priority_relocations[SERVER_KNOBS->PRIORITY_PERPETUAL_STORAGE_WIGGLE] == 0) {
|
||
rawProcessingWiggle->set(false);
|
||
}
|
||
}
|
||
|
||
void DDQueue::validate() {
|
||
if (EXPENSIVE_VALIDATION) {
|
||
for (auto it = fetchingSourcesQueue.begin(); it != fetchingSourcesQueue.end(); ++it) {
|
||
// relocates in the fetching queue do not have src servers yet.
|
||
if (it->src.size())
|
||
TraceEvent(SevError, "DDQueueValidateError1")
|
||
.detail("Problem", "relocates in the fetching queue do not have src servers yet");
|
||
|
||
// relocates in the fetching queue do not have a work factor yet.
|
||
if (it->workFactor != 0.0)
|
||
TraceEvent(SevError, "DDQueueValidateError2")
|
||
.detail("Problem", "relocates in the fetching queue do not have a work factor yet");
|
||
|
||
// relocates in the fetching queue are in the queueMap.
|
||
auto range = queueMap.rangeContaining(it->keys.begin);
|
||
if (range.value() != *it || range.range() != it->keys)
|
||
TraceEvent(SevError, "DDQueueValidateError3")
|
||
.detail("Problem", "relocates in the fetching queue are in the queueMap");
|
||
}
|
||
|
||
/*
|
||
for( auto it = queue.begin(); it != queue.end(); ++it ) {
|
||
for( auto rdit = it->second.begin(); rdit != it->second.end(); ++rdit ) {
|
||
// relocates in the queue are in the queueMap exactly.
|
||
auto range = queueMap.rangeContaining( rdit->keys.begin );
|
||
if( range.value() != *rdit || range.range() != rdit->keys )
|
||
TraceEvent(SevError, "DDQueueValidateError4").detail("Problem", "relocates in the queue are in the queueMap exactly")
|
||
.detail("RangeBegin", range.range().begin)
|
||
.detail("RangeEnd", range.range().end)
|
||
.detail("RelocateBegin2", range.value().keys.begin)
|
||
.detail("RelocateEnd2", range.value().keys.end)
|
||
.detail("RelocateStart", range.value().startTime)
|
||
.detail("MapStart", rdit->startTime)
|
||
.detail("RelocateWork", range.value().workFactor)
|
||
.detail("MapWork", rdit->workFactor)
|
||
.detail("RelocateSrc", range.value().src.size())
|
||
.detail("MapSrc", rdit->src.size())
|
||
.detail("RelocatePrio", range.value().priority)
|
||
.detail("MapPrio", rdit->priority);
|
||
|
||
// relocates in the queue have src servers
|
||
if( !rdit->src.size() )
|
||
TraceEvent(SevError, "DDQueueValidateError5").detail("Problem", "relocates in the queue have src servers");
|
||
|
||
// relocates in the queue do not have a work factor yet.
|
||
if( rdit->workFactor != 0.0 )
|
||
TraceEvent(SevError, "DDQueueValidateError6").detail("Problem", "relocates in the queue do not have a work factor yet");
|
||
|
||
bool contains = false;
|
||
for( int i = 0; i < rdit->src.size(); i++ ) {
|
||
if( rdit->src[i] == it->first ) {
|
||
contains = true;
|
||
break;
|
||
}
|
||
}
|
||
if( !contains )
|
||
TraceEvent(SevError, "DDQueueValidateError7").detail("Problem", "queued relocate data does not include ss under which its filed");
|
||
}
|
||
}*/
|
||
|
||
auto inFlightRanges = inFlight.ranges();
|
||
for (auto it = inFlightRanges.begin(); it != inFlightRanges.end(); ++it) {
|
||
for (int i = 0; i < it->value().src.size(); i++) {
|
||
// each server in the inFlight map is in the busymap
|
||
if (!busymap.contains(it->value().src[i]))
|
||
TraceEvent(SevError, "DDQueueValidateError8")
|
||
.detail("Problem", "each server in the inFlight map is in the busymap");
|
||
|
||
// relocate data that is inFlight is not also in the queue
|
||
if (queue[it->value().src[i]].contains(it->value()))
|
||
TraceEvent(SevError, "DDQueueValidateError9")
|
||
.detail("Problem", "relocate data that is inFlight is not also in the queue");
|
||
}
|
||
|
||
for (int i = 0; i < it->value().completeDests.size(); i++) {
|
||
// each server in the inFlight map is in the dest busymap
|
||
if (!destBusymap.contains(it->value().completeDests[i]))
|
||
TraceEvent(SevError, "DDQueueValidateError10")
|
||
.detail("Problem", "each server in the inFlight map is in the destBusymap");
|
||
}
|
||
|
||
// in flight relocates have source servers
|
||
if (it->value().startTime != -1 && !it->value().src.size())
|
||
TraceEvent(SevError, "DDQueueValidateError11")
|
||
.detail("Problem", "in flight relocates have source servers");
|
||
|
||
if (inFlightActors.liveActorAt(it->range().begin)) {
|
||
// the key range in the inFlight map matches the key range in the RelocateData message
|
||
if (it->value().keys != it->range())
|
||
TraceEvent(SevError, "DDQueueValidateError12")
|
||
.detail("Problem",
|
||
"the key range in the inFlight map matches the key range in the RelocateData message");
|
||
} else if (it->value().cancellable) {
|
||
TraceEvent(SevError, "DDQueueValidateError13")
|
||
.detail("Problem", "key range is cancellable but not in flight!")
|
||
.detail("Range", it->range());
|
||
}
|
||
}
|
||
|
||
for (auto it = busymap.begin(); it != busymap.end(); ++it) {
|
||
for (int i = 0; i < it->second.ledger.size() - 1; i++) {
|
||
if (it->second.ledger[i] < it->second.ledger[i + 1])
|
||
TraceEvent(SevError, "DDQueueValidateError14")
|
||
.detail("Problem", "ascending ledger problem")
|
||
.detail("LedgerLevel", i)
|
||
.detail("LedgerValueA", it->second.ledger[i])
|
||
.detail("LedgerValueB", it->second.ledger[i + 1]);
|
||
if (it->second.ledger[i] < 0.0)
|
||
TraceEvent(SevError, "DDQueueValidateError15")
|
||
.detail("Problem", "negative ascending problem")
|
||
.detail("LedgerLevel", i)
|
||
.detail("LedgerValue", it->second.ledger[i]);
|
||
}
|
||
}
|
||
|
||
for (auto it = destBusymap.begin(); it != destBusymap.end(); ++it) {
|
||
for (int i = 0; i < it->second.ledger.size() - 1; i++) {
|
||
if (it->second.ledger[i] < it->second.ledger[i + 1])
|
||
TraceEvent(SevError, "DDQueueValidateError16")
|
||
.detail("Problem", "ascending ledger problem")
|
||
.detail("LedgerLevel", i)
|
||
.detail("LedgerValueA", it->second.ledger[i])
|
||
.detail("LedgerValueB", it->second.ledger[i + 1]);
|
||
if (it->second.ledger[i] < 0.0)
|
||
TraceEvent(SevError, "DDQueueValidateError17")
|
||
.detail("Problem", "negative ascending problem")
|
||
.detail("LedgerLevel", i)
|
||
.detail("LedgerValue", it->second.ledger[i]);
|
||
}
|
||
}
|
||
|
||
std::set<RelocateData, std::greater<RelocateData>> queuedRelocationsMatch;
|
||
for (auto it = queue.begin(); it != queue.end(); ++it)
|
||
queuedRelocationsMatch.insert(it->second.begin(), it->second.end());
|
||
ASSERT(queuedRelocations == queuedRelocationsMatch.size() + fetchingSourcesQueue.size());
|
||
|
||
int testActive = 0;
|
||
for (auto it = priority_relocations.begin(); it != priority_relocations.end(); ++it)
|
||
testActive += it->second;
|
||
ASSERT(activeRelocations + queuedRelocations == testActive);
|
||
}
|
||
}
|
||
|
||
void DDQueue::queueRelocation(RelocateShard rs, std::set<UID>& serversToLaunchFrom) {
|
||
//TraceEvent("QueueRelocationBegin").detail("Begin", rd.keys.begin).detail("End", rd.keys.end);
|
||
|
||
// remove all items from both queues that are fully contained in the new relocation (i.e. will be overwritten)
|
||
RelocateData rd(rs);
|
||
bool hasHealthPriority = RelocateData::isHealthPriority(rd.priority);
|
||
bool hasBoundaryPriority = RelocateData::isBoundaryPriority(rd.priority);
|
||
|
||
auto ranges = queueMap.intersectingRanges(rd.keys);
|
||
for (auto r = ranges.begin(); r != ranges.end(); ++r) {
|
||
RelocateData& rrs = r->value();
|
||
|
||
auto fetchingSourcesItr = fetchingSourcesQueue.find(rrs);
|
||
bool foundActiveFetching = fetchingSourcesItr != fetchingSourcesQueue.end();
|
||
std::set<RelocateData, std::greater<RelocateData>>* firstQueue;
|
||
std::set<RelocateData, std::greater<RelocateData>>::iterator firstRelocationItr;
|
||
bool foundActiveRelocation = false;
|
||
|
||
if (!foundActiveFetching && rrs.src.size()) {
|
||
firstQueue = &queue[rrs.src[0]];
|
||
firstRelocationItr = firstQueue->find(rrs);
|
||
foundActiveRelocation = firstRelocationItr != firstQueue->end();
|
||
}
|
||
|
||
// If there is a queued job that wants data relocation which we are about to cancel/modify,
|
||
// make sure that we keep the relocation intent for the job that we queue up
|
||
if (foundActiveFetching || foundActiveRelocation) {
|
||
rd.wantsNewServers |= rrs.wantsNewServers;
|
||
rd.startTime = std::min(rd.startTime, rrs.startTime);
|
||
if (!hasHealthPriority) {
|
||
rd.healthPriority = std::max(rd.healthPriority, rrs.healthPriority);
|
||
}
|
||
if (!hasBoundaryPriority) {
|
||
rd.boundaryPriority = std::max(rd.boundaryPriority, rrs.boundaryPriority);
|
||
}
|
||
rd.priority = std::max(rd.priority, std::max(rd.boundaryPriority, rd.healthPriority));
|
||
}
|
||
|
||
if (rd.keys.contains(rrs.keys)) {
|
||
if (foundActiveFetching)
|
||
fetchingSourcesQueue.erase(fetchingSourcesItr);
|
||
else if (foundActiveRelocation) {
|
||
firstQueue->erase(firstRelocationItr);
|
||
for (int i = 1; i < rrs.src.size(); i++)
|
||
queue[rrs.src[i]].erase(rrs);
|
||
}
|
||
}
|
||
|
||
if (foundActiveFetching || foundActiveRelocation) {
|
||
serversToLaunchFrom.insert(rrs.src.begin(), rrs.src.end());
|
||
/*TraceEvent(rrs.interval.end(), mi.id()).detail("Result","Cancelled")
|
||
.detail("WasFetching", foundActiveFetching).detail("Contained", rd.keys.contains( rrs.keys ));*/
|
||
queuedRelocations--;
|
||
TraceEvent(SevVerbose, "QueuedRelocationsChanged")
|
||
.detail("DataMoveID", rrs.dataMoveId)
|
||
.detail("RandomID", rrs.randomId)
|
||
.detail("Total", queuedRelocations);
|
||
finishRelocation(rrs.priority, rrs.healthPriority);
|
||
}
|
||
}
|
||
|
||
// determine the final state of the relocations map
|
||
auto affectedQueuedItems = queueMap.getAffectedRangesAfterInsertion(rd.keys, rd);
|
||
|
||
// put the new request into the global map of requests (modifies the ranges already present)
|
||
queueMap.insert(rd.keys, rd);
|
||
|
||
// cancel all the getSourceServers actors that intersect the new range that we will be getting
|
||
getSourceActors.cancel(KeyRangeRef(affectedQueuedItems.front().begin, affectedQueuedItems.back().end));
|
||
|
||
// update fetchingSourcesQueue and the per-server queue based on truncated ranges after insertion, (re-)launch
|
||
// getSourceServers
|
||
auto queueMapItr = queueMap.rangeContaining(affectedQueuedItems[0].begin);
|
||
|
||
// Put off erasing elements from fetchingSourcesQueue
|
||
std::set<RelocateData, std::greater<RelocateData>> delayDelete;
|
||
for (int r = 0; r < affectedQueuedItems.size(); ++r, ++queueMapItr) {
|
||
// ASSERT(queueMapItr->value() == queueMap.rangeContaining(affectedQueuedItems[r].begin)->value());
|
||
RelocateData& rrs = queueMapItr->value();
|
||
|
||
if (rrs.src.size() == 0 && (rrs.keys == rd.keys || fetchingSourcesQueue.contains(rrs))) {
|
||
if (rrs.keys != rd.keys) {
|
||
delayDelete.insert(rrs);
|
||
}
|
||
|
||
rrs.keys = affectedQueuedItems[r];
|
||
rrs.interval = TraceInterval("QueuedRelocation", rrs.randomId); // inherit the old randomId
|
||
|
||
DebugRelocationTraceEvent(rrs.interval.begin(), distributorId)
|
||
.detail("KeyBegin", rrs.keys.begin)
|
||
.detail("KeyEnd", rrs.keys.end)
|
||
.detail("Priority", rrs.priority)
|
||
.detail("WantsNewServers", rrs.wantsNewServers);
|
||
|
||
queuedRelocations++;
|
||
TraceEvent(SevVerbose, "QueuedRelocationsChanged")
|
||
.detail("DataMoveID", rrs.dataMoveId)
|
||
.detail("RandomID", rrs.randomId)
|
||
.detail("Total", queuedRelocations);
|
||
startRelocation(rrs.priority, rrs.healthPriority);
|
||
|
||
fetchingSourcesQueue.insert(rrs);
|
||
getSourceActors.insert(rrs.keys,
|
||
getSourceServersForRange(this, rrs, fetchSourceServersComplete, fetchSourceLock));
|
||
} else {
|
||
RelocateData newData(rrs);
|
||
newData.keys = affectedQueuedItems[r];
|
||
ASSERT(rrs.src.size() || rrs.startTime == -1);
|
||
|
||
bool foundActiveRelocation = false;
|
||
for (int i = 0; i < rrs.src.size(); i++) {
|
||
auto& serverQueue = queue[rrs.src[i]];
|
||
|
||
if (serverQueue.erase(rrs) > 0) {
|
||
if (!foundActiveRelocation) {
|
||
newData.interval = TraceInterval("QueuedRelocation", rrs.randomId); // inherit the old randomId
|
||
|
||
DebugRelocationTraceEvent(newData.interval.begin(), distributorId)
|
||
.detail("KeyBegin", newData.keys.begin)
|
||
.detail("KeyEnd", newData.keys.end)
|
||
.detail("Priority", newData.priority)
|
||
.detail("WantsNewServers", newData.wantsNewServers);
|
||
|
||
queuedRelocations++;
|
||
TraceEvent(SevVerbose, "QueuedRelocationsChanged")
|
||
.detail("DataMoveID", newData.dataMoveId)
|
||
.detail("RandomID", newData.randomId)
|
||
.detail("Total", queuedRelocations);
|
||
startRelocation(newData.priority, newData.healthPriority);
|
||
foundActiveRelocation = true;
|
||
}
|
||
|
||
serverQueue.insert(newData);
|
||
} else
|
||
break;
|
||
}
|
||
|
||
// We update the keys of a relocation even if it is "dead" since it helps validate()
|
||
rrs.keys = affectedQueuedItems[r];
|
||
rrs.interval = newData.interval;
|
||
}
|
||
}
|
||
|
||
for (auto it : delayDelete) {
|
||
fetchingSourcesQueue.erase(it);
|
||
}
|
||
DebugRelocationTraceEvent("ReceivedRelocateShard", distributorId)
|
||
.detail("KeyBegin", rd.keys.begin)
|
||
.detail("KeyEnd", rd.keys.end)
|
||
.detail("Priority", rd.priority)
|
||
.detail("AffectedRanges", affectedQueuedItems.size());
|
||
}
|
||
|
||
void DDQueue::completeSourceFetch(const RelocateData& results) {
|
||
ASSERT(fetchingSourcesQueue.contains(results));
|
||
|
||
// logRelocation( results, "GotSourceServers" );
|
||
|
||
fetchingSourcesQueue.erase(results);
|
||
queueMap.insert(results.keys, results);
|
||
for (int i = 0; i < results.src.size(); i++) {
|
||
queue[results.src[i]].insert(results);
|
||
}
|
||
updateLastAsSource(results.src);
|
||
serverCounter.increaseForTeam(results.src, results.reason, ServerCounter::CountType::QueuedSource);
|
||
}
|
||
|
||
void DDQueue::logRelocation(const RelocateData& rd, const char* title) {
|
||
std::string busyString;
|
||
for (int i = 0; i < rd.src.size() && i < teamSize * 2; i++)
|
||
busyString += describe(rd.src[i]) + " - (" + busymap[rd.src[i]].toString() + "); ";
|
||
|
||
TraceEvent(title, distributorId)
|
||
.detail("KeyBegin", rd.keys.begin)
|
||
.detail("KeyEnd", rd.keys.end)
|
||
.detail("Priority", rd.priority)
|
||
.detail("WorkFactor", rd.workFactor)
|
||
.detail("SourceServerCount", rd.src.size())
|
||
.detail("SourceServers", describe(rd.src, teamSize * 2))
|
||
.detail("SourceBusyness", busyString);
|
||
}
|
||
|
||
void DDQueue::launchQueuedWork(KeyRange keys, const DDEnabledState* ddEnabledState) {
|
||
// combine all queued work in the key range and check to see if there is anything to launch
|
||
std::set<RelocateData, std::greater<RelocateData>> combined;
|
||
auto f = queueMap.intersectingRanges(keys);
|
||
for (auto it = f.begin(); it != f.end(); ++it) {
|
||
if (it->value().src.size() && queue[it->value().src[0]].contains(it->value()))
|
||
combined.insert(it->value());
|
||
}
|
||
launchQueuedWork(combined, ddEnabledState);
|
||
}
|
||
|
||
void DDQueue::launchQueuedWork(const std::set<UID>& serversToLaunchFrom, const DDEnabledState* ddEnabledState) {
|
||
// combine all work from the source servers to see if there is anything new to launch
|
||
std::set<RelocateData, std::greater<RelocateData>> combined;
|
||
for (auto id : serversToLaunchFrom) {
|
||
auto& queuedWork = queue[id];
|
||
auto it = queuedWork.begin();
|
||
for (int j = 0; j < teamSize && it != queuedWork.end(); j++) {
|
||
combined.insert(*it);
|
||
++it;
|
||
}
|
||
}
|
||
launchQueuedWork(combined, ddEnabledState);
|
||
}
|
||
|
||
void DDQueue::launchQueuedWork(RelocateData launchData, const DDEnabledState* ddEnabledState) {
|
||
// check a single RelocateData to see if it can be launched
|
||
std::set<RelocateData, std::greater<RelocateData>> combined;
|
||
combined.insert(launchData);
|
||
launchQueuedWork(combined, ddEnabledState);
|
||
}
|
||
|
||
DataMoveType newDataMoveType(bool doBulkLoading) {
|
||
DataMoveType type = DataMoveType::LOGICAL;
|
||
if (deterministicRandom()->random01() < SERVER_KNOBS->DD_PHYSICAL_SHARD_MOVE_PROBABILITY) {
|
||
type = DataMoveType::PHYSICAL;
|
||
}
|
||
if (type != DataMoveType::PHYSICAL && SERVER_KNOBS->ENABLE_PHYSICAL_SHARD_MOVE_EXPERIMENT) {
|
||
type = DataMoveType::PHYSICAL_EXP;
|
||
}
|
||
if (doBulkLoading) {
|
||
if (type == DataMoveType::LOGICAL) {
|
||
type = DataMoveType::LOGICAL_BULKLOAD;
|
||
} else if (type == DataMoveType::PHYSICAL || type == DataMoveType::PHYSICAL_EXP) {
|
||
type = DataMoveType::PHYSICAL_BULKLOAD;
|
||
} else {
|
||
UNREACHABLE();
|
||
}
|
||
}
|
||
return type;
|
||
}
|
||
|
||
bool runPendingBulkLoadTaskWithRelocateData(DDQueue* self, RelocateData& rd) {
|
||
bool doBulkLoading = false;
|
||
Optional<DDBulkLoadEngineTask> task = self->bulkLoadTaskCollection->getTaskByRange(rd.keys);
|
||
if (task.present() && task.get().coreState.onAnyPhase({ BulkLoadPhase::Triggered, BulkLoadPhase::Running })) {
|
||
rd.bulkLoadTask = task.get();
|
||
doBulkLoading = true;
|
||
}
|
||
if (doBulkLoading) {
|
||
try {
|
||
self->bulkLoadTaskCollection->startTask(rd.bulkLoadTask.get().coreState);
|
||
} catch (Error& e) {
|
||
ASSERT_WE_THINK(e.code() == error_code_bulkload_task_outdated);
|
||
if (e.code() == error_code_bulkload_task_outdated) {
|
||
TraceEvent(SevError, "DDBulkLoadTaskOutdatedWhenStartRelocator", self->distributorId)
|
||
.setMaxEventLength(-1)
|
||
.setMaxFieldLength(-1)
|
||
.detail("NewDataMoveID", rd.dataMoveId)
|
||
.detail("NewDataMovePriority", rd.priority)
|
||
.detail("NewDataMoveRange", rd.keys)
|
||
.detail("BulkLoadTask", rd.bulkLoadTask.get().toString());
|
||
throw movekeys_conflict();
|
||
} else {
|
||
throw e;
|
||
}
|
||
}
|
||
}
|
||
return doBulkLoading;
|
||
}
|
||
|
||
// For each relocateData rd in the queue, check if there exist inflight relocate data whose keyrange is overlapped
|
||
// with rd. If there exist, cancel them by cancelling their actors and reducing the src servers' busyness of those
|
||
// canceled inflight relocateData. Launch the relocation for the rd.
|
||
void DDQueue::launchQueuedWork(std::set<RelocateData, std::greater<RelocateData>> combined,
|
||
const DDEnabledState* ddEnabledState) {
|
||
[[maybe_unused]] int startedHere = 0;
|
||
double startTime = now();
|
||
// kick off relocators from items in the queue as need be
|
||
auto it = combined.begin();
|
||
for (; it != combined.end(); it++) {
|
||
RelocateData rd(*it);
|
||
|
||
// If having a bulk load task overlapping the rd range,
|
||
// attach bulk load task to the input rd if rd is not a data move
|
||
// for unhealthy. Make the bulk load task visible on the global task map
|
||
bool doBulkLoading = runPendingBulkLoadTaskWithRelocateData(this, rd);
|
||
if (doBulkLoading) {
|
||
TraceEvent(bulkLoadVerboseEventSev(), "DDBulkLoadTaskLaunchingDataMove", this->distributorId)
|
||
.detail("NewDataMoveId", rd.dataMoveId)
|
||
.detail("NewDataMovePriority", rd.priority)
|
||
.detail("NewDataMoveRange", rd.keys)
|
||
.detail("TaskID", rd.bulkLoadTask.get().coreState.getTaskId().toString())
|
||
.detail("JobID", rd.bulkLoadTask.get().coreState.getJobId().toString());
|
||
}
|
||
|
||
// Check if there is an inflight shard that is overlapped with the queued relocateShard (rd)
|
||
bool overlappingInFlight = false;
|
||
auto intersectingInFlight = inFlight.intersectingRanges(rd.keys);
|
||
for (auto it = intersectingInFlight.begin(); it != intersectingInFlight.end(); ++it) {
|
||
if (fetchKeysComplete.contains(it->value()) && inFlightActors.liveActorAt(it->range().begin) &&
|
||
!rd.keys.contains(it->range()) && it->value().priority >= rd.priority &&
|
||
rd.healthPriority < SERVER_KNOBS->PRIORITY_TEAM_UNHEALTHY) {
|
||
|
||
DebugRelocationTraceEvent("OverlappingInFlight", distributorId)
|
||
.detail("KeyBegin", it->value().keys.begin)
|
||
.detail("KeyEnd", it->value().keys.end)
|
||
.detail("Priority", it->value().priority);
|
||
|
||
overlappingInFlight = true;
|
||
break;
|
||
}
|
||
}
|
||
|
||
if (overlappingInFlight) {
|
||
ASSERT(!rd.isRestore());
|
||
// logRelocation( rd, "SkippingOverlappingInFlight" );
|
||
continue;
|
||
}
|
||
|
||
// Because the busyness of a server is decreased when a superseding relocation is issued, we
|
||
// need to consider what the busyness of a server WOULD be if
|
||
auto containedRanges = inFlight.containedRanges(rd.keys);
|
||
std::vector<RelocateData> cancellableRelocations;
|
||
for (auto it = containedRanges.begin(); it != containedRanges.end(); ++it) {
|
||
if (it.value().cancellable) {
|
||
cancellableRelocations.push_back(it->value());
|
||
}
|
||
}
|
||
|
||
// Data movement avoids overloading source servers in moving data.
|
||
// SOMEDAY: the list of source servers may be outdated since they were fetched when the work was put in the
|
||
// queue
|
||
// FIXME: we need spare capacity even when we're just going to be cancelling work via TEAM_HEALTHY
|
||
if (!rd.isRestore() && !canLaunchSrc(rd, teamSize, singleRegionTeamSize, busymap, cancellableRelocations)) {
|
||
// logRelocation( rd, "SkippingQueuedRelocation" );
|
||
if (rd.bulkLoadTask.present()) {
|
||
TraceEvent(SevError, "DDBulkLoadTaskDelayedByBusySrc", this->distributorId)
|
||
.setMaxEventLength(-1)
|
||
.setMaxFieldLength(-1)
|
||
.detail("BulkLoadTask", rd.bulkLoadTask.get().toString());
|
||
}
|
||
continue;
|
||
}
|
||
|
||
// From now on, the source servers for the RelocateData rd have enough resource to move the data away,
|
||
// because they do not have too much inflight data movement.
|
||
|
||
// logRelocation( rd, "LaunchingRelocation" );
|
||
DebugRelocationTraceEvent(rd.interval.end(), distributorId).detail("Result", "Success");
|
||
|
||
if (!rd.isRestore()) {
|
||
queuedRelocations--;
|
||
TraceEvent(SevVerbose, "QueuedRelocationsChanged")
|
||
.detail("DataMoveID", rd.dataMoveId)
|
||
.detail("RandomID", rd.randomId)
|
||
.detail("Total", queuedRelocations);
|
||
finishRelocation(rd.priority, rd.healthPriority);
|
||
|
||
// now we are launching: remove this entry from the queue of all the src servers
|
||
for (size_t i = 0; i < rd.src.size(); i++) {
|
||
const auto result = queue[rd.src[i]].erase(rd);
|
||
ASSERT(result);
|
||
}
|
||
}
|
||
|
||
// If there is a job in flight that wants data relocation which we are about to cancel/modify,
|
||
// make sure that we keep the relocation intent for the job that we launch
|
||
auto f = inFlight.intersectingRanges(rd.keys);
|
||
for (auto it = f.begin(); it != f.end(); ++it) {
|
||
if (inFlightActors.liveActorAt(it->range().begin)) {
|
||
rd.wantsNewServers |= it->value().wantsNewServers;
|
||
}
|
||
}
|
||
startedHere++;
|
||
|
||
// update both inFlightActors and inFlight key range maps, cancelling deleted RelocateShards
|
||
std::vector<KeyRange> ranges;
|
||
inFlightActors.getRangesAffectedByInsertion(rd.keys, ranges);
|
||
inFlightActors.cancel(KeyRangeRef(ranges.front().begin, ranges.back().end));
|
||
// The cancelDataMove feature assumes inFlightActors are immediately cancelled.
|
||
// If this is not true, multiple inflightActors can have overlapped range,
|
||
// which leads to conflicts of moving keys
|
||
|
||
Future<Void> fCleanup =
|
||
SERVER_KNOBS->SHARD_ENCODE_LOCATION_METADATA ? cancelDataMove(this, rd.keys, ddEnabledState) : Void();
|
||
|
||
inFlight.insert(rd.keys, rd);
|
||
for (int r = 0; r < ranges.size(); r++) {
|
||
RelocateData& rrs = inFlight.rangeContaining(ranges[r].begin)->value();
|
||
rrs.keys = ranges[r];
|
||
if (rrs.bulkLoadTask.present() && rrs.bulkLoadTask.get().coreState.getRange() != rrs.keys) {
|
||
// The new bulk load data move partially overwrites an old bulk load data move.
|
||
// In this case, the old bulk load task is cancelled.
|
||
// For the range that is not covered by the new data move, drop the bulk load task and
|
||
// run it as a normal data move.
|
||
ASSERT(rrs.bulkLoadTask.get().coreState.getRange().contains(rrs.keys));
|
||
rrs.bulkLoadTask.reset();
|
||
}
|
||
if (rd.keys == ranges[r] && rd.isRestore()) {
|
||
ASSERT(rd.dataMove != nullptr);
|
||
ASSERT(SERVER_KNOBS->SHARD_ENCODE_LOCATION_METADATA);
|
||
rrs.dataMoveId = rd.dataMove->meta.id;
|
||
} else {
|
||
ASSERT_WE_THINK(!rd.isRestore()); // Restored data move should not overlap.
|
||
// TODO(psm): The shard id is determined by DD.
|
||
rrs.dataMove.reset();
|
||
if (SERVER_KNOBS->SHARD_ENCODE_LOCATION_METADATA) {
|
||
if (SERVER_KNOBS->ENABLE_DD_PHYSICAL_SHARD) {
|
||
rrs.dataMoveId = UID();
|
||
} else if (rrs.bulkLoadTask.present()) {
|
||
// We have to decide this after prevCleanup completes.
|
||
// For details, see the comment in dataDistributionRelocator.
|
||
rrs.dataMoveId = UID();
|
||
} else {
|
||
DataMoveType dataMoveType = newDataMoveType(rrs.bulkLoadTask.present());
|
||
rrs.dataMoveId = newDataMoveId(
|
||
deterministicRandom()->randomUInt64(), AssignEmptyRange::False, dataMoveType, rrs.dmReason);
|
||
TraceEvent(SevInfo, "NewDataMoveWithRandomDestID", this->distributorId)
|
||
.detail("DataMoveID", rrs.dataMoveId.toString())
|
||
.detail("TrackID", rrs.randomId)
|
||
.detail("Range", rrs.keys)
|
||
.detail("Reason", rrs.reason.toString())
|
||
.detail("DataMoveType", dataMoveType)
|
||
.detail("DataMoveReason", static_cast<int>(rrs.dmReason));
|
||
}
|
||
} else {
|
||
rrs.dataMoveId = anonymousShardId;
|
||
TraceEvent(SevInfo, "NewDataMoveWithAnonymousDestID", this->distributorId)
|
||
.detail("DataMoveID", rrs.dataMoveId.toString())
|
||
.detail("TrackID", rrs.randomId)
|
||
.detail("Range", rrs.keys)
|
||
.detail("Reason", rrs.reason.toString())
|
||
.detail("DataMoveReason", static_cast<int>(rrs.dmReason));
|
||
}
|
||
}
|
||
|
||
launch(rrs, busymap, singleRegionTeamSize);
|
||
activeRelocations++;
|
||
TraceEvent(SevVerbose, "InFlightRelocationChange")
|
||
.detail("Launch", rrs.dataMoveId)
|
||
.detail("Total", activeRelocations);
|
||
startRelocation(rrs.priority, rrs.healthPriority);
|
||
// Start the actor that relocates data in the rrs.keys
|
||
inFlightActors.insert(rrs.keys, dataDistributionRelocator(this, rrs, fCleanup, ddEnabledState));
|
||
}
|
||
|
||
// logRelocation( rd, "LaunchedRelocation" );
|
||
}
|
||
if (now() - startTime > .001 && deterministicRandom()->random01() < 0.001)
|
||
TraceEvent(SevWarnAlways, "LaunchingQueueSlowx1000").detail("Elapsed", now() - startTime);
|
||
|
||
/*if( startedHere > 0 ) {
|
||
TraceEvent("StartedDDRelocators", distributorId)
|
||
.detail("QueueSize", queuedRelocations)
|
||
.detail("StartedHere", startedHere)
|
||
.detail("ActiveRelocations", activeRelocations);
|
||
} */
|
||
|
||
validate();
|
||
}
|
||
|
||
int DDQueue::getHighestPriorityRelocation() const {
|
||
int highestPriority{ 0 };
|
||
for (const auto& [priority, count] : priority_relocations) {
|
||
if (count > 0) {
|
||
highestPriority = std::max(highestPriority, priority);
|
||
}
|
||
}
|
||
return highestPriority;
|
||
}
|
||
|
||
// return true if the servers are throttled as source for read rebalance
|
||
bool DDQueue::timeThrottle(const std::vector<UID>& ids) const {
|
||
return std::any_of(ids.begin(), ids.end(), [this](const UID& id) {
|
||
if (this->lastAsSource.contains(id)) {
|
||
return (now() - this->lastAsSource.at(id)) * SERVER_KNOBS->READ_REBALANCE_SRC_PARALLELISM <
|
||
SERVER_KNOBS->STORAGE_METRICS_AVERAGE_INTERVAL;
|
||
}
|
||
return false;
|
||
});
|
||
}
|
||
|
||
void DDQueue::updateLastAsSource(const std::vector<UID>& ids, double t) {
|
||
for (auto& id : ids)
|
||
lastAsSource[id] = t;
|
||
}
|
||
|
||
// Schedules cancellation of a data move.
|
||
void DDQueue::enqueueCancelledDataMove(UID dataMoveId, KeyRange range, const DDEnabledState* ddEnabledState) {
|
||
ASSERT(!txnProcessor->isMocked()); // the mock implementation currently doesn't support data move
|
||
std::vector<Future<Void>> cleanup;
|
||
auto f = this->dataMoves.intersectingRanges(range);
|
||
for (auto it = f.begin(); it != f.end(); ++it) {
|
||
if (it->value().isValid()) {
|
||
TraceEvent(SevError, "DDEnqueueCancelledDataMoveConflict", this->distributorId)
|
||
.detail("DataMoveID", dataMoveId)
|
||
.detail("CancelledRange", range)
|
||
.detail("ConflictingDataMoveID", it->value().id)
|
||
.detail("ConflictingRange", KeyRangeRef(it->range().begin, it->range().end));
|
||
return;
|
||
}
|
||
}
|
||
|
||
DDQueue::DDDataMove dataMove(dataMoveId);
|
||
dataMove.cancel = cleanUpDataMove(txnProcessor->context(),
|
||
dataMoveId,
|
||
this->lock,
|
||
&this->cleanUpDataMoveParallelismLock,
|
||
range,
|
||
ddEnabledState,
|
||
this->addBackgroundCleanUpDataMoveActor);
|
||
this->dataMoves.insert(range, dataMove);
|
||
TraceEvent(SevInfo, "DDEnqueuedCancelledDataMove", this->distributorId)
|
||
.detail("DataMoveID", dataMoveId)
|
||
.detail("Range", range);
|
||
}
|
||
|
||
Future<Void> DDQueue::periodicalRefreshCounter() {
|
||
auto f = [this]() {
|
||
serverCounter.traceAll(distributorId);
|
||
serverCounter.clear();
|
||
};
|
||
return recurring(f, SERVER_KNOBS->DD_QUEUE_COUNTER_REFRESH_INTERVAL);
|
||
}
|
||
|
||
int DDQueue::getUnhealthyRelocationCount() const {
|
||
return unhealthyRelocations;
|
||
}
|
||
|
||
// Cancel existing relocation if exists, and serialize all concurrent relocations
|
||
ACTOR Future<Void> cancelDataMove(class DDQueue* self, KeyRange range, const DDEnabledState* ddEnabledState) {
|
||
state std::vector<Future<Void>> cleanup;
|
||
state std::vector<std::pair<KeyRange, UID>> lastObservedDataMoves;
|
||
|
||
try {
|
||
lastObservedDataMoves.clear();
|
||
auto f = self->dataMoves.intersectingRanges(range);
|
||
for (auto it = f.begin(); it != f.end(); ++it) {
|
||
if (!it->value().isValid()) {
|
||
continue;
|
||
}
|
||
KeyRange keys = KeyRangeRef(it->range().begin, it->range().end);
|
||
TraceEvent(SevInfo, "DDQueueCancelDataMove", self->distributorId)
|
||
.detail("DataMoveID", it->value().id)
|
||
.detail("DataMoveRange", keys)
|
||
.detail("Range", range);
|
||
if (!it->value().cancel.isValid()) {
|
||
it->value().cancel = cleanUpDataMove(self->txnProcessor->context(),
|
||
it->value().id,
|
||
self->lock,
|
||
&self->cleanUpDataMoveParallelismLock,
|
||
keys,
|
||
ddEnabledState,
|
||
self->addBackgroundCleanUpDataMoveActor);
|
||
}
|
||
lastObservedDataMoves.push_back(std::make_pair(keys, it->value().id));
|
||
cleanup.push_back(it->value().cancel);
|
||
}
|
||
|
||
wait(waitForAll(cleanup));
|
||
|
||
// Since self->dataMoves can only be updated by relocator,
|
||
// and any old relocator has been cancelled (by overwrite inflightActors)
|
||
// Thus, any update of self->dataMoves during the wait must come from
|
||
// a newer relocator.
|
||
// This cancelDataMove should be transparent to the new relocator
|
||
std::vector<KeyRange> toResetRanges;
|
||
for (auto observedDataMove : lastObservedDataMoves) {
|
||
auto f = self->dataMoves.intersectingRanges(observedDataMove.first);
|
||
for (auto it = f.begin(); it != f.end(); ++it) {
|
||
if (it->value().id != observedDataMove.second) {
|
||
TraceEvent(SevInfo, "DataMoveWrittenByConcurrentDataMove", self->distributorId)
|
||
.detail("Range", range)
|
||
.detail("OldRange", observedDataMove.first)
|
||
.detail("LastObservedDataMoveID", observedDataMove.second)
|
||
.detail("CurrentDataMoveID", it->value().id);
|
||
} else {
|
||
ASSERT(!it->value().isValid() || (it->value().cancel.isValid() && it->value().cancel.isReady()));
|
||
toResetRanges.push_back(Standalone(it->range()));
|
||
}
|
||
}
|
||
}
|
||
for (auto& toResetRange : toResetRanges) {
|
||
self->dataMoves.insert(toResetRange, DDQueue::DDDataMove());
|
||
}
|
||
|
||
} catch (Error& e) {
|
||
throw e;
|
||
}
|
||
|
||
return Void();
|
||
}
|
||
|
||
static std::string destServersString(std::vector<std::pair<Reference<IDataDistributionTeam>, bool>> const& bestTeams) {
|
||
std::stringstream ss;
|
||
|
||
for (auto& tc : bestTeams) {
|
||
for (const auto& id : tc.first->getServerIDs()) {
|
||
ss << id.toString() << " ";
|
||
}
|
||
}
|
||
|
||
return std::move(ss).str();
|
||
}
|
||
|
||
void traceRelocateDecision(TraceEvent& ev, const UID& pairId, const RelocateDecision& decision) {
|
||
ev.detail("PairId", pairId)
|
||
.detail("Priority", decision.rd.priority)
|
||
.detail("KeyBegin", decision.rd.keys.begin)
|
||
.detail("KeyEnd", decision.rd.keys.end)
|
||
.detail("Reason", decision.rd.reason.toString())
|
||
.detail("SourceServers", describe(decision.rd.src))
|
||
.detail("DestinationTeam", describe(decision.destIds))
|
||
.detail("ExtraIds", describe(decision.extraIds));
|
||
if (SERVER_KNOBS->DD_ENABLE_VERBOSE_TRACING) {
|
||
// StorageMetrics is the rd shard's metrics, e.g., bytes and write bandwidth
|
||
ev.detail("StorageMetrics", decision.metrics.toString());
|
||
}
|
||
|
||
if (decision.rd.reason == RelocateReason::WRITE_SPLIT) {
|
||
// tell if the splitter acted as expected for write bandwidth splitting
|
||
// SOMEDAY: trace the source team write bytes if necessary
|
||
ev.detail("ShardWriteBytes", decision.metrics.bytesWrittenPerKSecond)
|
||
.detail("ParentShardWriteBytes", decision.parentMetrics.get().bytesWrittenPerKSecond);
|
||
} else if (decision.rd.reason == RelocateReason::SIZE_SPLIT) {
|
||
ev.detail("ShardSize", decision.metrics.bytes).detail("ParentShardSize", decision.parentMetrics.get().bytes);
|
||
}
|
||
}
|
||
|
||
static int nonOverlappedServerCount(const std::vector<UID>& srcIds, const std::vector<UID>& destIds) {
|
||
std::unordered_set<UID> srcSet{ srcIds.begin(), srcIds.end() };
|
||
int count = 0;
|
||
for (int i = 0; i < destIds.size(); i++) {
|
||
if (!srcSet.contains(destIds[i])) {
|
||
count++;
|
||
}
|
||
}
|
||
return count;
|
||
}
|
||
|
||
void validateBulkLoadRelocateData(const RelocateData& rd, const std::vector<UID>& destIds, UID logId) {
|
||
BulkLoadTaskState bulkLoadTaskState = rd.bulkLoadTask.get().coreState;
|
||
if (rd.keys != bulkLoadTaskState.getRange()) {
|
||
TraceEvent(SevError, "DDBulkLoadTaskLaunchFailed", logId)
|
||
.detail("Reason", "Wrong data move range")
|
||
.detail("BulkLoadTask", bulkLoadTaskState.toString())
|
||
.detail("DataMovePriority", rd.priority)
|
||
.detail("DataMoveId", rd.dataMoveId)
|
||
.detail("RelocatorRange", rd.keys);
|
||
throw movekeys_conflict();
|
||
// Very important invariant. If this error appears, check the logic
|
||
}
|
||
for (const auto& destId : destIds) {
|
||
if (std::find(rd.src.begin(), rd.src.end(), destId) != rd.src.end()) {
|
||
// In this case, getTeam has to select src as dest when remote team collection is not ready
|
||
// This is not expected
|
||
TraceEvent(SevError, "DDBulkLoadEngineTaskLaunchFailed", logId)
|
||
.detail("Reason", "Conflict src and destd due to remote recovery")
|
||
.detail("BulkLoadTask", bulkLoadTaskState.toString())
|
||
.detail("DataMovePriority", rd.priority)
|
||
.detail("DataMoveId", rd.dataMoveId)
|
||
.detail("RelocatorRange", rd.keys);
|
||
throw movekeys_conflict();
|
||
}
|
||
}
|
||
return;
|
||
}
|
||
|
||
// With probability, set wantTrueBestIfMoveout true for teamUnhealthy data moves and teamRedundant data moves only.
|
||
// This flag takes effect in getTeam. When the flag is set true, DD always getBestTeam for teamRedundant data moves and
|
||
// do getBestTeam for a teamRedundant data move if the data move decides to move data out of a SS.
|
||
bool getWantTrueBestIfMoveout(int priority) {
|
||
if (priority == SERVER_KNOBS->PRIORITY_TEAM_UNHEALTHY) {
|
||
return deterministicRandom()->random01() <
|
||
SERVER_KNOBS->PROBABILITY_TEAM_UNHEALTHY_DATAMOVE_CHOOSE_TRUE_BEST_DEST;
|
||
} else if (priority == SERVER_KNOBS->PRIORITY_TEAM_REDUNDANT) {
|
||
return deterministicRandom()->random01() <
|
||
SERVER_KNOBS->PROBABILITY_TEAM_REDUNDANT_DATAMOVE_CHOOSE_TRUE_BEST_DEST;
|
||
} else {
|
||
return false;
|
||
}
|
||
}
|
||
|
||
// This actor relocates the specified keys to a good place.
|
||
// The inFlightActor key range map stores the actor for each RelocateData
|
||
ACTOR Future<Void> dataDistributionRelocator(DDQueue* self,
|
||
RelocateData rd,
|
||
Future<Void> prevCleanup,
|
||
const DDEnabledState* ddEnabledState) {
|
||
state Promise<Void> errorOut(self->error);
|
||
state TraceInterval relocateShardInterval("RelocateShard", rd.randomId);
|
||
state PromiseStream<RelocateData> dataTransferComplete(self->dataTransferComplete);
|
||
state PromiseStream<RelocateData> relocationComplete(self->relocationComplete);
|
||
state bool signalledTransferComplete = false;
|
||
state UID distributorId = self->distributorId;
|
||
state ParallelTCInfo healthyDestinations;
|
||
|
||
state bool anyHealthy = false;
|
||
state bool allHealthy = true;
|
||
state bool anyWithSource = false;
|
||
state bool anyDestOverloaded = false;
|
||
state int destOverloadedCount = 0;
|
||
state int stuckCount = 0;
|
||
state std::vector<std::pair<Reference<IDataDistributionTeam>, bool>> bestTeams;
|
||
state double startTime = now();
|
||
state std::vector<UID> destIds;
|
||
state WantTrueBest wantTrueBest(isValleyFillerPriority(rd.priority));
|
||
state WantTrueBestIfMoveout wantTrueBestIfMoveout(getWantTrueBestIfMoveout(rd.priority));
|
||
state uint64_t debugID = deterministicRandom()->randomUInt64();
|
||
state bool enableShardMove = SERVER_KNOBS->SHARD_ENCODE_LOCATION_METADATA && SERVER_KNOBS->ENABLE_DD_PHYSICAL_SHARD;
|
||
|
||
// We will decide doBulkLoading after prevCleanup completes.
|
||
// rd.bulkLoadTask.present() is just the default value.
|
||
state bool doBulkLoading = rd.bulkLoadTask.present();
|
||
|
||
try {
|
||
if (now() - self->lastInterval < 1.0) {
|
||
relocateShardInterval.severity = SevDebug;
|
||
self->suppressIntervals++;
|
||
}
|
||
|
||
TraceEvent(relocateShardInterval.begin(), distributorId)
|
||
.detail("KeyBegin", rd.keys.begin)
|
||
.detail("KeyEnd", rd.keys.end)
|
||
.detail("Priority", rd.priority)
|
||
.detail("WantTrueBestIfMoveout", wantTrueBestIfMoveout)
|
||
.detail("SuppressedEventCount", self->suppressIntervals);
|
||
|
||
if (relocateShardInterval.severity != SevDebug) {
|
||
self->lastInterval = now();
|
||
self->suppressIntervals = 0;
|
||
}
|
||
|
||
if (SERVER_KNOBS->SHARD_ENCODE_LOCATION_METADATA) {
|
||
auto inFlightRange = self->inFlight.rangeContaining(rd.keys.begin);
|
||
ASSERT(inFlightRange.range() == rd.keys);
|
||
ASSERT(inFlightRange.value().randomId == rd.randomId);
|
||
ASSERT(inFlightRange.value().dataMoveId == rd.dataMoveId);
|
||
inFlightRange.value().cancellable = false;
|
||
|
||
wait(prevCleanup);
|
||
|
||
if (doBulkLoading) {
|
||
// Wait until the overlapped old bulkload relocator get cancelled.
|
||
// At this point, the existing metadata is updated by the old relocator.
|
||
// No more change will be made to the metadata.
|
||
// At this point, we check if the current rd.bulkLoadTask is outdated.
|
||
// If yes, do not do bulkload.
|
||
state Transaction tr(self->txnProcessor->context());
|
||
loop {
|
||
try {
|
||
BulkLoadTaskState currentBulkLoadTaskState =
|
||
wait(getBulkLoadTask(&tr,
|
||
rd.bulkLoadTask.get().coreState.getRange(),
|
||
rd.bulkLoadTask.get().coreState.getTaskId(),
|
||
{ BulkLoadPhase::Triggered, BulkLoadPhase::Running }));
|
||
TraceEvent(bulkLoadVerboseEventSev(), "DDBulkLoadTaskDataMoveLaunched", self->distributorId)
|
||
.detail("TrackID", rd.randomId)
|
||
.detail("DataMovePriority", rd.priority)
|
||
.detail("JobID", rd.bulkLoadTask.get().coreState.getJobId().toString())
|
||
.detail("TaskID", rd.bulkLoadTask.get().coreState.getTaskId().toString())
|
||
.detail("TaskRange", rd.bulkLoadTask.get().coreState.getRange().toString())
|
||
.detail("ExistingJobID", currentBulkLoadTaskState.getJobId().toString())
|
||
.detail("ExistingTaskID", currentBulkLoadTaskState.getTaskId().toString())
|
||
.detail("ExistingTaskRange", currentBulkLoadTaskState.getRange().toString());
|
||
break;
|
||
} catch (Error& e) {
|
||
if (e.code() == error_code_bulkload_task_outdated) {
|
||
// Notify the bulkload task actor to exit. This avoid bulkload task engine
|
||
// gets stuck in case a new task overwrite this task on metadata. To schedule
|
||
// the new task, the old task actor has to exit.
|
||
if (rd.bulkLoadTask.get().completeAck.canBeSet()) {
|
||
rd.bulkLoadTask.get().completeAck.sendError(bulkload_task_outdated());
|
||
}
|
||
doBulkLoading = false;
|
||
// we do not want to reset rd.bulkLoadTask here because
|
||
// the busyness calculation is based on whether rd.bulkLoadTask is set.
|
||
// When calculating the busyness, we do not count the work for any
|
||
// rd with bulkLoadTask set.
|
||
// TODO(BulkLoad): reset rd.bulkLoadTask here for the risk of overloading the source
|
||
// servers.
|
||
TraceEvent(SevWarn, "DDBulkLoadTaskFallbackToNormalDataMove", self->distributorId)
|
||
.detail("TrackID", rd.randomId)
|
||
.detail("DataMovePriority", rd.priority)
|
||
.detail("JobID", rd.bulkLoadTask.get().coreState.getJobId().toString())
|
||
.detail("TaskID", rd.bulkLoadTask.get().coreState.getTaskId().toString())
|
||
.detail("TaskRange", rd.bulkLoadTask.get().coreState.getRange().toString());
|
||
break;
|
||
}
|
||
wait(tr.onError(e));
|
||
}
|
||
}
|
||
DataMoveType dataMoveType = newDataMoveType(doBulkLoading);
|
||
rd.dataMoveId = newDataMoveId(
|
||
deterministicRandom()->randomUInt64(), AssignEmptyRange::False, dataMoveType, rd.dmReason);
|
||
TraceEvent(bulkLoadVerboseEventSev(), "DDBulkLoadTaskNewDataMoveID", self->distributorId)
|
||
.detail("DataMoveID", rd.dataMoveId.toString())
|
||
.detail("TrackID", rd.randomId)
|
||
.detail("Range", rd.keys)
|
||
.detail("Priority", rd.priority)
|
||
.detail("DataMoveType", dataMoveType)
|
||
.detail("DoBulkLoading", doBulkLoading)
|
||
.detail("DataMoveReason", static_cast<int>(rd.dmReason));
|
||
}
|
||
|
||
auto f = self->dataMoves.intersectingRanges(rd.keys);
|
||
for (auto it = f.begin(); it != f.end(); ++it) {
|
||
KeyRangeRef kr(it->range().begin, it->range().end);
|
||
const UID mId = it->value().id;
|
||
if (mId.isValid() && mId != rd.dataMoveId) {
|
||
TraceEvent("DDRelocatorConflictingDataMove", distributorId)
|
||
.detail("CurrentDataMoveID", rd.dataMoveId)
|
||
.detail("DataMoveID", mId)
|
||
.detail("Range", kr);
|
||
}
|
||
}
|
||
if (rd.isRestore() || !SERVER_KNOBS->ENABLE_DD_PHYSICAL_SHARD) {
|
||
if (SERVER_KNOBS->ENABLE_DD_PHYSICAL_SHARD) {
|
||
ASSERT(rd.dataMoveId.isValid());
|
||
}
|
||
self->dataMoves.insert(rd.keys, DDQueue::DDDataMove(rd.dataMoveId));
|
||
}
|
||
// TODO: split-brain issue for physical shard move
|
||
// the update of inflightActor and the update of dataMoves is not atomic
|
||
// Currently, the relocator is triggered based on the inflightActor info.
|
||
// In future, we should assert at here that the intersecting DataMove in self->dataMoves
|
||
// are all invalid. i.e. the range of new relocators is match to the range of prevCleanup.
|
||
}
|
||
|
||
state Optional<StorageMetrics> parentMetrics;
|
||
state StorageMetrics metrics;
|
||
|
||
Future<StorageMetrics> metricsF =
|
||
brokenPromiseToNever(self->getShardMetrics.getReply(GetMetricsRequest(rd.keys)));
|
||
if (rd.getParentRange().present()) {
|
||
Future<StorageMetrics> parentMetricsF =
|
||
brokenPromiseToNever(self->getShardMetrics.getReply(GetMetricsRequest(rd.getParentRange().get())));
|
||
wait(store(metrics, metricsF) && store(parentMetrics, parentMetricsF));
|
||
} else {
|
||
wait(store(metrics, metricsF));
|
||
}
|
||
|
||
state std::unordered_set<uint64_t> excludedDstPhysicalShards;
|
||
|
||
ASSERT(rd.src.size());
|
||
loop {
|
||
destOverloadedCount = 0;
|
||
stuckCount = 0;
|
||
state uint64_t physicalShardIDCandidate = UID().first();
|
||
state bool forceToUseNewPhysicalShard = false;
|
||
loop {
|
||
state int tciIndex = 0;
|
||
state bool foundTeams = true;
|
||
state bool bestTeamReady = false;
|
||
anyHealthy = false;
|
||
allHealthy = true;
|
||
anyWithSource = false;
|
||
anyDestOverloaded = false;
|
||
bestTeams.clear();
|
||
// Get team from teamCollections in different DCs and find the best one
|
||
while (tciIndex < self->teamCollections.size()) {
|
||
if (SERVER_KNOBS->SHARD_ENCODE_LOCATION_METADATA && rd.isRestore()) {
|
||
auto req = GetTeamRequest(tciIndex == 0 ? rd.dataMove->primaryDest : rd.dataMove->remoteDest);
|
||
req.keys = rd.keys;
|
||
Future<std::pair<Optional<Reference<IDataDistributionTeam>>, bool>> fbestTeam =
|
||
brokenPromiseToNever(self->teamCollections[tciIndex].getTeam.getReply(req));
|
||
bestTeamReady = fbestTeam.isReady();
|
||
std::pair<Optional<Reference<IDataDistributionTeam>>, bool> bestTeam = wait(fbestTeam);
|
||
if (tciIndex > 0 && !bestTeamReady) {
|
||
// self->shardsAffectedByTeamFailure->moveShard must be called without any waits after
|
||
// getting the destination team or we could miss failure notifications for the storage
|
||
// servers in the destination team
|
||
TraceEvent("BestTeamNotReady")
|
||
.detail("TraceID", rd.randomId)
|
||
.detail("TeamCollectionIndex", tciIndex)
|
||
.detail("RestoreDataMoveForDest",
|
||
describe(tciIndex == 0 ? rd.dataMove->primaryDest : rd.dataMove->remoteDest));
|
||
self->retryFindDstReasonCount[DDQueue::RetryFindDstReason::RemoteBestTeamNotReady]++;
|
||
foundTeams = false;
|
||
break;
|
||
}
|
||
if (!bestTeam.first.present() || !bestTeam.first.get()->isHealthy()) {
|
||
self->retryFindDstReasonCount[tciIndex == 0
|
||
? DDQueue::RetryFindDstReason::PrimaryNoHealthyTeam
|
||
: DDQueue::RetryFindDstReason::RemoteNoHealthyTeam]++;
|
||
foundTeams = false;
|
||
break;
|
||
}
|
||
anyHealthy = true;
|
||
bestTeams.emplace_back(bestTeam.first.get(), bestTeam.second);
|
||
if (doBulkLoading) {
|
||
TraceEvent(bulkLoadVerboseEventSev(), "DDBulkLoadTaskSelectDestTeam", self->distributorId)
|
||
.detail("Context", "Restore")
|
||
.detail("SrcIds", describe(rd.src))
|
||
.detail("DestIds", bestTeam.first.get()->getServerIDs())
|
||
.detail("DestTeam", bestTeam.first.get()->getTeamID())
|
||
.detail("BulkLoadTask", rd.bulkLoadTask.get().toString())
|
||
.detail("Priority", rd.priority)
|
||
.detail("DataMoveId", rd.dataMoveId)
|
||
.detail("Primary", tciIndex == 0);
|
||
}
|
||
} else {
|
||
double inflightPenalty = SERVER_KNOBS->INFLIGHT_PENALTY_HEALTHY;
|
||
if (rd.healthPriority == SERVER_KNOBS->PRIORITY_TEAM_UNHEALTHY ||
|
||
rd.healthPriority == SERVER_KNOBS->PRIORITY_TEAM_2_LEFT)
|
||
inflightPenalty = SERVER_KNOBS->INFLIGHT_PENALTY_UNHEALTHY;
|
||
if (rd.healthPriority == SERVER_KNOBS->PRIORITY_POPULATE_REGION ||
|
||
rd.healthPriority == SERVER_KNOBS->PRIORITY_TEAM_1_LEFT ||
|
||
rd.healthPriority == SERVER_KNOBS->PRIORITY_TEAM_0_LEFT)
|
||
inflightPenalty = SERVER_KNOBS->INFLIGHT_PENALTY_ONE_LEFT;
|
||
|
||
TeamSelect destTeamSelect;
|
||
if (!rd.wantsNewServers) {
|
||
destTeamSelect = TeamSelect::WANT_COMPLETE_SRCS;
|
||
} else if (wantTrueBest) {
|
||
destTeamSelect = TeamSelect::WANT_TRUE_BEST;
|
||
} else {
|
||
destTeamSelect = TeamSelect::ANY;
|
||
}
|
||
PreferLowerReadUtil preferLowerReadTeam =
|
||
SERVER_KNOBS->DD_PREFER_LOW_READ_UTIL_TEAM || rd.reason == RelocateReason::REBALANCE_READ
|
||
? PreferLowerReadUtil::True
|
||
: PreferLowerReadUtil::False;
|
||
auto req = GetTeamRequest(destTeamSelect,
|
||
PreferLowerDiskUtil::True,
|
||
TeamMustHaveShards::False,
|
||
preferLowerReadTeam,
|
||
PreferWithinShardLimit::True,
|
||
ForReadBalance(rd.reason == RelocateReason::REBALANCE_READ),
|
||
inflightPenalty,
|
||
rd.keys);
|
||
|
||
req.src = rd.src;
|
||
req.completeSources = rd.completeSources;
|
||
req.storageQueueAware = SERVER_KNOBS->ENABLE_STORAGE_QUEUE_AWARE_TEAM_SELECTION;
|
||
req.findTeamForBulkLoad = doBulkLoading;
|
||
req.wantTrueBestIfMoveout = wantTrueBestIfMoveout;
|
||
|
||
if (enableShardMove && tciIndex == 1) {
|
||
ASSERT(physicalShardIDCandidate != UID().first() &&
|
||
physicalShardIDCandidate != anonymousShardId.first());
|
||
std::pair<Optional<ShardsAffectedByTeamFailure::Team>, bool> remoteTeamWithPhysicalShard =
|
||
self->physicalShardCollection->tryGetAvailableRemoteTeamWith(
|
||
physicalShardIDCandidate, metrics, debugID);
|
||
if (!remoteTeamWithPhysicalShard.second) {
|
||
// Physical shard with `physicalShardIDCandidate` is not available. Retry selecting
|
||
// new dst physical shard.
|
||
self->retryFindDstReasonCount[DDQueue::RetryFindDstReason::NoAvailablePhysicalShard]++;
|
||
foundTeams = false;
|
||
break;
|
||
}
|
||
if (remoteTeamWithPhysicalShard.first.present()) {
|
||
// Exists a remoteTeam in the mapping that has the physicalShardIDCandidate
|
||
// use the remoteTeam with the physicalShard as the bestTeam
|
||
req = GetTeamRequest(remoteTeamWithPhysicalShard.first.get().servers);
|
||
req.keys = rd.keys;
|
||
}
|
||
}
|
||
|
||
// bestTeam.second = false if the bestTeam in the teamCollection (in the DC) does not have
|
||
// any server that hosts the relocateData. This is possible, for example, in a fearless
|
||
// configuration when the remote DC is just brought up.
|
||
Future<std::pair<Optional<Reference<IDataDistributionTeam>>, bool>> fbestTeam =
|
||
brokenPromiseToNever(self->teamCollections[tciIndex].getTeam.getReply(req));
|
||
bestTeamReady = fbestTeam.isReady();
|
||
std::pair<Optional<Reference<IDataDistributionTeam>>, bool> bestTeam = wait(fbestTeam);
|
||
if (doBulkLoading) {
|
||
TraceEvent(bulkLoadVerboseEventSev(),
|
||
"DDBulkLoadTaskRelocatorBestTeamReceived",
|
||
self->distributorId)
|
||
.detail("DataMoveID", rd.dataMoveId)
|
||
.detail("JobID", rd.bulkLoadTask.get().coreState.getJobId().toString())
|
||
.detail("TaskID", rd.bulkLoadTask.get().coreState.getTaskId().toString())
|
||
.detail("BestTeamReady", bestTeamReady);
|
||
}
|
||
if (tciIndex > 0 && !bestTeamReady) {
|
||
// self->shardsAffectedByTeamFailure->moveShard must be called without any waits after
|
||
// getting the destination team or we could miss failure notifications for the storage
|
||
// servers in the destination team
|
||
TraceEvent("BestTeamNotReady");
|
||
self->retryFindDstReasonCount[DDQueue::RetryFindDstReason::RemoteBestTeamNotReady]++;
|
||
foundTeams = false;
|
||
break;
|
||
}
|
||
// If a DC has no healthy team, we stop checking the other DCs until
|
||
// the unhealthy DC is healthy again or is excluded.
|
||
if (!bestTeam.first.present()) {
|
||
self->retryFindDstReasonCount[tciIndex == 0
|
||
? DDQueue::RetryFindDstReason::PrimaryNoHealthyTeam
|
||
: DDQueue::RetryFindDstReason::RemoteNoHealthyTeam]++;
|
||
foundTeams = false;
|
||
break;
|
||
}
|
||
if (!bestTeam.first.get()->isHealthy()) {
|
||
allHealthy = false;
|
||
} else {
|
||
anyHealthy = true;
|
||
}
|
||
|
||
if (bestTeam.second) {
|
||
anyWithSource = true;
|
||
}
|
||
|
||
if (enableShardMove) {
|
||
if (tciIndex == 1 && !forceToUseNewPhysicalShard) {
|
||
// critical to the correctness of team selection by PhysicalShardCollection
|
||
// tryGetAvailableRemoteTeamWith() enforce to select a remote team paired with a
|
||
// primary team Thus, tryGetAvailableRemoteTeamWith() may select an almost full
|
||
// remote team In this case, we must re-select a remote team We set foundTeams =
|
||
// false to avoid finishing team selection Then, forceToUseNewPhysicalShard is set,
|
||
// which enforce to use getTeam to select a remote team
|
||
bool minAvailableSpaceRatio = bestTeam.first.get()->getMinAvailableSpaceRatio(true);
|
||
if (minAvailableSpaceRatio < SERVER_KNOBS->TARGET_AVAILABLE_SPACE_RATIO) {
|
||
self->retryFindDstReasonCount[DDQueue::RetryFindDstReason::RemoteTeamIsFull]++;
|
||
foundTeams = false;
|
||
break;
|
||
}
|
||
|
||
// critical to the correctness of team selection by PhysicalShardCollection
|
||
// tryGetAvailableRemoteTeamWith() enforce to select a remote team paired with a
|
||
// primary team Thus, tryGetAvailableRemoteTeamWith() may select an unhealthy remote
|
||
// team In this case, we must re-select a remote team We set foundTeams = false to
|
||
// avoid finishing team selection Then, forceToUseNewPhysicalShard is set, which
|
||
// enforce to use getTeam to select a remote team
|
||
if (!bestTeam.first.get()->isHealthy()) {
|
||
self->retryFindDstReasonCount
|
||
[DDQueue::RetryFindDstReason::RemoteTeamIsNotHealthy]++;
|
||
foundTeams = false;
|
||
break;
|
||
}
|
||
}
|
||
|
||
bestTeams.emplace_back(bestTeam.first.get(), true);
|
||
// Always set bestTeams[i].second = true to disable optimization in data move between
|
||
// DCs for the correctness of PhysicalShardCollection Currently, enabling the
|
||
// optimization will break the invariant of PhysicalShardCollection Invariant: once a
|
||
// physical shard is created with a specific set of SSes, this SS set will never get
|
||
// changed.
|
||
|
||
if (tciIndex == 0) {
|
||
ASSERT(foundTeams);
|
||
ShardsAffectedByTeamFailure::Team primaryTeam =
|
||
ShardsAffectedByTeamFailure::Team(bestTeams[0].first->getServerIDs(), true);
|
||
|
||
if (forceToUseNewPhysicalShard) {
|
||
physicalShardIDCandidate =
|
||
self->physicalShardCollection->generateNewPhysicalShardID(debugID);
|
||
} else {
|
||
Optional<uint64_t> candidate =
|
||
self->physicalShardCollection->trySelectAvailablePhysicalShardFor(
|
||
primaryTeam, metrics, excludedDstPhysicalShards, debugID);
|
||
if (candidate.present()) {
|
||
physicalShardIDCandidate = candidate.get();
|
||
} else {
|
||
self->retryFindDstReasonCount
|
||
[DDQueue::RetryFindDstReason::NoAvailablePhysicalShard]++;
|
||
if (wantTrueBest) {
|
||
// Next retry will likely get the same team, and we know that we can't
|
||
// reuse any existing physical shard in this team. So force to create
|
||
// new physical shard.
|
||
forceToUseNewPhysicalShard = true;
|
||
}
|
||
foundTeams = false;
|
||
break;
|
||
}
|
||
}
|
||
ASSERT(physicalShardIDCandidate != UID().first() &&
|
||
physicalShardIDCandidate != anonymousShardId.first());
|
||
}
|
||
} else {
|
||
bestTeams.emplace_back(bestTeam.first.get(), bestTeam.second);
|
||
if (doBulkLoading) {
|
||
TraceEvent(
|
||
bulkLoadVerboseEventSev(), "DDBulkLoadTaskSelectDestTeam", self->distributorId)
|
||
.detail("Context", "New")
|
||
.detail("SrcIds", describe(rd.src))
|
||
.detail("DestIds", bestTeam.first.get()->getServerIDs())
|
||
.detail("DestTeam", bestTeam.first.get()->getTeamID())
|
||
.detail("JobID", rd.bulkLoadTask.get().coreState.getJobId().toString())
|
||
.detail("TaskID", rd.bulkLoadTask.get().coreState.getTaskId().toString())
|
||
.detail("Priority", rd.priority)
|
||
.detail("DataMoveId", rd.dataMoveId)
|
||
.detail("Primary", tciIndex == 0);
|
||
}
|
||
}
|
||
}
|
||
tciIndex++;
|
||
}
|
||
|
||
// once we've found healthy candidate teams, make sure they're not overloaded with outstanding moves
|
||
// already
|
||
anyDestOverloaded = !canLaunchDest(bestTeams, rd.priority, self->destBusymap);
|
||
|
||
if (foundTeams && anyHealthy && !anyDestOverloaded) {
|
||
ASSERT(rd.completeDests.empty());
|
||
break;
|
||
}
|
||
|
||
if (foundTeams) {
|
||
if (!anyHealthy) {
|
||
self->retryFindDstReasonCount[DDQueue::RetryFindDstReason::NoAnyHealthy]++;
|
||
} else if (anyDestOverloaded) {
|
||
self->retryFindDstReasonCount[DDQueue::RetryFindDstReason::DstOverloaded]++;
|
||
}
|
||
}
|
||
|
||
if (anyDestOverloaded) {
|
||
CODE_PROBE(true, "Destination overloaded throttled move");
|
||
destOverloadedCount++;
|
||
TraceEvent(destOverloadedCount > 50 ? SevInfo : SevDebug, "DestSSBusy", distributorId)
|
||
.suppressFor(1.0)
|
||
.detail("TraceID", rd.randomId)
|
||
.detail("WantTrueBestIfMoveout", wantTrueBestIfMoveout)
|
||
.detail("IsRestore", rd.isRestore())
|
||
.detail("Priority", rd.priority)
|
||
.detail("StuckCount", stuckCount)
|
||
.detail("DestOverloadedCount", destOverloadedCount)
|
||
.detail("TeamCollectionId", tciIndex)
|
||
.detail("AnyDestOverloaded", anyDestOverloaded)
|
||
.detail("NumOfTeamCollections", self->teamCollections.size())
|
||
.detail("Servers", destServersString(bestTeams));
|
||
if (enableShardMove) {
|
||
if (rd.isRestore() && destOverloadedCount > 50) {
|
||
throw data_move_dest_team_not_found();
|
||
}
|
||
}
|
||
wait(delay(SERVER_KNOBS->DEST_OVERLOADED_DELAY, TaskPriority::DataDistributionLaunch));
|
||
} else {
|
||
CODE_PROBE(true, "did not find a healthy destination team on the first attempt");
|
||
stuckCount++;
|
||
TraceEvent(stuckCount > 50 ? SevWarnAlways : SevWarn, "BestTeamStuck", distributorId)
|
||
.suppressFor(1.0)
|
||
.detail("TraceID", rd.randomId)
|
||
.detail("WantTrueBestIfMoveout", wantTrueBestIfMoveout)
|
||
.detail("IsRestore", rd.isRestore())
|
||
.detail("Priority", rd.priority)
|
||
.detail("StuckCount", stuckCount)
|
||
.detail("DestOverloadedCount", destOverloadedCount)
|
||
.detail("TeamCollectionId", tciIndex)
|
||
.detail("AnyDestOverloaded", anyDestOverloaded)
|
||
.detail("NumOfTeamCollections", self->teamCollections.size())
|
||
.detail("ConductingBulkLoad", doBulkLoading);
|
||
if (doBulkLoading && stuckCount == 50) {
|
||
ASSERT(rd.bulkLoadTask.present());
|
||
TraceEvent(SevWarnAlways, "DDBulkLoadTaskStuck", self->distributorId)
|
||
.setMaxEventLength(-1)
|
||
.setMaxFieldLength(-1)
|
||
.detail("TraceID", rd.randomId)
|
||
.detail("BulkLoadTask", rd.bulkLoadTask.get().toString())
|
||
.detail("DataMoveID", rd.dataMoveId)
|
||
.detail("Reason", rd.reason.toString())
|
||
.detail("Priority", rd.priority)
|
||
.detail("DataMoveReason", static_cast<int>(rd.dmReason));
|
||
if (rd.bulkLoadTask.get().completeAck.canBeSet()) {
|
||
// Unretriable error. So, we give up the task at this time.
|
||
rd.bulkLoadTask.get().completeAck.send(
|
||
BulkLoadAck(/*unretrievableError=*/true, rd.priority));
|
||
throw data_move_dest_team_not_found();
|
||
// This relocator should silently exit. Note that if this bulkload data move is
|
||
// a team unhealthy data move, the bulkload engine will issue a new data move on
|
||
// the same range. See createShardToBulkLoad() for details.
|
||
}
|
||
}
|
||
if (rd.isRestore() && stuckCount > 50) {
|
||
throw data_move_dest_team_not_found();
|
||
}
|
||
wait(delay(SERVER_KNOBS->BEST_TEAM_STUCK_DELAY, TaskPriority::DataDistributionLaunch));
|
||
}
|
||
// When forceToUseNewPhysicalShard = false, we get paired primary team and remote team
|
||
// However, this may be failed
|
||
// Any retry triggers to use new physicalShard which enters the normal routine
|
||
if (enableShardMove) {
|
||
if (destOverloadedCount + stuckCount > 20) {
|
||
self->retryFindDstReasonCount[DDQueue::RetryFindDstReason::RetryLimitReached]++;
|
||
forceToUseNewPhysicalShard = true;
|
||
}
|
||
excludedDstPhysicalShards.insert(physicalShardIDCandidate);
|
||
}
|
||
|
||
// TODO different trace event + knob for overloaded? Could wait on an async var for done moves
|
||
}
|
||
|
||
if (enableShardMove) {
|
||
// TODO(BulkLoad): double check if bulk loading can do with physical shard collection feature
|
||
if (!rd.isRestore()) {
|
||
// when !rd.isRestore(), dataMoveId is just decided as physicalShardIDCandidate
|
||
// thus, update the physicalShardIDCandidate to related data structures
|
||
ASSERT(physicalShardIDCandidate != UID().first());
|
||
if (self->physicalShardCollection->physicalShardExists(physicalShardIDCandidate)) {
|
||
self->moveReusePhysicalShard++;
|
||
} else {
|
||
self->moveCreateNewPhysicalShard++;
|
||
}
|
||
rd.dataMoveId = newDataMoveId(
|
||
physicalShardIDCandidate, AssignEmptyRange::False, newDataMoveType(doBulkLoading), rd.dmReason);
|
||
TraceEvent(SevInfo, "NewDataMoveWithPhysicalShard")
|
||
.detail("DataMoveID", rd.dataMoveId.toString())
|
||
.detail("Reason", rd.reason.toString())
|
||
.detail("DataMoveReason", static_cast<int>(rd.dmReason));
|
||
auto inFlightRange = self->inFlight.rangeContaining(rd.keys.begin);
|
||
inFlightRange.value().dataMoveId = rd.dataMoveId;
|
||
auto f = self->dataMoves.intersectingRanges(rd.keys);
|
||
for (auto it = f.begin(); it != f.end(); ++it) {
|
||
KeyRangeRef kr(it->range().begin, it->range().end);
|
||
const UID mId = it->value().id;
|
||
if (mId.isValid() && mId != rd.dataMoveId) {
|
||
TraceEvent("DDRelocatorConflictingDataMoveAfterGetTeam", distributorId)
|
||
.detail("CurrentDataMoveID", rd.dataMoveId)
|
||
.detail("DataMoveID", mId)
|
||
.detail("Range", kr);
|
||
}
|
||
}
|
||
self->dataMoves.insert(rd.keys, DDQueue::DDDataMove(rd.dataMoveId));
|
||
}
|
||
ASSERT(rd.dataMoveId.first() != UID().first());
|
||
auto dataMoveRange = self->dataMoves.rangeContaining(rd.keys.begin);
|
||
ASSERT(dataMoveRange.value().id == rd.dataMoveId);
|
||
}
|
||
|
||
// set cancellable to false on inFlight's entry for this key range
|
||
auto inFlightRange = self->inFlight.rangeContaining(rd.keys.begin);
|
||
ASSERT(inFlightRange.range() == rd.keys);
|
||
ASSERT(inFlightRange.value().randomId == rd.randomId);
|
||
inFlightRange.value().cancellable = false;
|
||
|
||
destIds.clear();
|
||
state std::vector<UID> healthyIds;
|
||
state std::vector<UID> extraIds;
|
||
state std::vector<ShardsAffectedByTeamFailure::Team> destinationTeams;
|
||
|
||
for (int i = 0; i < bestTeams.size(); i++) {
|
||
auto& serverIds = bestTeams[i].first->getServerIDs();
|
||
destinationTeams.push_back(ShardsAffectedByTeamFailure::Team(serverIds, i == 0));
|
||
|
||
// TODO(psm): Make DataMoveMetaData aware of the two-step data move optimization.
|
||
if (allHealthy && anyWithSource && !bestTeams[i].second && !doBulkLoading) {
|
||
// When all servers in bestTeams[i] do not hold the shard (!bestTeams[i].second), it indicates
|
||
// the bestTeams[i] is in a new DC where data has not been replicated to.
|
||
// To move data (specified in RelocateShard) to bestTeams[i] in the new DC AND reduce data movement
|
||
// across DC, we randomly choose a server in bestTeams[i] as the shard's destination, and
|
||
// move the shard to the randomly chosen server (in the remote DC), which will later
|
||
// propagate its data to the servers in the same team. This saves data movement bandwidth across DC
|
||
// Bulk loading data move avoids this optimization since it does not move any data from source
|
||
// servers
|
||
int idx = deterministicRandom()->randomInt(0, serverIds.size());
|
||
destIds.push_back(serverIds[idx]);
|
||
healthyIds.push_back(serverIds[idx]);
|
||
for (int j = 0; j < serverIds.size(); j++) {
|
||
if (j != idx) {
|
||
extraIds.push_back(serverIds[j]);
|
||
}
|
||
}
|
||
healthyDestinations.addTeam(bestTeams[i].first);
|
||
} else {
|
||
destIds.insert(destIds.end(), serverIds.begin(), serverIds.end());
|
||
if (bestTeams[i].first->isHealthy()) {
|
||
healthyIds.insert(healthyIds.end(), serverIds.begin(), serverIds.end());
|
||
healthyDestinations.addTeam(bestTeams[i].first);
|
||
}
|
||
}
|
||
}
|
||
|
||
// Sanity check for bulk loading data move
|
||
if (doBulkLoading) {
|
||
validateBulkLoadRelocateData(rd, destIds, self->distributorId);
|
||
}
|
||
TraceEvent(SevInfo, "DDRelocatorGotDestTeam", self->distributorId)
|
||
.detail("KeyBegin", rd.keys.begin)
|
||
.detail("KeyEnd", rd.keys.end)
|
||
.detail("Priority", rd.priority)
|
||
.detail("DataMoveId", rd.dataMoveId)
|
||
.detail("SrcIds", describe(rd.src))
|
||
.detail("DestId", describe(destIds))
|
||
.detail("BulkLoadTask", doBulkLoading ? rd.bulkLoadTask.get().toString() : "");
|
||
|
||
// Sanity check
|
||
state int totalIds = 0;
|
||
for (auto& destTeam : destinationTeams) {
|
||
totalIds += destTeam.servers.size();
|
||
}
|
||
if (totalIds < self->teamSize) {
|
||
TraceEvent(SevWarn, "IncorrectDestTeamSize")
|
||
.suppressFor(1.0)
|
||
.detail("ExpectedTeamSize", self->teamSize)
|
||
.detail("DestTeamSize", totalIds);
|
||
}
|
||
|
||
if (!rd.isRestore()) {
|
||
self->shardsAffectedByTeamFailure->moveShard(rd.keys, destinationTeams);
|
||
}
|
||
|
||
// FIXME: do not add data in flight to servers that were already in the src.
|
||
healthyDestinations.addDataInFlightToTeam(+metrics.bytes);
|
||
healthyDestinations.addReadInFlightToTeam(+metrics.readLoadKSecond());
|
||
|
||
launchDest(rd, bestTeams, self->destBusymap);
|
||
|
||
TraceEvent ev(relocateShardInterval.severity, "RelocateShardHasDestination", distributorId);
|
||
RelocateDecision decision{ rd, destIds, extraIds, metrics, parentMetrics };
|
||
traceRelocateDecision(ev, relocateShardInterval.pairID, decision);
|
||
|
||
self->serverCounter.increaseForTeam(rd.src, rd.reason, DDQueue::ServerCounter::LaunchedSource);
|
||
self->serverCounter.increaseForTeam(destIds, rd.reason, DDQueue::ServerCounter::LaunchedDest);
|
||
self->serverCounter.increaseForTeam(extraIds, rd.reason, DDQueue::ServerCounter::LaunchedDest);
|
||
|
||
state Error error = success();
|
||
state Promise<Void> dataMovementComplete;
|
||
// Move keys from source to destination by changing the serverKeyList and keyServerList system keys
|
||
std::unique_ptr<MoveKeysParams> params;
|
||
if (SERVER_KNOBS->SHARD_ENCODE_LOCATION_METADATA) {
|
||
params = std::make_unique<MoveKeysParams>(rd.dataMoveId,
|
||
std::vector<KeyRange>{ rd.keys },
|
||
destIds,
|
||
healthyIds,
|
||
self->lock,
|
||
dataMovementComplete,
|
||
&self->startMoveKeysParallelismLock,
|
||
&self->finishMoveKeysParallelismLock,
|
||
self->teamCollections.size() > 1,
|
||
relocateShardInterval.pairID,
|
||
ddEnabledState,
|
||
CancelConflictingDataMoves::False,
|
||
doBulkLoading ? rd.bulkLoadTask.get().coreState
|
||
: Optional<BulkLoadTaskState>());
|
||
} else {
|
||
params = std::make_unique<MoveKeysParams>(rd.dataMoveId,
|
||
rd.keys,
|
||
destIds,
|
||
healthyIds,
|
||
self->lock,
|
||
dataMovementComplete,
|
||
&self->startMoveKeysParallelismLock,
|
||
&self->finishMoveKeysParallelismLock,
|
||
self->teamCollections.size() > 1,
|
||
relocateShardInterval.pairID,
|
||
ddEnabledState,
|
||
CancelConflictingDataMoves::False,
|
||
doBulkLoading ? rd.bulkLoadTask.get().coreState
|
||
: Optional<BulkLoadTaskState>());
|
||
}
|
||
state Future<Void> doMoveKeys = self->txnProcessor->moveKeys(*params);
|
||
state Future<Void> pollHealth =
|
||
signalledTransferComplete ? Never()
|
||
: delay(SERVER_KNOBS->HEALTH_POLL_TIME, TaskPriority::DataDistributionLaunch);
|
||
try {
|
||
loop {
|
||
choose {
|
||
when(wait(doMoveKeys)) {
|
||
if (extraIds.size()) {
|
||
destIds.insert(destIds.end(), extraIds.begin(), extraIds.end());
|
||
healthyIds.insert(healthyIds.end(), extraIds.begin(), extraIds.end());
|
||
extraIds.clear();
|
||
ASSERT(totalIds == destIds.size()); // Sanity check the destIDs before we move keys
|
||
std::unique_ptr<MoveKeysParams> params;
|
||
if (SERVER_KNOBS->SHARD_ENCODE_LOCATION_METADATA) {
|
||
params = std::make_unique<MoveKeysParams>(rd.dataMoveId,
|
||
std::vector<KeyRange>{ rd.keys },
|
||
destIds,
|
||
healthyIds,
|
||
self->lock,
|
||
Promise<Void>(),
|
||
&self->startMoveKeysParallelismLock,
|
||
&self->finishMoveKeysParallelismLock,
|
||
self->teamCollections.size() > 1,
|
||
relocateShardInterval.pairID,
|
||
ddEnabledState,
|
||
CancelConflictingDataMoves::False,
|
||
rd.bulkLoadTask.present()
|
||
? rd.bulkLoadTask.get().coreState
|
||
: Optional<BulkLoadTaskState>());
|
||
} else {
|
||
params = std::make_unique<MoveKeysParams>(rd.dataMoveId,
|
||
rd.keys,
|
||
destIds,
|
||
healthyIds,
|
||
self->lock,
|
||
Promise<Void>(),
|
||
&self->startMoveKeysParallelismLock,
|
||
&self->finishMoveKeysParallelismLock,
|
||
self->teamCollections.size() > 1,
|
||
relocateShardInterval.pairID,
|
||
ddEnabledState,
|
||
CancelConflictingDataMoves::False,
|
||
rd.bulkLoadTask.present()
|
||
? rd.bulkLoadTask.get().coreState
|
||
: Optional<BulkLoadTaskState>());
|
||
}
|
||
doMoveKeys = self->txnProcessor->moveKeys(*params);
|
||
} else {
|
||
self->fetchKeysComplete.insert(rd);
|
||
if (SERVER_KNOBS->SHARD_ENCODE_LOCATION_METADATA) {
|
||
auto ranges = self->dataMoves.getAffectedRangesAfterInsertion(rd.keys);
|
||
if (ranges.size() == 1 && static_cast<KeyRange>(ranges[0]) == rd.keys &&
|
||
ranges[0].value.id == rd.dataMoveId && !ranges[0].value.cancel.isValid()) {
|
||
self->dataMoves.insert(rd.keys, DDQueue::DDDataMove());
|
||
TraceEvent(SevVerbose, "DequeueDataMoveOnSuccess", self->distributorId)
|
||
.detail("DataMoveID", rd.dataMoveId)
|
||
.detail("DataMoveRange", rd.keys);
|
||
}
|
||
}
|
||
break;
|
||
}
|
||
}
|
||
when(wait(pollHealth)) {
|
||
if (!healthyDestinations.isHealthy()) {
|
||
if (!signalledTransferComplete) {
|
||
signalledTransferComplete = true;
|
||
self->dataTransferComplete.send(rd);
|
||
}
|
||
}
|
||
pollHealth = signalledTransferComplete ? Never()
|
||
: delay(SERVER_KNOBS->HEALTH_POLL_TIME,
|
||
TaskPriority::DataDistributionLaunch);
|
||
}
|
||
when(wait(signalledTransferComplete ? Never() : dataMovementComplete.getFuture())) {
|
||
self->fetchKeysComplete.insert(rd);
|
||
if (!signalledTransferComplete) {
|
||
signalledTransferComplete = true;
|
||
self->dataTransferComplete.send(rd);
|
||
}
|
||
}
|
||
}
|
||
}
|
||
} catch (Error& e) {
|
||
error = e;
|
||
}
|
||
|
||
//TraceEvent("RelocateShardFinished", distributorId).detail("RelocateId", relocateShardInterval.pairID);
|
||
|
||
if (error.code() != error_code_move_to_removed_server) {
|
||
if (!error.code()) {
|
||
try {
|
||
wait(healthyDestinations
|
||
.updateStorageMetrics()); // prevent a gap between the polling for an increase in
|
||
// storage metrics and decrementing data in flight
|
||
} catch (Error& e) {
|
||
error = e;
|
||
}
|
||
}
|
||
|
||
healthyDestinations.addDataInFlightToTeam(-metrics.bytes);
|
||
auto readLoad = metrics.readLoadKSecond();
|
||
// Note: It’s equal to trigger([healthyDestinations, readLoad], which is a value capture of
|
||
// healthyDestinations. Have to create a reference to healthyDestinations because in ACTOR the state
|
||
// variable is actually a member variable, I can’t write trigger([healthyDestinations, readLoad]
|
||
// directly.
|
||
auto& destinationRef = healthyDestinations;
|
||
self->noErrorActors.add(
|
||
trigger([destinationRef, readLoad]() mutable { destinationRef.addReadInFlightToTeam(-readLoad); },
|
||
delay(SERVER_KNOBS->STORAGE_METRICS_AVERAGE_INTERVAL)));
|
||
|
||
// onFinished.send( rs );
|
||
if (!error.code()) {
|
||
TraceEvent(relocateShardInterval.end(), distributorId)
|
||
.detail("Duration", now() - startTime)
|
||
.detail("Result", "Success");
|
||
TraceEvent("DataMoveStats", distributorId)
|
||
.detail("Duration", now() - startTime)
|
||
.detail("Bytes", metrics.bytes)
|
||
.detail("Rate", static_cast<double>(metrics.bytes) / (now() - startTime))
|
||
.detail("Reason", rd.reason.toString())
|
||
.detail("DataMoveReason", static_cast<int>(rd.dmReason))
|
||
.detail("DataMoveID", rd.dataMoveId)
|
||
.detail("DataMoveType", getDataMoveTypeFromDataMoveId(rd.dataMoveId));
|
||
if (now() - startTime > 600) {
|
||
TraceEvent(SevWarnAlways, "RelocateShardTooLong")
|
||
.detail("Duration", now() - startTime)
|
||
.detail("Dest", describe(destIds))
|
||
.detail("Src", describe(rd.src));
|
||
}
|
||
if (rd.keys.begin == keyServersPrefix) {
|
||
TraceEvent("MovedKeyServerKeys")
|
||
.detail("Dest", describe(destIds))
|
||
.trackLatest(self->movedKeyServersEventHolder->trackingKey);
|
||
}
|
||
|
||
if (!signalledTransferComplete) {
|
||
signalledTransferComplete = true;
|
||
dataTransferComplete.send(rd);
|
||
}
|
||
|
||
// In the case of merge, rd.completeSources would be the intersection set of two source server
|
||
// lists, while rd.src would be the union set.
|
||
// FIXME. It is a bit over-estimated here with rd.completeSources.
|
||
const int nonOverlappingCount = nonOverlappedServerCount(rd.completeSources, destIds);
|
||
self->bytesWritten += metrics.bytes;
|
||
self->moveBytesRate.addSample(metrics.bytes * nonOverlappingCount);
|
||
self->shardsAffectedByTeamFailure->finishMove(rd.keys);
|
||
relocationComplete.send(rd);
|
||
|
||
if (enableShardMove) {
|
||
// update physical shard collection
|
||
std::vector<ShardsAffectedByTeamFailure::Team> selectedTeams;
|
||
for (int i = 0; i < bestTeams.size(); i++) {
|
||
auto serverIds = bestTeams[i].first->getServerIDs();
|
||
selectedTeams.push_back(ShardsAffectedByTeamFailure::Team(serverIds, i == 0));
|
||
}
|
||
// The update of PhysicalShardToTeams, PhysicalShardInstances, keyRangePhysicalShardIDMap
|
||
// should be atomic
|
||
self->physicalShardCollection->updatePhysicalShardCollection(
|
||
rd.keys, rd.isRestore(), selectedTeams, rd.dataMoveId.first(), metrics, debugID);
|
||
}
|
||
|
||
if (doBulkLoading) {
|
||
try {
|
||
self->bulkLoadTaskCollection->terminateTask(rd.bulkLoadTask.get().coreState);
|
||
TraceEvent(
|
||
bulkLoadVerboseEventSev(), "DDBulkLoadTaskRelocatorComplete", self->distributorId)
|
||
.detail("Dests", describe(destIds))
|
||
.detail("JobID", rd.bulkLoadTask.get().coreState.getJobId().toString())
|
||
.detail("TaskID", rd.bulkLoadTask.get().coreState.getTaskId().toString());
|
||
} catch (Error& bulkLoadError) {
|
||
ASSERT_WE_THINK(bulkLoadError.code() == error_code_bulkload_task_outdated);
|
||
if (bulkLoadError.code() != error_code_bulkload_task_outdated) {
|
||
throw bulkLoadError;
|
||
}
|
||
TraceEvent(bulkLoadVerboseEventSev(),
|
||
"DDBulkLoadTaskRelocatorCompleteButOutdated",
|
||
self->distributorId)
|
||
.detail("Dests", describe(destIds))
|
||
.detail("JobID", rd.bulkLoadTask.get().coreState.getJobId().toString())
|
||
.detail("TaskID", rd.bulkLoadTask.get().coreState.getTaskId().toString());
|
||
}
|
||
}
|
||
return Void();
|
||
} else {
|
||
if (doBulkLoading) {
|
||
TraceEvent(bulkLoadVerboseEventSev(), "DDBulkLoadTaskRelocatorError")
|
||
.errorUnsuppressed(error)
|
||
.detail("JobID", rd.bulkLoadTask.get().coreState.getJobId().toString())
|
||
.detail("TaskID", rd.bulkLoadTask.get().coreState.getTaskId().toString());
|
||
}
|
||
throw error;
|
||
}
|
||
} else {
|
||
CODE_PROBE(true, "move to removed server", probe::decoration::rare);
|
||
healthyDestinations.addDataInFlightToTeam(-metrics.bytes);
|
||
auto readLoad = metrics.readLoadKSecond();
|
||
auto& destinationRef = healthyDestinations;
|
||
self->noErrorActors.add(
|
||
trigger([destinationRef, readLoad]() mutable { destinationRef.addReadInFlightToTeam(-readLoad); },
|
||
delay(SERVER_KNOBS->STORAGE_METRICS_AVERAGE_INTERVAL)));
|
||
|
||
if (!signalledTransferComplete) {
|
||
// signalling transferComplete calls completeDest() in complete(), so doing so here would
|
||
// double-complete the work
|
||
completeDest(rd, self->destBusymap);
|
||
}
|
||
rd.completeDests.clear();
|
||
|
||
wait(delay(SERVER_KNOBS->RETRY_RELOCATESHARD_DELAY, TaskPriority::DataDistributionLaunch));
|
||
}
|
||
}
|
||
} catch (Error& e) {
|
||
state Error err = e;
|
||
TraceEvent(relocateShardInterval.end(), distributorId)
|
||
.errorUnsuppressed(err)
|
||
.detail("Duration", now() - startTime);
|
||
if (now() - startTime > 600) {
|
||
TraceEvent(SevWarnAlways, "RelocateShardTooLong")
|
||
.errorUnsuppressed(err)
|
||
.detail("Duration", now() - startTime)
|
||
.detail("Dest", describe(destIds))
|
||
.detail("Src", describe(rd.src));
|
||
}
|
||
if (!signalledTransferComplete)
|
||
dataTransferComplete.send(rd);
|
||
|
||
relocationComplete.send(rd);
|
||
|
||
if (doBulkLoading && e.code() != error_code_actor_cancelled && e.code() != error_code_movekeys_conflict) {
|
||
TraceEvent(SevWarnAlways, "DDBulkLoadTaskRelocatorFailed", self->distributorId)
|
||
.setMaxEventLength(-1)
|
||
.setMaxFieldLength(-1)
|
||
.errorUnsuppressed(e)
|
||
.detail("BulkLoadTask", rd.bulkLoadTask.get().toString());
|
||
}
|
||
|
||
if (err.code() == error_code_data_move_dest_team_not_found) {
|
||
wait(cancelDataMove(self, rd.keys, ddEnabledState));
|
||
TraceEvent(SevWarnAlways, "RelocateShardCancelDataMoveTeamNotFound")
|
||
.detail("Src", describe(rd.src))
|
||
.detail("DataMoveMetaData", rd.dataMove != nullptr ? rd.dataMove->meta.toString() : "Empty");
|
||
} else if (err.code() != error_code_actor_cancelled && err.code() != error_code_data_move_cancelled) {
|
||
if (errorOut.canBeSet()) {
|
||
errorOut.sendError(err);
|
||
}
|
||
}
|
||
throw err;
|
||
}
|
||
}
|
||
|
||
inline double getWorstCpu(const HealthMetrics& metrics, const std::vector<UID>& ids) {
|
||
double cpu = 0;
|
||
for (auto& id : ids) {
|
||
if (metrics.storageStats.contains(id)) {
|
||
cpu = std::max(cpu, metrics.storageStats.at(id).cpuUsage);
|
||
} else {
|
||
// assume the server is too busy to report its stats
|
||
cpu = std::max(cpu, 100.0);
|
||
break;
|
||
}
|
||
}
|
||
return cpu;
|
||
}
|
||
|
||
// Move the shard with the top K highest read density of sourceTeam's to destTeam if sourceTeam has much more read
|
||
// load than destTeam
|
||
ACTOR Future<bool> rebalanceReadLoad(DDQueue* self,
|
||
DataMovementReason moveReason,
|
||
Reference<IDataDistributionTeam> sourceTeam,
|
||
Reference<IDataDistributionTeam> destTeam,
|
||
bool primary,
|
||
TraceEvent* traceEvent) {
|
||
if (g_network->isSimulated() && g_simulator->speedUpSimulation) {
|
||
traceEvent->detail("CancelingDueToSimulationSpeedup", true);
|
||
return false;
|
||
}
|
||
|
||
state std::vector<KeyRange> shards = self->shardsAffectedByTeamFailure->getShardsFor(
|
||
ShardsAffectedByTeamFailure::Team(sourceTeam->getServerIDs(), primary));
|
||
traceEvent->detail("ShardsInSource", shards.size());
|
||
// For read rebalance if there is just 1 hot shard remained, move this shard to another server won't solve the
|
||
// problem.
|
||
// TODO: This situation should be solved by split and merge
|
||
if (shards.size() <= 1) {
|
||
traceEvent->detail("SkipReason", "NoShardOnSource");
|
||
return false;
|
||
}
|
||
|
||
// Check lastAsSource, at most SERVER_KNOBS->READ_REBALANCE_SRC_PARALLELISM shards can be moved within a sample
|
||
// period. It takes time for the sampled metrics being updated after a shard is moved, so we should control the
|
||
// cadence of movement here to avoid moving churn caused by making many decision based on out-of-date sampled
|
||
// metrics.
|
||
if (self->timeThrottle(sourceTeam->getServerIDs())) {
|
||
traceEvent->detail("SkipReason", "SourceTeamThrottle");
|
||
return false;
|
||
}
|
||
// check team difference
|
||
auto srcLoad = sourceTeam->getReadLoad(false), destLoad = destTeam->getReadLoad();
|
||
traceEvent->detail("SrcReadBandwidth", srcLoad).detail("DestReadBandwidth", destLoad);
|
||
|
||
// read bandwidth difference is less than 30% of src load
|
||
if ((1.0 - SERVER_KNOBS->READ_REBALANCE_DIFF_FRAC) * srcLoad <= destLoad) {
|
||
traceEvent->detail("SkipReason", "TeamTooSimilar");
|
||
return false;
|
||
}
|
||
// randomly choose topK shards
|
||
int topK = std::max(1, std::min(int(0.1 * shards.size()), SERVER_KNOBS->READ_REBALANCE_SHARD_TOPK));
|
||
state Future<HealthMetrics> healthMetrics = self->txnProcessor->getHealthMetrics(true);
|
||
state GetTopKMetricsRequest req(shards,
|
||
topK,
|
||
(srcLoad - destLoad) * SERVER_KNOBS->READ_REBALANCE_MAX_SHARD_FRAC,
|
||
std::min(srcLoad / shards.size(), SERVER_KNOBS->READ_REBALANCE_MIN_READ_BYTES_KS));
|
||
state GetTopKMetricsReply reply = wait(brokenPromiseToNever(self->getTopKMetrics.getReply(req)));
|
||
wait(ready(healthMetrics));
|
||
auto cpu = getWorstCpu(healthMetrics.get(), sourceTeam->getServerIDs());
|
||
if (cpu < SERVER_KNOBS->READ_REBALANCE_CPU_THRESHOLD) { // 15.0 +- (0.3 * 15) < 20.0
|
||
traceEvent->detail("SkipReason", "LowReadLoad").detail("WorstSrcCpu", cpu);
|
||
return false;
|
||
}
|
||
|
||
auto& metricsList = reply.shardMetrics;
|
||
// NOTE: randomize is important here since we don't want to always push the same shard into the queue
|
||
deterministicRandom()->randomShuffle(metricsList);
|
||
traceEvent->detail("MinReadLoad", reply.minReadLoad).detail("MaxReadLoad", reply.maxReadLoad);
|
||
|
||
if (metricsList.empty()) {
|
||
traceEvent->detail("SkipReason", "NoEligibleShards");
|
||
return false;
|
||
}
|
||
|
||
auto& [shard, metrics] = metricsList[0];
|
||
traceEvent->detail("ShardReadBandwidth", metrics.bytesReadPerKSecond)
|
||
.detail("ShardReadOps", metrics.opsReadPerKSecond);
|
||
|
||
// Verify the shard is still in ShardsAffectedByTeamFailure
|
||
shards = self->shardsAffectedByTeamFailure->getShardsFor(
|
||
ShardsAffectedByTeamFailure::Team(sourceTeam->getServerIDs(), primary));
|
||
for (int i = 0; i < shards.size(); i++) {
|
||
if (shard == shards[i]) {
|
||
UID traceId = deterministicRandom()->randomUniqueID();
|
||
self->output.send(RelocateShard(shard, moveReason, RelocateReason::REBALANCE_READ, traceId));
|
||
traceEvent->detail("TraceId", traceId);
|
||
|
||
auto serverIds = sourceTeam->getServerIDs();
|
||
self->updateLastAsSource(serverIds);
|
||
|
||
self->serverCounter.increaseForTeam(
|
||
serverIds, RelocateReason::REBALANCE_READ, DDQueue::ServerCounter::ProposedSource);
|
||
return true;
|
||
}
|
||
}
|
||
traceEvent->detail("SkipReason", "ShardNotPresent");
|
||
return false;
|
||
}
|
||
|
||
// Move a random shard from sourceTeam if sourceTeam has much more data than provided destTeam
|
||
ACTOR static Future<bool> rebalanceTeams(DDQueue* self,
|
||
DataMovementReason moveReason,
|
||
Reference<IDataDistributionTeam const> sourceTeam,
|
||
Reference<IDataDistributionTeam const> destTeam,
|
||
bool primary,
|
||
TraceEvent* traceEvent) {
|
||
if (g_network->isSimulated() && g_simulator->speedUpSimulation) {
|
||
traceEvent->detail("CancelingDueToSimulationSpeedup", true);
|
||
return false;
|
||
}
|
||
|
||
Promise<int64_t> req;
|
||
self->getAverageShardBytes.send(req);
|
||
|
||
state int64_t averageShardBytes = wait(req.getFuture());
|
||
state std::vector<KeyRange> shards = self->shardsAffectedByTeamFailure->getShardsFor(
|
||
ShardsAffectedByTeamFailure::Team(sourceTeam->getServerIDs(), primary));
|
||
|
||
traceEvent->detail("AverageShardBytes", averageShardBytes).detail("ShardsInSource", shards.size());
|
||
|
||
if (!shards.size()) {
|
||
traceEvent->detail("SkipReason", "NoShardOnSource");
|
||
return false;
|
||
}
|
||
|
||
state KeyRange moveShard;
|
||
state StorageMetrics metrics;
|
||
state int retries = 0;
|
||
while (retries < SERVER_KNOBS->REBALANCE_MAX_RETRIES) {
|
||
state KeyRange testShard = deterministicRandom()->randomChoice(shards);
|
||
StorageMetrics testMetrics =
|
||
wait(brokenPromiseToNever(self->getShardMetrics.getReply(GetMetricsRequest(testShard))));
|
||
if (testMetrics.bytes > metrics.bytes) {
|
||
moveShard = testShard;
|
||
metrics = testMetrics;
|
||
if (metrics.bytes > averageShardBytes) {
|
||
break;
|
||
}
|
||
}
|
||
retries++;
|
||
}
|
||
|
||
int64_t sourceBytes = sourceTeam->getLoadBytes(false);
|
||
int64_t destBytes = destTeam->getLoadBytes();
|
||
|
||
bool sourceAndDestTooSimilar =
|
||
sourceBytes - destBytes <= 3 * std::max<int64_t>(SERVER_KNOBS->MIN_SHARD_BYTES, metrics.bytes);
|
||
traceEvent->detail("SourceBytes", sourceBytes)
|
||
.detail("DestBytes", destBytes)
|
||
.detail("ShardBytes", metrics.bytes)
|
||
.detail("SourceAndDestTooSimilar", sourceAndDestTooSimilar);
|
||
|
||
if (sourceAndDestTooSimilar || metrics.bytes == 0) {
|
||
traceEvent->detail("SkipReason", sourceAndDestTooSimilar ? "TeamTooSimilar" : "ShardZeroSize");
|
||
return false;
|
||
}
|
||
|
||
// Verify the shard is still in ShardsAffectedByTeamFailure
|
||
shards = self->shardsAffectedByTeamFailure->getShardsFor(
|
||
ShardsAffectedByTeamFailure::Team(sourceTeam->getServerIDs(), primary));
|
||
for (int i = 0; i < shards.size(); i++) {
|
||
if (moveShard == shards[i]) {
|
||
UID traceId = deterministicRandom()->randomUniqueID();
|
||
self->output.send(RelocateShard(moveShard, moveReason, RelocateReason::REBALANCE_DISK, traceId));
|
||
traceEvent->detail("TraceId", traceId);
|
||
|
||
self->serverCounter.increaseForTeam(
|
||
sourceTeam->getServerIDs(), RelocateReason::REBALANCE_DISK, DDQueue::ServerCounter::ProposedSource);
|
||
return true;
|
||
}
|
||
}
|
||
|
||
traceEvent->detail("SkipReason", "ShardNotPresent");
|
||
return false;
|
||
}
|
||
|
||
ACTOR Future<SrcDestTeamPair> getSrcDestTeams(DDQueue* self,
|
||
int teamCollectionIndex,
|
||
GetTeamRequest srcReq,
|
||
GetTeamRequest destReq,
|
||
int priority,
|
||
TraceEvent* traceEvent) {
|
||
|
||
state std::pair<Optional<ITeamRef>, bool> randomTeam =
|
||
wait(brokenPromiseToNever(self->teamCollections[teamCollectionIndex].getTeam.getReply(destReq)));
|
||
traceEvent->detail("DestTeam", printable(randomTeam.first.mapRef(&IDataDistributionTeam::getDesc)));
|
||
|
||
if (randomTeam.first.present()) {
|
||
state std::pair<Optional<ITeamRef>, bool> loadedTeam =
|
||
wait(brokenPromiseToNever(self->teamCollections[teamCollectionIndex].getTeam.getReply(srcReq)));
|
||
|
||
traceEvent->detail("SourceTeam", printable(loadedTeam.first.mapRef(&IDataDistributionTeam::getDesc)));
|
||
|
||
if (loadedTeam.first.present()) {
|
||
return std::make_pair(loadedTeam.first.get(), randomTeam.first.get());
|
||
}
|
||
}
|
||
return {};
|
||
}
|
||
|
||
Future<SrcDestTeamPair> DDQueue::getSrcDestTeams(const int& teamCollectionIndex,
|
||
const GetTeamRequest& srcReq,
|
||
const GetTeamRequest& destReq,
|
||
const int& priority,
|
||
TraceEvent* traceEvent) {
|
||
return ::getSrcDestTeams(this, teamCollectionIndex, srcReq, destReq, priority, traceEvent);
|
||
}
|
||
Future<bool> DDQueue::rebalanceReadLoad(DataMovementReason moveReason,
|
||
Reference<IDataDistributionTeam> sourceTeam,
|
||
Reference<IDataDistributionTeam> destTeam,
|
||
bool primary,
|
||
TraceEvent* traceEvent) {
|
||
return ::rebalanceReadLoad(this, moveReason, sourceTeam, destTeam, primary, traceEvent);
|
||
}
|
||
|
||
Future<bool> DDQueue::rebalanceTeams(DataMovementReason moveReason,
|
||
Reference<const IDataDistributionTeam> sourceTeam,
|
||
Reference<const IDataDistributionTeam> destTeam,
|
||
bool primary,
|
||
TraceEvent* traceEvent) {
|
||
return ::rebalanceTeams(this, moveReason, sourceTeam, destTeam, primary, traceEvent);
|
||
}
|
||
|
||
ACTOR Future<bool> getSkipRebalanceValue(Reference<IDDTxnProcessor> txnProcessor, bool readRebalance) {
|
||
Optional<Value> val = wait(txnProcessor->readRebalanceDDIgnoreKey());
|
||
|
||
if (!val.present())
|
||
return false;
|
||
|
||
bool skipCurrentLoop = false;
|
||
// NOTE: check special value "" and "on" might written in old version < 7.2
|
||
if (val.get().size() > 0 && val.get() != "on"_sr) {
|
||
int ddIgnore = BinaryReader::fromStringRef<uint8_t>(val.get(), Unversioned());
|
||
if (readRebalance) {
|
||
skipCurrentLoop = (ddIgnore & DDIgnore::REBALANCE_READ) > 0;
|
||
} else {
|
||
skipCurrentLoop = (ddIgnore & DDIgnore::REBALANCE_DISK) > 0;
|
||
}
|
||
} else {
|
||
skipCurrentLoop = true;
|
||
}
|
||
|
||
return skipCurrentLoop;
|
||
}
|
||
|
||
ACTOR Future<Void> BgDDLoadRebalance(DDQueue* self, int teamCollectionIndex, DataMovementReason reason) {
|
||
state int resetCount = 0;
|
||
state double lastRead = 0;
|
||
state bool skipCurrentLoop = false;
|
||
state const bool readRebalance = isDataMovementForReadBalancing(reason);
|
||
state const std::string moveType =
|
||
isDataMovementForMountainChopper(reason) ? "BgDDMountainChopper" : "BgDDValleyFiller";
|
||
state int ddPriority = dataMovementPriority(reason);
|
||
state bool mcMove = isDataMovementForMountainChopper(reason);
|
||
state PreferLowerReadUtil preferLowerReadTeam = readRebalance || SERVER_KNOBS->DD_PREFER_LOW_READ_UTIL_TEAM
|
||
? PreferLowerReadUtil::True
|
||
: PreferLowerReadUtil::False;
|
||
state double rebalancePollingInterval = 0;
|
||
|
||
loop {
|
||
state bool moved = false;
|
||
state Reference<IDataDistributionTeam> sourceTeam;
|
||
state Reference<IDataDistributionTeam> destTeam;
|
||
|
||
// NOTE: the DD throttling relies on DDQueue, so here just trigger the balancer periodically
|
||
wait(delay(rebalancePollingInterval, TaskPriority::DataDistributionLaunch));
|
||
try {
|
||
if ((now() - lastRead) > SERVER_KNOBS->BG_REBALANCE_SWITCH_CHECK_INTERVAL) {
|
||
wait(store(skipCurrentLoop, getSkipRebalanceValue(self->txnProcessor, readRebalance)));
|
||
lastRead = now();
|
||
}
|
||
|
||
if (skipCurrentLoop) {
|
||
rebalancePollingInterval =
|
||
std::max(rebalancePollingInterval, SERVER_KNOBS->BG_REBALANCE_SWITCH_CHECK_INTERVAL);
|
||
TraceEvent("DDRebalancePaused", self->distributorId)
|
||
.suppressFor(5.0)
|
||
.detail("MoveType", moveType)
|
||
.detail("Reason", "Disabled");
|
||
continue;
|
||
}
|
||
|
||
if (self->priority_relocations[ddPriority] >= SERVER_KNOBS->DD_REBALANCE_PARALLELISM) {
|
||
rebalancePollingInterval =
|
||
std::min(rebalancePollingInterval * 2, SERVER_KNOBS->BG_REBALANCE_MAX_POLLING_INTERVAL);
|
||
TraceEvent("DDRebalancePaused", self->distributorId)
|
||
.suppressFor(5.0)
|
||
.detail("MoveType", moveType)
|
||
.detail("Reason", "DataMoveLimitReached")
|
||
.detail("QueuedRelocations", self->priority_relocations[ddPriority])
|
||
.detail("PollingInterval", rebalancePollingInterval);
|
||
continue;
|
||
}
|
||
|
||
rebalancePollingInterval =
|
||
std::max(rebalancePollingInterval / 2, SERVER_KNOBS->BG_REBALANCE_POLLING_INTERVAL);
|
||
|
||
state TraceEvent traceEvent(mcMove ? "MountainChopperSample" : "ValleyFillerSample", self->distributorId);
|
||
traceEvent.suppressFor(5.0);
|
||
GetTeamRequest srcReq = GetTeamRequest(mcMove ? TeamSelect::WANT_TRUE_BEST : TeamSelect::ANY,
|
||
PreferLowerDiskUtil::False,
|
||
TeamMustHaveShards::True,
|
||
PreferLowerReadUtil::False,
|
||
PreferWithinShardLimit::False,
|
||
ForReadBalance(readRebalance));
|
||
|
||
GetTeamRequest destReq = GetTeamRequest(!mcMove ? TeamSelect::WANT_TRUE_BEST : TeamSelect::ANY,
|
||
PreferLowerDiskUtil::True,
|
||
TeamMustHaveShards::False,
|
||
preferLowerReadTeam,
|
||
PreferWithinShardLimit::False,
|
||
ForReadBalance(readRebalance));
|
||
state Future<SrcDestTeamPair> getTeamFuture =
|
||
self->getSrcDestTeams(teamCollectionIndex, srcReq, destReq, ddPriority, &traceEvent);
|
||
wait(ready(getTeamFuture));
|
||
sourceTeam = getTeamFuture.get().first;
|
||
destTeam = getTeamFuture.get().second;
|
||
|
||
// clang-format off
|
||
if (sourceTeam.isValid() && destTeam.isValid()) {
|
||
if (readRebalance) {
|
||
wait(store(moved,self->rebalanceReadLoad( reason, sourceTeam, destTeam, teamCollectionIndex == 0, &traceEvent)));
|
||
} else {
|
||
wait(store(moved,self->rebalanceTeams( reason, sourceTeam, destTeam, teamCollectionIndex == 0, &traceEvent)));
|
||
}
|
||
}
|
||
// clang-format on
|
||
traceEvent.detail("Moved", moved).log();
|
||
|
||
if (moved) {
|
||
resetCount = 0;
|
||
TraceEvent(mcMove ? "MountainChopperMoved" : "ValleyFillerMoved", self->distributorId)
|
||
.suppressFor(5.0)
|
||
.detail("QueuedRelocations", self->priority_relocations[ddPriority])
|
||
.detail("PollingInterval", rebalancePollingInterval);
|
||
} else {
|
||
++resetCount;
|
||
if (resetCount > 30) {
|
||
rebalancePollingInterval = SERVER_KNOBS->BG_REBALANCE_MAX_POLLING_INTERVAL;
|
||
}
|
||
TraceEvent(mcMove ? "MountainChopperSkipped" : "ValleyFillerSkipped", self->distributorId)
|
||
.suppressFor(5.0)
|
||
.detail("QueuedRelocations", self->priority_relocations[ddPriority])
|
||
.detail("ResetCount", resetCount)
|
||
.detail("PollingInterval", rebalancePollingInterval);
|
||
}
|
||
|
||
} catch (Error& e) {
|
||
// Log actor_cancelled because it's not legal to suppress an event that's initialized
|
||
TraceEvent("RebalanceMoveError", self->distributorId).detail("MoveType", moveType).errorUnsuppressed(e);
|
||
throw;
|
||
}
|
||
}
|
||
}
|
||
|
||
struct DDQueueImpl {
|
||
ACTOR static Future<Void> run(Reference<DDQueue> self,
|
||
Reference<AsyncVar<bool>> processingUnhealthy,
|
||
Reference<AsyncVar<bool>> processingWiggle,
|
||
FutureStream<Promise<int>> getUnhealthyRelocationCount) {
|
||
|
||
state std::set<UID> serversToLaunchFrom;
|
||
state KeyRange keysToLaunchFrom;
|
||
state RelocateData launchData;
|
||
state Future<Void> recordMetrics = delay(SERVER_KNOBS->DD_QUEUE_LOGGING_INTERVAL);
|
||
|
||
state std::vector<Future<Void>> ddQueueFutures;
|
||
|
||
state PromiseStream<KeyRange> rangesComplete;
|
||
state Future<Void> launchQueuedWorkTimeout = Never();
|
||
state Future<Void> onCleanUpDataMoveActorError =
|
||
actorCollection(self->addBackgroundCleanUpDataMoveActor.getFuture());
|
||
|
||
for (int i = 0; i < self->teamCollections.size(); i++) {
|
||
ddQueueFutures.push_back(
|
||
BgDDLoadRebalance(self.getPtr(), i, DataMovementReason::REBALANCE_OVERUTILIZED_TEAM));
|
||
ddQueueFutures.push_back(
|
||
BgDDLoadRebalance(self.getPtr(), i, DataMovementReason::REBALANCE_UNDERUTILIZED_TEAM));
|
||
if (SERVER_KNOBS->READ_SAMPLING_ENABLED) {
|
||
ddQueueFutures.push_back(
|
||
BgDDLoadRebalance(self.getPtr(), i, DataMovementReason::REBALANCE_READ_OVERUTIL_TEAM));
|
||
ddQueueFutures.push_back(
|
||
BgDDLoadRebalance(self.getPtr(), i, DataMovementReason::REBALANCE_READ_UNDERUTIL_TEAM));
|
||
}
|
||
}
|
||
ddQueueFutures.push_back(delayedAsyncVar(self->rawProcessingUnhealthy, processingUnhealthy, 0));
|
||
ddQueueFutures.push_back(delayedAsyncVar(self->rawProcessingWiggle, processingWiggle, 0));
|
||
ddQueueFutures.push_back(self->periodicalRefreshCounter());
|
||
|
||
try {
|
||
loop {
|
||
self->validate();
|
||
|
||
// For the given servers that caused us to go around the loop, find the next item(s) that can be
|
||
// launched.
|
||
if (launchData.startTime != -1) {
|
||
// Launch dataDistributionRelocator actor to relocate the launchData
|
||
self->launchQueuedWork(launchData, self->ddEnabledState);
|
||
launchData = RelocateData();
|
||
} else if (!keysToLaunchFrom.empty()) {
|
||
self->launchQueuedWork(keysToLaunchFrom, self->ddEnabledState);
|
||
keysToLaunchFrom = KeyRangeRef();
|
||
}
|
||
|
||
ASSERT(launchData.startTime == -1 && keysToLaunchFrom.empty());
|
||
|
||
choose {
|
||
when(RelocateShard rs = waitNext(self->input)) {
|
||
if (rs.isRestore()) {
|
||
ASSERT(rs.dataMove != nullptr);
|
||
ASSERT(rs.dataMoveId.isValid());
|
||
self->launchQueuedWork(RelocateData(rs), self->ddEnabledState);
|
||
} else if (rs.cancelled) {
|
||
self->enqueueCancelledDataMove(rs.dataMoveId, rs.keys, self->ddEnabledState);
|
||
} else {
|
||
bool wasEmpty = serversToLaunchFrom.empty();
|
||
self->queueRelocation(rs, serversToLaunchFrom);
|
||
if (wasEmpty && !serversToLaunchFrom.empty())
|
||
launchQueuedWorkTimeout = delay(0, TaskPriority::DataDistributionLaunch);
|
||
}
|
||
}
|
||
when(wait(launchQueuedWorkTimeout)) {
|
||
self->launchQueuedWork(serversToLaunchFrom, self->ddEnabledState);
|
||
serversToLaunchFrom = std::set<UID>();
|
||
launchQueuedWorkTimeout = Never();
|
||
}
|
||
when(RelocateData results = waitNext(self->fetchSourceServersComplete.getFuture())) {
|
||
// This when is triggered by queueRelocation() which is triggered by sending self->input
|
||
self->completeSourceFetch(results);
|
||
launchData = results;
|
||
}
|
||
when(RelocateData done = waitNext(self->dataTransferComplete.getFuture())) {
|
||
complete(done, self->busymap, self->destBusymap);
|
||
if (serversToLaunchFrom.empty() && !done.src.empty())
|
||
launchQueuedWorkTimeout = delay(0, TaskPriority::DataDistributionLaunch);
|
||
serversToLaunchFrom.insert(done.src.begin(), done.src.end());
|
||
}
|
||
when(RelocateData done = waitNext(self->relocationComplete.getFuture())) {
|
||
self->activeRelocations--;
|
||
TraceEvent(SevVerbose, "InFlightRelocationChange")
|
||
.detail("Complete", done.dataMoveId)
|
||
.detail("IsRestore", done.isRestore())
|
||
.detail("Total", self->activeRelocations);
|
||
self->finishRelocation(done.priority, done.healthPriority);
|
||
self->fetchKeysComplete.erase(done);
|
||
// self->logRelocation( done, "ShardRelocatorDone" );
|
||
self->noErrorActors.add(
|
||
tag(delay(0, TaskPriority::DataDistributionLaunch), done.keys, rangesComplete));
|
||
if (g_network->isSimulated() && debug_isCheckRelocationDuration() &&
|
||
now() - done.startTime > 60) {
|
||
TraceEvent(SevWarnAlways, "RelocationDurationTooLong")
|
||
.detail("Duration", now() - done.startTime);
|
||
debug_setCheckRelocationDuration(false);
|
||
}
|
||
}
|
||
when(KeyRange done = waitNext(rangesComplete.getFuture())) {
|
||
keysToLaunchFrom = done;
|
||
}
|
||
when(wait(recordMetrics)) {
|
||
Promise<int64_t> req;
|
||
self->getAverageShardBytes.send(req);
|
||
|
||
recordMetrics = delay(SERVER_KNOBS->DD_QUEUE_LOGGING_INTERVAL, TaskPriority::FlushTrace);
|
||
|
||
auto const highestPriorityRelocation = self->getHighestPriorityRelocation();
|
||
|
||
TraceEvent("MovingData", self->distributorId)
|
||
.detail("InFlight", self->activeRelocations)
|
||
.detail("InQueue", self->queuedRelocations)
|
||
.detail("AverageShardSize", req.getFuture().isReady() ? req.getFuture().get() : -1)
|
||
.detail("UnhealthyRelocations", self->unhealthyRelocations)
|
||
.detail("HighestPriority", highestPriorityRelocation)
|
||
.detail("BytesWritten", self->moveBytesRate.getTotal())
|
||
.detail("BytesWrittenAverageRate", self->moveBytesRate.getAverage())
|
||
.detail("PriorityRecoverMove",
|
||
self->priority_relocations[SERVER_KNOBS->PRIORITY_RECOVER_MOVE])
|
||
.detail("PriorityRebalanceUnderutilizedTeam",
|
||
self->priority_relocations[SERVER_KNOBS->PRIORITY_REBALANCE_UNDERUTILIZED_TEAM])
|
||
.detail("PriorityRebalanceOverutilizedTeam",
|
||
self->priority_relocations[SERVER_KNOBS->PRIORITY_REBALANCE_OVERUTILIZED_TEAM])
|
||
.detail("PriorityRebalanceReadUnderutilTeam",
|
||
self->priority_relocations[SERVER_KNOBS->PRIORITY_REBALANCE_READ_UNDERUTIL_TEAM])
|
||
.detail("PriorityRebalanceReadOverutilTeam",
|
||
self->priority_relocations[SERVER_KNOBS->PRIORITY_REBALANCE_READ_OVERUTIL_TEAM])
|
||
.detail("PriorityStorageWiggle",
|
||
self->priority_relocations[SERVER_KNOBS->PRIORITY_PERPETUAL_STORAGE_WIGGLE])
|
||
.detail("PriorityTeamHealthy",
|
||
self->priority_relocations[SERVER_KNOBS->PRIORITY_TEAM_HEALTHY])
|
||
.detail("PriorityTeamContainsUndesiredServer",
|
||
self->priority_relocations[SERVER_KNOBS->PRIORITY_TEAM_CONTAINS_UNDESIRED_SERVER])
|
||
.detail("PriorityTeamRedundant",
|
||
self->priority_relocations[SERVER_KNOBS->PRIORITY_TEAM_REDUNDANT])
|
||
.detail("PriorityMergeShard",
|
||
self->priority_relocations[SERVER_KNOBS->PRIORITY_MERGE_SHARD])
|
||
.detail("PriorityPopulateRegion",
|
||
self->priority_relocations[SERVER_KNOBS->PRIORITY_POPULATE_REGION])
|
||
.detail("PriorityTeamUnhealthy",
|
||
self->priority_relocations[SERVER_KNOBS->PRIORITY_TEAM_UNHEALTHY])
|
||
.detail("PriorityTeam2Left", self->priority_relocations[SERVER_KNOBS->PRIORITY_TEAM_2_LEFT])
|
||
.detail("PriorityTeam1Left", self->priority_relocations[SERVER_KNOBS->PRIORITY_TEAM_1_LEFT])
|
||
.detail("PriorityTeam0Left", self->priority_relocations[SERVER_KNOBS->PRIORITY_TEAM_0_LEFT])
|
||
.detail("PrioritySplitShard",
|
||
self->priority_relocations[SERVER_KNOBS->PRIORITY_SPLIT_SHARD])
|
||
.trackLatest("MovingData"); // This trace event's trackLatest lifetime is controlled by
|
||
// DataDistributor::movingDataEventHolder. The track latest
|
||
// key we use here must match the key used in the holder.
|
||
|
||
if (SERVER_KNOBS->SHARD_ENCODE_LOCATION_METADATA && SERVER_KNOBS->ENABLE_DD_PHYSICAL_SHARD) {
|
||
TraceEvent("PhysicalShardMoveStats")
|
||
.detail("MoveCreateNewPhysicalShard", self->moveCreateNewPhysicalShard)
|
||
.detail("MoveReusePhysicalShard", self->moveReusePhysicalShard)
|
||
.detail(
|
||
"RemoteBestTeamNotReady",
|
||
self->retryFindDstReasonCount[DDQueue::RetryFindDstReason::RemoteBestTeamNotReady])
|
||
.detail(
|
||
"PrimaryNoHealthyTeam",
|
||
self->retryFindDstReasonCount[DDQueue::RetryFindDstReason::PrimaryNoHealthyTeam])
|
||
.detail("RemoteNoHealthyTeam",
|
||
self->retryFindDstReasonCount[DDQueue::RetryFindDstReason::RemoteNoHealthyTeam])
|
||
.detail("RemoteTeamIsFull",
|
||
self->retryFindDstReasonCount[DDQueue::RetryFindDstReason::RemoteTeamIsFull])
|
||
.detail(
|
||
"RemoteTeamIsNotHealthy",
|
||
self->retryFindDstReasonCount[DDQueue::RetryFindDstReason::RemoteTeamIsNotHealthy])
|
||
.detail("UnknownForceNew",
|
||
self->retryFindDstReasonCount[DDQueue::RetryFindDstReason::UnknownForceNew])
|
||
.detail("NoAnyHealthy",
|
||
self->retryFindDstReasonCount[DDQueue::RetryFindDstReason::NoAnyHealthy])
|
||
.detail("DstOverloaded",
|
||
self->retryFindDstReasonCount[DDQueue::RetryFindDstReason::DstOverloaded])
|
||
.detail("NoAvailablePhysicalShard",
|
||
self->retryFindDstReasonCount
|
||
[DDQueue::RetryFindDstReason::NoAvailablePhysicalShard])
|
||
.detail("RetryLimitReached",
|
||
self->retryFindDstReasonCount[DDQueue::RetryFindDstReason::RetryLimitReached]);
|
||
self->moveCreateNewPhysicalShard = 0;
|
||
self->moveReusePhysicalShard = 0;
|
||
for (int i = 0; i < self->retryFindDstReasonCount.size(); ++i) {
|
||
self->retryFindDstReasonCount[i] = 0;
|
||
}
|
||
}
|
||
}
|
||
when(wait(self->error.getFuture())) {} // Propagate errors from dataDistributionRelocator
|
||
when(wait(waitForAll(ddQueueFutures))) {}
|
||
when(Promise<int> r = waitNext(getUnhealthyRelocationCount)) {
|
||
r.send(self->getUnhealthyRelocationCount());
|
||
}
|
||
when(wait(onCleanUpDataMoveActorError)) {}
|
||
}
|
||
}
|
||
} catch (Error& e) {
|
||
if (e.code() != error_code_broken_promise && // FIXME: Get rid of these broken_promise errors every time
|
||
// we are killed by the master dying
|
||
e.code() != error_code_movekeys_conflict && e.code() != error_code_data_move_cancelled &&
|
||
e.code() != error_code_data_move_dest_team_not_found)
|
||
TraceEvent(SevError, "DataDistributionQueueError", self->distributorId).error(e);
|
||
throw e;
|
||
}
|
||
}
|
||
};
|
||
|
||
Future<Void> DDQueue::run(Reference<DDQueue> self,
|
||
Reference<AsyncVar<bool>> processingUnhealthy,
|
||
Reference<AsyncVar<bool>> processingWiggle,
|
||
FutureStream<Promise<int>> getUnhealthyRelocationCount,
|
||
const DDEnabledState* ddEnabledState) {
|
||
self->ddEnabledState = ddEnabledState;
|
||
return DDQueueImpl::run(self, processingUnhealthy, processingWiggle, getUnhealthyRelocationCount);
|
||
}
|
||
TEST_CASE("/DataDistribution/DDQueue/ServerCounterTrace") {
|
||
state double duration = 2.5 * SERVER_KNOBS->DD_QUEUE_COUNTER_REFRESH_INTERVAL;
|
||
state DDQueue self;
|
||
state Future<Void> counterFuture = self.periodicalRefreshCounter();
|
||
state Future<Void> finishFuture = delay(duration);
|
||
std::cout << "Start trace counter unit test for " << duration << "s ...\n";
|
||
loop choose {
|
||
when(wait(counterFuture)) {}
|
||
when(wait(finishFuture)) {
|
||
break;
|
||
}
|
||
when(wait(delayJittered(2.0))) {
|
||
std::vector<UID> team(3);
|
||
for (int i = 0; i < team.size(); ++i) {
|
||
team[i] = UID(deterministicRandom()->randomInt(1, 400), 0);
|
||
}
|
||
auto reason = RelocateReason(deterministicRandom()->randomInt(0, RelocateReason::typeCount()));
|
||
auto countType = DDQueue::ServerCounter::randomCountType();
|
||
self.serverCounter.increaseForTeam(team, reason, countType);
|
||
ASSERT(self.serverCounter.get(team[0], reason, countType));
|
||
}
|
||
}
|
||
std::cout << "Finished.";
|
||
return Void();
|
||
}
|