
82 Energy-Aware Memory Management for EMSs
2
4
6
8
10
12
14
16
x
y
60
y – 1 = 2(x – 2)
1124 8
18
2
4
6
8
10
12
14
16
x
y
70
y – 1 = 2(x – 2)
24 9
Figure 3.6 The index space of the array references in Example 3.4 and,
respectively, in Example 3.5.
3.4 Operations with Linearly Bounded Lattices
This section will present two operations relevant in the context of data stor-
age computation: the intersection and the difference of two LBLs. While the
intersection of two LBLs was addressed in different contexts by other works
as well (e.g., [10]), the difference operation was studied more recently [42].
Afterward, this section will present the decomposition of array references
into disjoint ...