tvm
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
algorithms.h
Go to the documentation of this file.
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 
25 #ifndef TVM_TIR_USMP_ALGORITHMS_H_
26 #define TVM_TIR_USMP_ALGORITHMS_H_
27 
28 #include <tvm/tir/usmp/utils.h>
29 
30 namespace tvm {
31 namespace tir {
32 namespace usmp {
33 namespace algo {
34 
44  const Integer& memory_pressure);
45 
55  const Integer& memory_pressure);
66  const Integer& memory_pressure);
67 
77  const Integer& memory_pressure);
78 
79 } // namespace algo
80 } // namespace usmp
81 } // namespace tir
82 } // namespace tvm
83 
84 #endif // TVM_TIR_USMP_ALGORITHMS_H_
Container of constant int that adds more constructors.
Definition: expr.h:622
Array, container representing a contiguous sequence of ObjectRefs.
Definition: array.h:289
Map container of NodeRef->NodeRef in DSL graph. Map implements copy on write semantics,...
Definition: map.h:1271
Map< BufferInfo, PoolAllocation > GreedyBySize(const Array< BufferInfo > &buffer_info_arr, const Integer &memory_pressure)
The Greedy-by-Size algorithm to plan memory.
Map< BufferInfo, PoolAllocation > GreedyByConflicts(const Array< BufferInfo > &buffer_info_arr, const Integer &memory_pressure)
The Greedy-by-Conflicts algorithm to plan memory.
Map< BufferInfo, PoolAllocation > HillClimb(const Array< BufferInfo > &buffer_info_arr, const Integer &memory_pressure)
The Hill-Climb algoritm to plan memory.
runtime implementation for LibTorch/TorchScript.
Definition: analyzer.h:36
Utilities for Unified Static Memory Planner.