Open
Description
The current implementation of BakePlan hard-codes a table of known good prime factors of supported vector sizes. This allows a consistent performance profile known to work well on specific sizes. However, BakePlan could be extended to decompose vector sizes into multiple factors or different permutations and empirically timed to determine the best plan for the users hardware. This will increase the cost of BakePlan considerably, but BakePlan is well documented that it could run slowly. This feature is considerably more useful with persistent plans.