apaam/mlpack
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Slowly plugging in distributed tree building.

Browse Source
This commit is contained in:
Dongryeol Lee
2010-10-11 01:45:09 +00:00
parent de79b4260c
commit a1b70ebbb1
1 changed files with 4 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files
fastlib/trunk/contrib/dongryel/thesis_research/core/table/distributed_table.h
+4 -5
View File
@@ -181,7 +181,7 @@ class DistributedTable: public boost::noncopyable {
// For each process, select a subset of indices to send to the
// master node.
std::vector<int> sampled_indices;
for(int i = 0; i < this->n_entries(); i++) {
for(int i = 0; i < owned_table_->n_entries(); i++) {
if(core::math::Random() <= sample_probability_in) {
sampled_indices.push_back(i);
}
@@ -193,7 +193,7 @@ class DistributedTable: public boost::noncopyable {
// Find out the list of points sampled so that we can build a
// sampled table to build the tree from.
std::vector< std::vector<int> > list_of_sampled_indices;
int total_num_sampled_points = 0;
int total_num_sample_points = 0;
boost::mpi::gather(
*comm_, sampled_indices, list_of_sampled_indices, 0);
@@ -216,10 +216,9 @@ class DistributedTable: public boost::noncopyable {
}
// For the other nodes,
// For the other nodes, send the list of indices sampled.
else {
boost::mpi::reduce(
*comm_, random_indices.size(), boost::mpi::sum<int>(), 0);
boost::mpi::gather(*comm_, sampled_indices, 0);
}
}