Uh oh!
There was an error while loading. Please reload this page.
[microNPU][3] Plan generation for the cascader - #9890
Conversation
f320c4a to
522764bCompare522764b to
9b66ba0Compare9b66ba0 to
2752396Compare2752396 to
59dd0ecCompare
manupak
left a comment
There was a problem hiding this comment.
Broadly looks good!.
I noticed that we dont have docstrings for some python functions/classes/objects that calls into C++ version that is well documented. However, it feels better to write a short summary there and with a forward pointer to detailed description.
Uh oh!
There was an error while loading. Please reload this page.
Uh oh!
There was an error while loading. Please reload this page.
Uh oh!
There was an error while loading. Please reload this page.
Uh oh!
There was an error while loading. Please reload this page.
Uh oh!
There was an error while loading. Please reload this page.
59dd0ec to
91e522bComparembaret
commented
Feb 2, 2022
I've added docs to all the functions/classes that are meant to be used/access via Python, and marked those functions which are used only for testing as private. |
The cascader creates 'Plans' which describe how to schedule subgraphs. As part of the cascading algorithm, it's necessary to explore a large variety of Plans which are Pareto optimal (in terms of memory usage and performance). This is done by the Plan generation algorithm. This commit adds the TensorConfig and Plan data structures which hold information on how to schedule the tensors/operators. Additionally, it includes functions to calculate Pareto frontiers which are used to cull sub-optimal Plans. Change-Id: Ia358b2a1b29bd810df4441027752ced75812ad4e
Change-Id: If4e083a3c96af75a8ffa72510704818d21a477d9
Change-Id: I831137f8235665bc20ab4c060cc7049ffd48088a
Change-Id: Ifbe97eb33b1ef313710f24c687a8155421a3c195
91e522b to
1a0df5cComparemanupak
commented
Feb 3, 2022
Thanks @mbaret . This is merged now! |
* [microNPU][3] Plan generation for the cascader The cascader creates 'Plans' which describe how to schedule subgraphs. As part of the cascading algorithm, it's necessary to explore a large variety of Plans which are Pareto optimal (in terms of memory usage and performance). This is done by the Plan generation algorithm. This commit adds the TensorConfig and Plan data structures which hold information on how to schedule the tensors/operators. Additionally, it includes functions to calculate Pareto frontiers which are used to cull sub-optimal Plans. Change-Id: Ia358b2a1b29bd810df4441027752ced75812ad4e * Fixes to lint/test Change-Id: If4e083a3c96af75a8ffa72510704818d21a477d9 * Improve python docs Change-Id: I831137f8235665bc20ab4c060cc7049ffd48088a * Fix enum hashing issue with old gcc Change-Id: Ifbe97eb33b1ef313710f24c687a8155421a3c195
* [microNPU][3] Plan generation for the cascader The cascader creates 'Plans' which describe how to schedule subgraphs. As part of the cascading algorithm, it's necessary to explore a large variety of Plans which are Pareto optimal (in terms of memory usage and performance). This is done by the Plan generation algorithm. This commit adds the TensorConfig and Plan data structures which hold information on how to schedule the tensors/operators. Additionally, it includes functions to calculate Pareto frontiers which are used to cull sub-optimal Plans. Change-Id: Ia358b2a1b29bd810df4441027752ced75812ad4e * Fixes to lint/test Change-Id: If4e083a3c96af75a8ffa72510704818d21a477d9 * Improve python docs Change-Id: I831137f8235665bc20ab4c060cc7049ffd48088a * Fix enum hashing issue with old gcc Change-Id: Ifbe97eb33b1ef313710f24c687a8155421a3c195
RFC: apache/tvm-rfcs#37
Issue: #9429
The cascader creates 'Plans' which describe how to schedule subgraphs. As part of the cascading algorithm, it's necessary to explore a large variety of Plans which are Pareto optimal (in terms of memory usage and performance). This is done by the Plan generation algorithm.
This commit adds the TensorConfig and Plan data structures which hold information on how to schedule the tensors/operators. Additionally, it includes functions to calculate Pareto frontiers which are used to cull sub-optimal Plans.