|
| 1 | +#include "StorageObjectStorageStableTaskDistributor.h" |
| 2 | +#include <Common/SipHash.h> |
| 3 | +#include <consistent_hashing.h> |
| 4 | +#include <optional> |
| 5 | + |
| 6 | +namespace DB |
| 7 | +{ |
| 8 | + |
| 9 | +StorageObjectStorageStableTaskDistributor::StorageObjectStorageStableTaskDistributor( |
| 10 | + std::shared_ptr<IObjectIterator> iterator_, |
| 11 | + std::vector<std::string> ids_of_nodes_) |
| 12 | + : iterator(std::move(iterator_)) |
| 13 | + , connection_to_files(ids_of_nodes_.size()) |
| 14 | + , ids_of_nodes(ids_of_nodes_) |
| 15 | + , iterator_exhausted(false) |
| 16 | +{ |
| 17 | +} |
| 18 | + |
| 19 | +std::optional<String> StorageObjectStorageStableTaskDistributor::getNextTask(size_t number_of_current_replica) |
| 20 | +{ |
| 21 | + LOG_TRACE( |
| 22 | + log, |
| 23 | + "Received a new connection from replica {} looking for a file", |
| 24 | + number_of_current_replica |
| 25 | + ); |
| 26 | + |
| 27 | + // 1. Check pre-queued files first |
| 28 | + if (auto file = getPreQueuedFile(number_of_current_replica)) |
| 29 | + return file; |
| 30 | + |
| 31 | + // 2. Try to find a matching file from the iterator |
| 32 | + if (auto file = getMatchingFileFromIterator(number_of_current_replica)) |
| 33 | + return file; |
| 34 | + |
| 35 | + // 3. Process unprocessed files if iterator is exhausted |
| 36 | + return getAnyUnprocessedFile(number_of_current_replica); |
| 37 | +} |
| 38 | + |
| 39 | +size_t StorageObjectStorageStableTaskDistributor::getReplicaForFile(const String & file_path) |
| 40 | +{ |
| 41 | + size_t nodes_count = ids_of_nodes.size(); |
| 42 | + |
| 43 | + /// Trivial case |
| 44 | + if (nodes_count < 2) |
| 45 | + return 0; |
| 46 | + |
| 47 | + /// Rendezvous hashing |
| 48 | + size_t best_id = 0; |
| 49 | + UInt64 best_weight = sipHash64(ids_of_nodes[0] + file_path); |
| 50 | + for (size_t id = 1; id < nodes_count; ++id) |
| 51 | + { |
| 52 | + UInt64 weight = sipHash64(ids_of_nodes[id] + file_path); |
| 53 | + if (weight > best_weight) |
| 54 | + { |
| 55 | + best_weight = weight; |
| 56 | + best_id = id; |
| 57 | + } |
| 58 | + } |
| 59 | + return best_id; |
| 60 | +} |
| 61 | + |
| 62 | +std::optional<String> StorageObjectStorageStableTaskDistributor::getPreQueuedFile(size_t number_of_current_replica) |
| 63 | +{ |
| 64 | + std::lock_guard lock(mutex); |
| 65 | + |
| 66 | + if (connection_to_files.size() <= number_of_current_replica) |
| 67 | + throw Exception( |
| 68 | + ErrorCodes::LOGICAL_ERROR, |
| 69 | + "Replica number {} is out of range. Expected range: [0, {})", |
| 70 | + number_of_current_replica, |
| 71 | + connection_to_files.size() |
| 72 | + ); |
| 73 | + |
| 74 | + auto & files = connection_to_files[number_of_current_replica]; |
| 75 | + |
| 76 | + while (!files.empty()) |
| 77 | + { |
| 78 | + String next_file = files.back(); |
| 79 | + files.pop_back(); |
| 80 | + |
| 81 | + auto it = unprocessed_files.find(next_file); |
| 82 | + if (it == unprocessed_files.end()) |
| 83 | + continue; |
| 84 | + |
| 85 | + unprocessed_files.erase(it); |
| 86 | + |
| 87 | + LOG_TRACE( |
| 88 | + log, |
| 89 | + "Assigning pre-queued file {} to replica {}", |
| 90 | + next_file, |
| 91 | + number_of_current_replica |
| 92 | + ); |
| 93 | + |
| 94 | + return next_file; |
| 95 | + } |
| 96 | + |
| 97 | + return std::nullopt; |
| 98 | +} |
| 99 | + |
| 100 | +std::optional<String> StorageObjectStorageStableTaskDistributor::getMatchingFileFromIterator(size_t number_of_current_replica) |
| 101 | +{ |
| 102 | + { |
| 103 | + std::lock_guard lock(mutex); |
| 104 | + if (iterator_exhausted) |
| 105 | + return std::nullopt; |
| 106 | + } |
| 107 | + |
| 108 | + while (true) |
| 109 | + { |
| 110 | + ObjectInfoPtr object_info; |
| 111 | + |
| 112 | + { |
| 113 | + std::lock_guard lock(mutex); |
| 114 | + object_info = iterator->next(0); |
| 115 | + |
| 116 | + if (!object_info) |
| 117 | + { |
| 118 | + iterator_exhausted = true; |
| 119 | + break; |
| 120 | + } |
| 121 | + } |
| 122 | + |
| 123 | + String file_path; |
| 124 | + |
| 125 | + auto archive_object_info = std::dynamic_pointer_cast<StorageObjectStorageSource::ArchiveIterator::ObjectInfoInArchive>(object_info); |
| 126 | + if (archive_object_info) |
| 127 | + { |
| 128 | + file_path = archive_object_info->getPathToArchive(); |
| 129 | + } |
| 130 | + else |
| 131 | + { |
| 132 | + file_path = object_info->getPath(); |
| 133 | + } |
| 134 | + |
| 135 | + size_t file_replica_idx = getReplicaForFile(file_path); |
| 136 | + if (file_replica_idx == number_of_current_replica) |
| 137 | + { |
| 138 | + LOG_TRACE( |
| 139 | + log, |
| 140 | + "Found file {} for replica {}", |
| 141 | + file_path, |
| 142 | + number_of_current_replica |
| 143 | + ); |
| 144 | + |
| 145 | + return file_path; |
| 146 | + } |
| 147 | + |
| 148 | + // Queue file for its assigned replica |
| 149 | + { |
| 150 | + std::lock_guard lock(mutex); |
| 151 | + unprocessed_files.insert(file_path); |
| 152 | + connection_to_files[file_replica_idx].push_back(file_path); |
| 153 | + } |
| 154 | + } |
| 155 | + |
| 156 | + return std::nullopt; |
| 157 | +} |
| 158 | + |
| 159 | +std::optional<String> StorageObjectStorageStableTaskDistributor::getAnyUnprocessedFile(size_t number_of_current_replica) |
| 160 | +{ |
| 161 | + std::lock_guard lock(mutex); |
| 162 | + |
| 163 | + if (!unprocessed_files.empty()) |
| 164 | + { |
| 165 | + auto it = unprocessed_files.begin(); |
| 166 | + String next_file = *it; |
| 167 | + unprocessed_files.erase(it); |
| 168 | + |
| 169 | + LOG_TRACE( |
| 170 | + log, |
| 171 | + "Iterator exhausted. Assigning unprocessed file {} to replica {}", |
| 172 | + next_file, |
| 173 | + number_of_current_replica |
| 174 | + ); |
| 175 | + |
| 176 | + return next_file; |
| 177 | + } |
| 178 | + |
| 179 | + return std::nullopt; |
| 180 | +} |
| 181 | + |
| 182 | +} |
0 commit comments