From 26e5eae6f228d5693b66a6c8332c69b01ed75bac Mon Sep 17 00:00:00 2001 From: tqchen Date: Wed, 19 Nov 2014 19:27:04 -0800 Subject: [PATCH] ok --- multi-node/README.md | 21 ++++++++++----------- 1 file changed, 10 insertions(+), 11 deletions(-) diff --git a/multi-node/README.md b/multi-node/README.md index dc2eadc6e..717b40042 100644 --- a/multi-node/README.md +++ b/multi-node/README.md @@ -23,16 +23,15 @@ Design Choice it uses an approximate histogram count algorithm, and will only examine subset of potential split points as opposed to all split points. -Run the distributed version -==== - - 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 - - ***Note*** The distributed version is still multi-threading optimized. - You should run one xgboost-mpi per node that takes most available CPU, - 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. - + Usage ==== -* [Column-based version](col-split) -* [Row-based version](row-split) +* 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 +* ***Note*** The distributed version is still multi-threading optimized. + You should run one xgboost-mpi per node that takes most available CPU, + 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. +* Examples: + - [Column-based version](col-split) + - [Row-based version](row-split)