Optimization of the Dynamic Energy Consumption and Signal Mapping 225
Finally, the memory window for signal A has the minimum size over the
two models:
|W
A
| = min {|W |, min
C
{|W
C
|}}. The mapping functions are also available
(as exemplified in Section 6.3.1).
The next steps investigate the possibility of memory sharing between the
elements of different arrays.
Step 2 Build a complete graph G, where each vertex represents an array in
the application code. Compute weights for every edge (A,B) in the following
way:
(a) If the two arrays A and B have disjoint lifetimes, the weight is
min {|W
A
|, |W
B
|}.
(b) When the lifetimes of the two arrays overlap, compute the maximum
distance between the locations occupied by simultaneously alive A- and
B-elements, taking