-
-
Notifications
You must be signed in to change notification settings - Fork 8.7k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
work on reusing code. restore. Fix typos.
- Loading branch information
1 parent
d83c22b
commit 0b15971
Showing
32 changed files
with
722 additions
and
268 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,149 @@ | ||
| /** | ||
| * Copyright 2024, XGBoost contributors | ||
| */ | ||
| #include "federated_hist.h" | ||
|
|
||
| #include "../../src/collective/allgather.h" // for AllgatherV | ||
| #include "../../src/collective/communicator-inl.h" // for GetRank | ||
| #include "../../src/tree/hist/histogram.h" // for SubtractHistParallel, BuildSampleHistograms | ||
|
|
||
| namespace xgboost::tree { | ||
| template <bool any_missing> | ||
| void FederataedHistPolicy::DoBuildLocalHistograms( | ||
| common::BlockedSpace2d const &space, GHistIndexMatrix const &gidx, | ||
| std::vector<bst_node_t> const &nodes_to_build, | ||
| common::RowSetCollection const &row_set_collection, common::Span<GradientPair const> gpair_h, | ||
| bool force_read_by_column, common::ParallelGHistBuilder *buffer) { | ||
| if (is_col_split_) { | ||
| // Call the interface to transmit gidx information to the secure worker for encrypted | ||
| // histogram computation | ||
| auto cuts = gidx.Cuts().Ptrs(); | ||
| // fixme: this can be done during reset. | ||
| if (!is_aggr_context_initialized_) { | ||
| auto slots = std::vector<int>(); | ||
| auto num_rows = gidx.Size(); | ||
| for (std::size_t row = 0; row < num_rows; row++) { | ||
| for (std::size_t f = 0; f < cuts.size() - 1; f++) { | ||
| auto slot = gidx.GetGindex(row, f); | ||
| slots.push_back(slot); | ||
| } | ||
| } | ||
| plugin_->Reset(cuts, slots); | ||
| is_aggr_context_initialized_ = true; | ||
| } | ||
|
|
||
| // Further use the row set collection info to | ||
| // get the encrypted histogram from the secure worker | ||
| std::vector<std::uint64_t const *> ptrs(nodes_to_build.size()); | ||
| std::vector<std::size_t> sizes(nodes_to_build.size()); | ||
| std::vector<bst_node_t> nodes(nodes_to_build.size()); | ||
| for (std::size_t i = 0; i < nodes_to_build.size(); ++i) { | ||
| auto nidx = nodes_to_build[i]; | ||
| ptrs[i] = row_set_collection[nidx].begin; | ||
| sizes[i] = row_set_collection[nidx].Size(); | ||
| nodes[i] = nidx; | ||
| } | ||
| hist_data_ = this->plugin_->BuildEncryptedHistVert(ptrs, sizes, nodes); | ||
| } else { | ||
| BuildSampleHistograms<any_missing>(this->n_threads_, space, gidx, nodes_to_build, | ||
| row_set_collection, gpair_h, force_read_by_column, buffer); | ||
| } | ||
| } | ||
|
|
||
| template void FederataedHistPolicy::DoBuildLocalHistograms<true>( | ||
| common::BlockedSpace2d const &space, GHistIndexMatrix const &gidx, | ||
| std::vector<bst_node_t> const &nodes_to_build, | ||
| common::RowSetCollection const &row_set_collection, common::Span<GradientPair const> gpair_h, | ||
| bool force_read_by_column, common::ParallelGHistBuilder *buffer); | ||
| template void FederataedHistPolicy::DoBuildLocalHistograms<false>( | ||
| common::BlockedSpace2d const &space, GHistIndexMatrix const &gidx, | ||
| std::vector<bst_node_t> const &nodes_to_build, | ||
| common::RowSetCollection const &row_set_collection, common::Span<GradientPair const> gpair_h, | ||
| bool force_read_by_column, common::ParallelGHistBuilder *buffer); | ||
|
|
||
| void FederataedHistPolicy::DoSyncHistogram(Context const *ctx, RegTree const *p_tree, | ||
| std::vector<bst_node_t> const &nodes_to_build, | ||
| std::vector<bst_node_t> const &nodes_to_trick, | ||
| common::ParallelGHistBuilder *buffer, | ||
| tree::BoundedHistCollection *p_hist) { | ||
| auto n_total_bins = buffer->TotalBins(); | ||
| common::BlockedSpace2d space( | ||
| nodes_to_build.size(), [&](std::size_t) { return n_total_bins; }, 1024); | ||
| CHECK(!nodes_to_build.empty()); | ||
|
|
||
| auto &hist = *p_hist; | ||
| if (is_col_split_) { | ||
| // Under secure vertical mode, we perform allgather to get the global histogram. Note | ||
| // that only the label owner (rank == 0) needs the global histogram | ||
|
|
||
| // Perform AllGather | ||
| HostDeviceVector<std::int8_t> hist_entries; | ||
| std::vector<std::int64_t> recv_segments; | ||
| collective::SafeColl( | ||
| collective::AllgatherV(ctx, linalg::MakeVec(hist_data_), &recv_segments, &hist_entries)); | ||
|
|
||
| // Call interface here to post-process the messages | ||
| common::Span<double> hist_aggr = | ||
| plugin_->SyncEncryptedHistVert(common::RestoreType<std::uint8_t>(hist_entries.HostSpan())); | ||
|
|
||
| // Update histogram for label owner | ||
| if (collective::GetRank() == 0) { | ||
| // iterator of the beginning of the vector | ||
| bst_node_t n_nodes = nodes_to_build.size(); | ||
| std::int32_t n_workers = collective::GetWorldSize(); | ||
| bst_idx_t worker_size = hist_aggr.size() / n_workers; | ||
| CHECK_EQ(hist_aggr.size() % n_workers, 0); | ||
| // Initialize histogram. For the normal case, this is done by the parallel hist | ||
| // buffer. We should try to unify the code paths. | ||
| for (auto nidx : nodes_to_build) { | ||
| auto hist_dst = hist[nidx]; | ||
| std::fill_n(hist_dst.data(), hist_dst.size(), GradientPairPrecise{}); | ||
| } | ||
|
|
||
| // for each worker | ||
| for (auto widx = 0; widx < n_workers; ++widx) { | ||
| auto worker_hist = hist_aggr.subspan(widx * worker_size, worker_size); | ||
| // for each node | ||
| for (bst_node_t nidx_in_set = 0; nidx_in_set < n_nodes; ++nidx_in_set) { | ||
| auto hist_src = worker_hist.subspan(n_total_bins * 2 * nidx_in_set, n_total_bins * 2); | ||
| auto hist_src_g = common::RestoreType<GradientPairPrecise>(hist_src); | ||
| auto hist_dst = hist[nodes_to_build[nidx_in_set]]; | ||
| CHECK_EQ(hist_src_g.size(), hist_dst.size()); | ||
| common::IncrementHist(hist_dst, hist_src_g, 0, hist_dst.size()); | ||
| } | ||
| } | ||
| } | ||
| } else { | ||
| common::ParallelFor2d(space, this->n_threads_, [&](std::size_t node, common::Range1d r) { | ||
| // Merging histograms from each thread. | ||
| buffer->ReduceHist(node, r.begin(), r.end()); | ||
| }); | ||
| // Secure mode, we need to call interface to perform encryption and decryption | ||
| // note that the actual aggregation will be performed at server side | ||
| auto first_nidx = nodes_to_build.front(); | ||
| std::size_t n = n_total_bins * nodes_to_build.size() * 2; | ||
| auto hist_to_aggr = std::vector<double>(); | ||
| for (std::size_t hist_idx = 0; hist_idx < n; hist_idx++) { | ||
| double hist_item = reinterpret_cast<double *>(hist[first_nidx].data())[hist_idx]; | ||
| hist_to_aggr.push_back(hist_item); | ||
| } | ||
| // ProcessHistograms | ||
| auto hist_buf = plugin_->BuildEncryptedHistHori(hist_to_aggr); | ||
|
|
||
| // allgather | ||
| HostDeviceVector<std::int8_t> hist_entries; | ||
| std::vector<std::int64_t> recv_segments; | ||
| auto rc = collective::AllgatherV(ctx, linalg::MakeVec(hist_buf), &recv_segments, &hist_entries); | ||
| collective::SafeColl(rc); | ||
|
|
||
| auto hist_aggr = | ||
| plugin_->SyncEncryptedHistHori(common::RestoreType<std::uint8_t>(hist_entries.HostSpan())); | ||
| // Assign the aggregated histogram back to the local histogram | ||
| for (std::size_t hist_idx = 0; hist_idx < n; hist_idx++) { | ||
| reinterpret_cast<double *>(hist[first_nidx].data())[hist_idx] = hist_aggr[hist_idx]; | ||
| } | ||
| } | ||
|
|
||
| SubtractHistParallel(ctx, space, p_tree, nodes_to_build, nodes_to_trick, buffer, p_hist); | ||
| } | ||
| } // namespace xgboost::tree |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,58 @@ | ||
| /** | ||
| * Copyright 2024, XGBoost contributors | ||
| */ | ||
| #pragma once | ||
| #include <cstdint> // for int32_t | ||
| #include <vector> // for vector | ||
|
|
||
| #include "../../src/collective/comm_group.h" // for GlobalCommGroup | ||
| #include "../../src/common/hist_util.h" // for ParallelGHistBuilder | ||
| #include "../../src/common/row_set.h" // for RowSetCollection | ||
| #include "../../src/common/threading_utils.h" // for BlockedSpace2d | ||
| #include "../../src/data/gradient_index.h" // for GHistIndexMatrix | ||
| #include "../../src/tree/hist/hist_cache.h" // for BoundedHistCollection | ||
| #include "federated_comm.h" // for FederatedComm | ||
| #include "xgboost/base.h" // for GradientPair | ||
| #include "xgboost/context.h" // for Context | ||
| #include "xgboost/span.h" // for Span | ||
| #include "xgboost/tree_model.h" // for RegTree | ||
|
|
||
| namespace xgboost::tree { | ||
| /** | ||
| * @brief Federated histogram build policy | ||
| */ | ||
| class FederataedHistPolicy { | ||
| // fixme: duplicated code | ||
| bool is_col_split_{false}; | ||
| bool is_distributed_{false}; | ||
| std::int32_t n_threads_{false}; | ||
| decltype(std::declval<collective::FederatedComm>().EncryptionPlugin()) plugin_; | ||
| xgboost::common::Span<std::uint8_t> hist_data_; | ||
| // only initialize the aggregation context once | ||
| bool is_aggr_context_initialized_ = false; // fixme | ||
|
|
||
| public: | ||
| void Reset(Context const *ctx, bool is_distributed, bool is_col_split) { | ||
| this->is_distributed_ = is_distributed; | ||
| CHECK(is_distributed); | ||
| this->n_threads_ = ctx->Threads(); | ||
| this->is_col_split_ = is_col_split; | ||
| auto const &comm = collective::GlobalCommGroup()->Ctx(ctx, DeviceOrd::CPU()); | ||
| auto const &fed = dynamic_cast<collective::FederatedComm const &>(comm); | ||
| plugin_ = fed.EncryptionPlugin(); | ||
| CHECK(is_distributed_) << "Unreachable. Single node training can not be federated."; | ||
| } | ||
|
|
||
| template <bool any_missing> | ||
| void DoBuildLocalHistograms(common::BlockedSpace2d const &space, GHistIndexMatrix const &gidx, | ||
| std::vector<bst_node_t> const &nodes_to_build, | ||
| common::RowSetCollection const &row_set_collection, | ||
| common::Span<GradientPair const> gpair_h, bool force_read_by_column, | ||
| common::ParallelGHistBuilder *buffer); | ||
|
|
||
| void DoSyncHistogram(Context const *ctx, RegTree const *p_tree, | ||
| std::vector<bst_node_t> const &nodes_to_build, | ||
| std::vector<bst_node_t> const &nodes_to_trick, | ||
| common::ParallelGHistBuilder *buffer, tree::BoundedHistCollection *p_hist); | ||
| }; | ||
| } // namespace xgboost::tree |
Oops, something went wrong.