25 #ifndef TVM_TIR_USMP_ALGORITHMS_H_ 26 #define TVM_TIR_USMP_ALGORITHMS_H_ 43 Map<BufferInfo, PoolAllocation>
GreedyBySize(
const Array<BufferInfo>& buffer_info_arr,
44 const Integer& memory_pressure);
54 Map<BufferInfo, PoolAllocation>
GreedyByConflicts(
const Array<BufferInfo>& buffer_info_arr,
55 const Integer& memory_pressure);
65 Map<BufferInfo, PoolAllocation>
HillClimb(
const Array<BufferInfo>& buffer_info_arr,
66 const Integer& memory_pressure);
76 Map<BufferInfo, PoolAllocation>
HillClimb(
const Array<BufferInfo>& buffer_info_arr,
77 const Integer& memory_pressure);
84 #endif // TVM_TIR_USMP_ALGORITHMS_H_ 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 > GreedyBySize(const Array< BufferInfo > &buffer_info_arr, const Integer &memory_pressure)
The Greedy-by-Size algorithm to plan memory.
runtime implementation for LibTorch/TorchScript.
Definition: analyzer.h:36
Map< BufferInfo, PoolAllocation > HillClimb(const Array< BufferInfo > &buffer_info_arr, const Integer &memory_pressure)
The Hill-Climb algoritm to plan memory.
Utilities for Unified Static Memory Planner.