jcf94 commented on a change in pull request #5962: URL: https://github.com/apache/incubator-tvm/pull/5962#discussion_r449849918
########## File path: src/ansor/measure.cc ########## @@ -0,0 +1,331 @@ +/* + * Licensed to the Apache Software Foundation (ASF) under one + * or more contributor license agreements. See the NOTICE file + * distributed with this work for additional information + * regarding copyright ownership. The ASF licenses this file + * to you under the Apache License, Version 2.0 (the + * "License"); you may not use this file except in compliance + * with the License. You may obtain a copy of the License at + * + * http://www.apache.org/licenses/LICENSE-2.0 + * + * Unless required by applicable law or agreed to in writing, + * software distributed under the License is distributed on an + * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY + * KIND, either express or implied. See the License for the + * specific language governing permissions and limitations + * under the License. + */ + +/*! + * \file ansor/measure.cc + * \brief Distributed measurement infrastructure to measure the runtime costs of tensor programs. + */ + +#include "measure.h" + +#include <tvm/runtime/registry.h> + +#include <algorithm> + +#include "utils.h" + +namespace tvm { +namespace ansor { + +TVM_REGISTER_NODE_TYPE(MeasureInputNode); +TVM_REGISTER_NODE_TYPE(BuildResultNode); +TVM_REGISTER_NODE_TYPE(MeasureResultNode); +TVM_REGISTER_OBJECT_TYPE(MeasureCallbackNode); +TVM_REGISTER_OBJECT_TYPE(ProgramRunnerNode); +TVM_REGISTER_OBJECT_TYPE(ProgramBuilderNode); +TVM_REGISTER_OBJECT_TYPE(LocalBuilderNode); +TVM_REGISTER_OBJECT_TYPE(LocalRunnerNode); + +static const char* ErrorNoToStr[] = { + "NoError", + "InstantiationError", + "CompileHostError", + "CompileDeviceError", + "RuntimeDeviceError", + "WrongAnswerError", + "BuildTimeoutError", + "RunTimeoutError", + "UnknownError", +}; + +/********** Measure input and result **********/ +MeasureInput::MeasureInput(SearchTask task, State state) { + auto node = make_object<MeasureInputNode>(); + node->task = std::move(task); + node->state = std::move(state); + data_ = std::move(node); +} + +MeasureInput MeasureInputNode::copy() const { + auto node = make_object<MeasureInputNode>(); + node->task = task; + node->state = state; + return MeasureInput(node); +} + +BuildResult::BuildResult(String filename, Array<te::Tensor> args, int error_no, String error_msg, + double time_cost) { + auto node = make_object<BuildResultNode>(); + node->filename = std::move(filename); + node->args = std::move(args); + node->error_no = error_no; + node->error_msg = std::move(error_msg); + node->time_cost = time_cost; + data_ = std::move(node); +} + +MeasureResult::MeasureResult(Array<PrimExpr> costs, int error_no, String error_msg, double all_cost, + double timestamp) { + auto node = make_object<MeasureResultNode>(); + node->costs = std::move(costs); + node->error_no = error_no; + node->error_msg = std::move(error_msg); + node->all_cost = all_cost; + node->timestamp = timestamp; + data_ = std::move(node); +} + +MeasureResult MeasureResultNode::copy() const { + auto node = make_object<MeasureResultNode>(); + node->costs = costs; + node->error_no = error_no; + node->error_msg = error_msg; + node->all_cost = all_cost; + node->timestamp = timestamp; + return MeasureResult(node); +} + +/********** LocalBuilder **********/ +LocalBuilder::LocalBuilder(int timeout, int n_parallel, const String& build_func) { + auto node = make_object<LocalBuilderNode>(); + node->timeout = timeout; + node->n_parallel = n_parallel; + node->build_func = build_func; + data_ = std::move(node); +} + +Array<BuildResult> LocalBuilderNode::Build(const Array<MeasureInput>& inputs, int verbose) { + if (const auto* f = runtime::Registry::Get("ansor.local_builder.build")) { + Array<BuildResult> results = (*f)(inputs, timeout, n_parallel, build_func, verbose); + return results; + } else { + LOG(FATAL) << "ansor.local_builder.build is not registered"; + } + return Array<BuildResult>(); +} + +/********** LocalRunner **********/ +LocalRunner::LocalRunner(int timeout, int number, int repeat, int min_repeat_ms, + double cooldown_interval) { + ObjectPtr<LocalRunnerNode> node = make_object<LocalRunnerNode>(); + node->timeout = timeout; + node->number = number; + node->repeat = repeat; + node->min_repeat_ms = min_repeat_ms; + node->cooldown_interval = cooldown_interval; + data_ = std::move(node); +} + +Array<MeasureResult> LocalRunnerNode::Run(const Array<MeasureInput>& inputs, + const Array<BuildResult>& build_results, int verbose) { + if (const auto* f = runtime::Registry::Get("ansor.local_runner.run")) { + Array<MeasureResult> results = (*f)(inputs, build_results, timeout, number, repeat, + min_repeat_ms, cooldown_interval, verbose); + return results; + } else { + LOG(FATAL) << "ansor.local_runner.run is not registered"; + } + return Array<MeasureResult>(); +} + +/********** ProgramMeasurer **********/ +ProgramMeasurer::ProgramMeasurer(ProgramBuilder builder, ProgramRunner runner, + Array<MeasureCallback> callbacks, int verbose, + int max_continous_error) { + auto node = make_object<ProgramMeasurerNode>(); + node->builder = std::move(builder); + node->runner = std::move(runner); + node->callbacks = std::move(callbacks); + node->verbose = verbose; + node->max_continous_error = max_continous_error < 0 + ? ProgramMeasurerNode::DEFAULT_MAX_CONTINOUS_ERROR + : max_continous_error; + data_ = std::move(node); +} + +void ProgramMeasurerNode::Reset() { + ct = error_ct = 0; + best_flops.clear(); + best_ct.clear(); + best_state.clear(); +} + +void ProgramMeasurerNode::Measure(const SearchTask& task, const SearchPolicy& policy, + const Array<MeasureInput>& inputs, Array<MeasureResult>* results, + int batch_size) { + results->clear(); + results->reserve(inputs.size()); + + if (batch_size == -1) { + // set default batch size + batch_size = builder->n_parallel * 2; + } + + StdCout(verbose) << "Get " << inputs.size() << " programs for measure. (This may take a while)" + << std::endl; + + for (size_t i = 0; i < inputs.size(); i += batch_size) { + Array<MeasureInput> input_batch(inputs.begin() + i, + inputs.begin() + std::min(i + batch_size, inputs.size())); + Array<MeasureResult> result_batch; + + // build and run + SilentMeasure(task, input_batch, &result_batch); + + // update current best state according to the new measure result + for (size_t j = 0; j < input_batch.size(); ++j) { + double flops; + if (result_batch[j]->error_no == 0) { + flops = task->compute_dag->flop_ct / FloatArrayMean(result_batch[j]->costs); + error_ct = 0; + } else { + flops = 0.0; + error_ct++; + } + + const String& workload_key = input_batch[j]->task->workload_key; + if (flops > best_flops[workload_key]) { + best_flops[workload_key] = flops; + best_state[workload_key] = input_batch[j]->state; + best_ct[workload_key] = ct; + } + + ct++; + StdCout(verbose) << std::fixed << std::setprecision(2) << Chars('=', 50) << "\n" + << "No: " << ct << "\tGFLOPS: " << flops / 1e9 << " / " + << best_flops[workload_key] / 1e9 << "\tresults: " << result_batch[j] << "\n" + << Chars('=', 50) << "\n" + << input_batch[j]->state << "\n"; + } + + // Call callback functions + for (const auto& callback : callbacks) { + callback->Callback(policy, input_batch, result_batch); + } + + // Store result batch + for (auto& res : result_batch) { + results->push_back(res); + } + + if (error_ct > max_continous_error) { + LOG(FATAL) << "Too many errors happened during tuning"; + } + } +} + +void ProgramMeasurerNode::SilentMeasure(const SearchTask& task, const Array<MeasureInput>& inputs, + Array<MeasureResult>* results) { + // Close the thread pool to avoid the conflits with python environment + ThreadPool::Global().Abort(); + + results->clear(); + results->reserve(inputs.size()); + Array<MeasureInput> input_batch(inputs.begin(), inputs.end()); Review comment: Cleaned. ---------------------------------------------------------------- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. For queries about this service, please contact Infrastructure at: [email protected]
