CPC G06F 8/441 (2013.01) [G06F 8/37 (2013.01); G06F 8/433 (2013.01); G06F 8/452 (2013.01); G06F 8/457 (2013.01)] | 18 Claims |
1. A method comprising:
receiving information indicative of a set of loop bounds and a set of data shapes;
processing the information to determine a computation configuration based on the information, the computation configuration being compiler implementable, said processing including evaluating at least the computation configuration based on a build cost model, the build cost model representative of a data transfer cost and a data efficiency of the computation configuration; and
transmitting an instruction directing a compiler to implement the computation configuration;
wherein the build cost model includes an objective function and a constraint size, the objective function indicative of a total dynamic memory allocation transfer cost and the constraint size indicative of a capacity of a cache.
|