1/*
2 * Licensed to the Apache Software Foundation (ASF) under one
3 * or more contributor license agreements. See the NOTICE file
4 * distributed with this work for additional information
5 * regarding copyright ownership. The ASF licenses this file
6 * to you under the Apache License, Version 2.0 (the
7 * "License"); you may not use this file except in compliance
8 * with the License. You may obtain a copy of the License at
9 *
10 * http://www.apache.org/licenses/LICENSE-2.0
11 *
12 * Unless required by applicable law or agreed to in writing,
13 * software distributed under the License is distributed on an
14 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
15 * KIND, either express or implied. See the License for the
16 * specific language governing permissions and limitations
17 * under the License.
18 */
19
20/*!
21 * \file relay/collage/collage_partitioner.h
22 * \brief Search for an optimal partitioning of a Relay model.
23 *
24 * See:
25 * Collage: Automated Integration of Deep Learning Backends
26 * Byungsoo Jeon, Sunghyun Park, Peiyuan Liao, Sheng Xu, Tianqi Chen, Zhihao Jia
27 * https://arxiv.org/pdf/2111.00655.pdf
28 */
29#ifndef TVM_RELAY_COLLAGE_COLLAGE_PARTITIONER_H_
30#define TVM_RELAY_COLLAGE_COLLAGE_PARTITIONER_H_
31
32#include <tvm/relay/transform.h>
33
34#include "./cost_estimator.h"
35
36namespace tvm {
37namespace relay {
38namespace collage {
39
40/*!
41 * \brief Explores the space of all possible (sub-graph, target) pairs which cover the
42 * model, and applies the globally optimal choice (assuming partition costs are additive).
43 */
44transform::Pass CollagePartition(CompilationConfig config, CostEstimator cost_estimator);
45
46} // namespace collage
47} // namespace relay
48} // namespace tvm
49
50#endif // TVM_RELAY_COLLAGE_COLLAGE_PARTITIONER_H_
51