Minimize Prime Anchor Sets

We first serialize the anchors to make as many anchors of a vertex non-prime as possible. Since non-prime anchors can be make redundant by lengthening, this has the effect of reducing the synchronization cost of the final control implementation. This is particularly important for control-dominated designs because 

The lower bound on the synchronization control cost corresponds to the case where every vertex, excluding the source, has a single synchronization point, i.e. = 1 1 where /f (v) is the number of irredundant 

Definition 9.3.1 An anchor cluster, denoted by Aj, is a maximal subset of strongly connected anchors in the constraint graph. 

The set of anchor clusters is denoted by Ao, Ai. A, who-e Ao is the cluster containing the source vertex. A constraint graph is called elementary if all anchor clusters contain a single anchor, i.e. A, = 1, Vt. 

Definition 9. 2 A cluster ordering of a constraint graph G is a complete serialization of the anchor clusters of G, such that for every pair of clusters A and Xj, every anchor a A,- is serialized with respect to every anchor b e Xj. The graph G with a cluster ordering is called an ordered graph. 

---

Minimize the prime anchor sets - by serializing the anchors. 

---