Hendrik/xgboost
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

chg

Browse Source
This commit is contained in:
tqchen 2014-11-19 19:25:49 -08:00
parent 338117867b
commit 41eac089c8
1 changed files with 4 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
multi-node/README.md
View File

@ -22,10 +22,12 @@ Design Choice
- Row-based solver split data by row, each node work on subset of rows, - Row-based solver split data by row, each node work on subset of rows,
it uses an approximate histogram count algorithm, and will only examine subset of it uses an approximate histogram count algorithm, and will only examine subset of
potential split points as opposed to all split points. potential split points as opposed to all split points.
* How to run the distributed version
Run the distributed version
====
- The current code run in MPI enviroment, you will need to have a network filesystem, - The current code run in MPI enviroment, you will need to have a network filesystem,
or copy data to local file system before running the code or copy data to local file system before running the code
- The distributed version is still multi-threading optimized. - ***Note*** The distributed version is still multi-threading optimized.
You should run one xgboost-mpi per node that takes most available CPU, You should run one xgboost-mpi per node that takes most available CPU,
this will reduce the communication overhead and improve the performance. this will reduce the communication overhead and improve the performance.
- One way to do that is limit mpi slot in each machine to be 1, or reserve nthread processors for each process. - One way to do that is limit mpi slot in each machine to be 1, or reserve nthread processors for each process.