21.5 The largest LFactor we can take

For given operation O, it would seem appropriate to take the largest LFactor such that there are no causal dependencies between any two atomic operations within the LFactor:

Lf = { O_y ∈ Ψ(O) | ¬ ∃ O_x ∈ Ψ(O) such that O_x → O_y }

It is obvious that such a factorization doesn’t violate causality (i.e. there is no O_x ∈ Ψ(Rf) and O_y ∈ Ψ(Lf) such that O_x → O_y).

Note that all operations within Lf are concurrent. Therefore we should find that intervals in Lf are ordered by siteid, and therefore there is a unique insertion position.

Previous21.4 Siteid inheritance Next21.6 3-partitions of q-contiguous operations