Properties of Execution Schedules for Parallel Computations
1. There are often many valid sequences.
2. There exist some sequences which result in minimal computation.
“data flow” specification
3. There exist correct sequences which do not result in minimum computation.
Partial Orders and “weak fairness” condition.
A) No sequencing other than “weak fairness.”
B) Partial or “optimistic” sequence specifications