Conflict Serializability
A schedule is conflict serializable if there is some serial schedule with which it is conflict equivalent.
Turns out there's a simple algorithm to test for conflict serializability!
- Make a digraph ("precedence graph") of the T's
- Directed edges mark conflicts
Theorem: schedule is conflict serializable iff graph has no cycles.