Information Technology Reference
In-Depth Information
F
IG
. 11. Final access forest using Least-Cost Path method and generation of the access pattern for the
first broadcast cycle.
After the access pattern for the first broadcast pass is determined, steps 2-9 are
repeated to generate a new updated forest until every object in the user's request is
scheduled for retrieval. Once all objects are covered by access patterns, the algo-
rithm is complete, and the objects may be retrieved from the broadcast using the
determined order.
Figure 12
shows the complete access patterns of our running ex-
ample.
4.
Object Organization on Single Broadcast Channel
In this section we investigate two heuristic-based data allocation strategies. The
first strategy assumes a strict linearity requirement and deals with non-weighted
DAGs. The second approach relaxes such strictness in favor of clustering strongly
related objects closer to one another and consequently deals with weighted DAGs.
