
Computation of Data Storage Requirements 87
036
2
4
6
8
10
12
14
16
x
y
18
L1
L2
Lbl
2
L3
036
2
4
6
8
10
12
14
16
x
y
18
–5x + 3y = 18
–5x + 3y = 0
(a) (b)
Figure 3.8 (a) The index space of the array reference in Example 3.2. (b)
The difference Lbl
1
− Lbl
2
, where the two lattices correspond to the array
references in Example 3.7. Lbl
1
contains all the lattice points in the rectangle
and Lbl
2
contains the 12 black points. The difference has (at least) seven
LBL components. Two components are L
1
(all the lattice points in the upper
quadrilateral) and L
2
(all the lattice points in the lower triangle). Another
LBL component L
3
covers the six gray points in the middle area. (Reprinted
from [56] ...