Information Technology Reference
In-Depth Information
(a)
(b)
(c)
F
IG
. 41. A running example of the SES algorithm. (a) Starting with the largest leftmost empty block
with an obstacle (Definition 18 and 6-8). (b) Find an overlapped empty block (Definition 13, 10-11) and
switch. (c) Logical rearrangement of object 4 and advancing the empty block (12). Repeated operational
flow as of (a), (b) and (c), and generation of an empty channel (9-16). (e) Starting with the largest leftmost
empty block with an obstacle (6-8). (f) Find an overlapped empty block and switch (10-11). (g) Find an
overlapped empty block and switch (12). (h) Logical rearrangement of object 4 and advancing the empty
block (10-11). (i) Find an overlapped empty block and switch (10-11, 12-13). (j) Logical rearrangement
of objects 11 and 13, switch, and advancing the empty block (10-11, 12-13). (k) Generation of second
empty channel. (l) The Final access patterns.
