
42 Energy-Aware Memory Management for EMSs
Equalities
Inequalities
Lines
Rays
Equalities
Inequalities
Lines
Rays
Equalities
Inequalities
Lines
Rays
Combined
Constraints
Polyhedron A
Dual
Sat
Constraints
Rays
Compute
Dual
Reduce
Polyhedron C
Pol
hedron B
Figure 2.3 Computation of intersection.
of the combined constraints. This is done by finding the extremal rays that
satisfy the combined constraints, (finding the dual of the list of constraints)
and then reducing both the constraints and rays into one polyhedron. This
procedure is illustrated in Figure 2.3.
To intersect two domains, A and B, which are unions of polyhedra, A =
∪
i
A
i
and B = ∪
j
B
j
, the pairwise intersection of