Expand description
Repartitioning using simulated annealing algorithms.
Structs§
- Intermediate
Partitioning Model - A simulated annealing model that moves a random subtree to the partition that maximizes memory reduction.
- Leaf
Partitioning Model - A simulated annealing model that moves a random tensor to the partition that maximizes memory reduction.
- Naive
Intermediate Partitioning Model - A simulated annealing model that moves a random subtree between random partitions.
- Naive
Partitioning Model - A simulated annealing model that moves a random tensor between random partitions.
- Simulated
Annealing Optimizer - Optimizer that implements the simulated annealing algorithm
Traits§
- OptModel
- OptModel is a trait that defines requirements to be used with optimization algorithm
Functions§
- balance_
partitions - Runs simulated annealing to find a better partitioning.