@@ -131,7 +131,7 @@ class GradientBasedNode final : public TaskSchedulerNode {
131131 }
132132
133133 int NextTaskId () final {
134- time_counter.start_timer (" TaskScheduler ::NextTaskId" );
134+ time_counter.start_timer (" GradientBasedTaskScheduler ::NextTaskId" );
135135 int n_tasks = task_records_.size ();
136136 // Round robin
137137 if (num_rounds_already_ == 0 ) {
@@ -182,12 +182,12 @@ class GradientBasedNode final : public TaskSchedulerNode {
182182 if (tasks[task_id]->runner_futures .defined ()) {
183183 JoinRunningTask (task_id);
184184 }
185- time_counter.end_timer (" TaskScheduler ::NextTaskId" );
185+ time_counter.end_timer (" GradientBasedTaskScheduler ::NextTaskId" );
186186 return task_id;
187187 }
188188
189189 Array<RunnerResult> JoinRunningTask (int task_id) final {
190- time_counter.start_timer (" TaskScheduler ::JoinRunningTask" );
190+ time_counter.start_timer (" GradientBasedTaskScheduler ::JoinRunningTask" );
191191 TaskRecord& record = task_records_[task_id];
192192 Array<RunnerResult> results = TaskSchedulerNode::JoinRunningTask (task_id);
193193 double & best_time_cost = this ->best_time_cost_per_task_ [task_id];
@@ -201,7 +201,7 @@ class GradientBasedNode final : public TaskSchedulerNode {
201201 TVM_PY_LOG (INFO, this ->logging_func )
202202 << " [Updated] Task #" << task_id << " : " << record.task ->task_name << " \n "
203203 << this ->TuningStatistics ();
204- time_counter.end_timer (" TaskScheduler ::JoinRunningTask" );
204+ time_counter.end_timer (" GradientBasedTaskScheduler ::JoinRunningTask" );
205205 return results;
206206 }
207207};
0 commit comments