未验证 提交 d625aaf0 编写于 作者: Z Zeng Jinle 提交者: GitHub

remove so many logs of parallel executor, test=develop (#21105)

上级 e249d9a3
...@@ -34,6 +34,8 @@ limitations under the License. */ ...@@ -34,6 +34,8 @@ limitations under the License. */
DECLARE_bool(use_ngraph); DECLARE_bool(use_ngraph);
DECLARE_double(eager_delete_tensor_gb);
#ifdef WITH_GPERFTOOLS #ifdef WITH_GPERFTOOLS
#include "gperftools/profiler.h" #include "gperftools/profiler.h"
#endif #endif
...@@ -282,8 +284,8 @@ ir::Graph *ParallelExecutorPrivate::ApplyMemoryOptimizePass(ir::Graph *graph) { ...@@ -282,8 +284,8 @@ ir::Graph *ParallelExecutorPrivate::ApplyMemoryOptimizePass(ir::Graph *graph) {
VLOG(10) << "Start to apply buffer_shared_inplace_pass"; VLOG(10) << "Start to apply buffer_shared_inplace_pass";
graph = inplace_pass->Apply(graph); graph = inplace_pass->Apply(graph);
VLOG(10) << "buffer_shared_inplace_pass Applied"; VLOG(10) << "buffer_shared_inplace_pass Applied";
LOG(INFO) << "Inplace strategy is enabled, when " LOG_FIRST_N(INFO, 1) << "Inplace strategy is enabled, when "
"build_strategy.enable_inplace = True"; "build_strategy.enable_inplace = True";
} }
/** /**
...@@ -365,9 +367,9 @@ ir::Graph *ParallelExecutorPrivate::ApplyMemoryOptimizePass(ir::Graph *graph) { ...@@ -365,9 +367,9 @@ ir::Graph *ParallelExecutorPrivate::ApplyMemoryOptimizePass(ir::Graph *graph) {
eager_deletion_pass->SetNotOwned(ir::kAllPlaces, &places_); eager_deletion_pass->SetNotOwned(ir::kAllPlaces, &places_);
graph = eager_deletion_pass->Apply(graph); graph = eager_deletion_pass->Apply(graph);
VLOG(10) << "EagerDeletionPass Applied"; VLOG(10) << "EagerDeletionPass Applied";
LOG(INFO) << "Garbage collection strategy is enabled, when " LOG_FIRST_N(INFO, 1) << "Garbage collection strategy is enabled, when "
<< "FLAGS_eager_delete_tensor_gb = " << "FLAGS_eager_delete_tensor_gb = "
<< (static_cast<double>(GetEagerDeletionThreshold()) / (1 << 30)); << FLAGS_eager_delete_tensor_gb;
} }
return graph; return graph;
} }
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册