Various optimizations are possible at each stage of mapping. These can be (but usually are not) formulated as minimizing
-
E = E1 (Performance) + E2 (Constraints)
|
This is a difficulty if constraint ensures correctness of calculation as in code generation phase of optimizing compiler for a digital computer. Then we must have E2=0 at T=0.
|
This "correctness" issue might not be present in generation of "programs" for neural (as opposed to digital) supercomputers.
|
We can study use of physical optimization in generation or execution of program
|